Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

SCMS Operations Management > Chapter 16 > Flashcards

Chapter 16 Flashcards

1
Q
  1. Scheduling pertains to:
    a. hiring workers

    b. process selection

    c. buying machinery
    d. timing the use of specific resources
    e. determining the lowest cost
A

d. timing the use of specific resources

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
  1. Which of the following is the last step in the capacity/scheduling chain?
    a. product planning

    b. process planning

    c. capacity planning
    d. aggregate planning
    e. scheduling
A

e. scheduling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q
  1. Which of the following is not an example of a high-volume system?
    a. aircraft manufacturing

    b. magazine printing

    c. petroleum refining
    d. waste treatment

    e. commercial donut baking
A

a. aircraft manufacturing


How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q
  1. Which of the following is not usually a characteristic of successful high-volume systems?
    a. smooth workflow through the system

    b. customized output

    c. rapid repair of breakdowns
    d. minimal quality problems
    e. reliable supply schedules
A

b. customized output


How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q 
42. Primary considerations in scheduling high-volume systems involve: 
(I) coordinating the flow of inputs

(II) overcoming the disruptions to planned outputs

(III) assigning workers to work centers 
a.	I and III

b.	I and II

c.	II and III 
d.	I, II, and III 
e.	II only
A

b. I and II


How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q
  1. Organizations with fixed, perishable capacity can benefit from _______.
    a. Yield Management

    b. Price increases

    c. Constraints
    d. Sub-optimization
    e. Waiting lines
A

a. Yield Management


How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q
  1. A work center can be a ___________.
    a. machine

    b. group of machines

    c. department
    d. facility

    e. all of the above
A

e. all of the above

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q
  1. The EDD priority rule usually does well with regard to _______.
    a. Cost

    b. Lateness

    c. Overtime
    d. Waste

    e. Makespan
A

b. Lateness


How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  1. Which of the following is not an assumption of priority rules?

    a. The set of jobs is known: no new jobs arrive after processing begins.
    b. Setup time is independent of processing sequence.

    c. Finite loading is assumed.

    d. Processing times are deterministic.

    e. No machine breakdowns are assumed.
A

c. Finite loading is assumed.


How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q
  1. The two different approaches to load work centers in job-shop scheduling are:
    a. load charts and schedule charts

    b. Gantt charts and assignment method

    c. infinite loading and finite loading
    d. linear programming and makespan
    e. none of the above
A

c. infinite loading and finite loading

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
  1. The priority rule which will sequence jobs in the order they are received is _________.
    a. EDD

    b. LIFO

    c. SPT
    d. CR
    e. FCFS
A

e. FCFS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q
  1. A scheduling technique used to achieve an optimum, one-to-one matching of tasks and resources is:
    a. the assignment method

    b. Johnson’s rule

    c. the optimum production technology method (OPT)
    d. the appointment method
    e. the reservation method
A

a. the assignment method


How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q
  1. In a task assignment situation, in how many different ways can five jobs be assigned to five machines?
    a. 1

    b. 5

    c. 25
    d. 120
    e. 3,125
A

d. 120

This is simply calculated as 5!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q
  1. In an assignment method problem, if it takes Abe 3 hours to build a birdhouse and 4 hours for a doghouse, while Betty takes 4 hours for a birdhouse and 3 hours for a doghouse, what is the reduced cost (in hours) of assigning Abe to build the doghouse?

    a. 0 hours
    b. 1 hour
    c. 2 hours
    d. 3 hours
    e. 4 hours
A

b. 1 hour

Abe is one hour slower at building the doghouse.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q
  1. The matrix below shows relative costs for various job-machine combinations. Which set of pairs constitutes the minimum-cost solution using the Assignment method?

a. 1-B, 2-C, 3-A
b. 1-B, 2-A, 3-C
c. 1-A, 2-C, 3-B
d. 1-A, 2-B, 3-C
e. 1-C, 2-A, 3-B

A

e. 1-C, 2-A, 3-B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q
  1. Based on the cost information given in the table below, which set of job-machine pairs reflects the minimum-cost solution using the Assignment method?

a. 1-B, 2-A, 3-C
b. 1-A, 2-B, 3-C
c. 1-C, 2-A, 3-B
d. 1-B, 2-C, 3-A
e. 1-C, 2-B, 3-A

A

a. 1-B, 2-A, 3-C

17
Q
  1. Effective scheduling cannot:

    a. yield cost savings and improved productivity
    b. reduce the need for expansion of facilities

    c. improve customer service

    d. eliminate the need to train employees

    e. improve patient care in medical settings
A

d. eliminate the need to train employees


18
Q
  1. The priority rule where jobs are processed according to the smallest ratio of due date to processing time is:
    a. CR

    b. EEDD

    c. FCFS
    d. S/O
    e. SPT
A

a. CR


19
Q
  1. Scheduled due dates are the result of:
    a. promises to customers

    b. MRP processing

    c. managerial decisions
    d. all of the above

    e. our competitor’s promises
A

d. all of the above


20
Q
  1. Which of the following is not a measure for judging the effectiveness of a schedule sequence?
    a. average number of jobs at the work center

    b. total number of jobs at the work center

    c. average completion (flow) time
    d. average job tardiness
    e. none of the above
A

b. total number of jobs at the work center


21
Q
  1. The purpose of cyclical scheduling is to:
    a. eliminate weekends and holidays

    b. rotate schedules

    c. add flexible hours
    d. incorporate overtime
    e. observe work patterns
A

b. rotate schedules


22
Q
  1. Average completion (flow) time for a schedule sequence at a work center is:
    a. the sum of processing time divided by the number of jobs

    b. the sum of jobs’ flow times divided by the number of jobs

    c. overall flow time divided by total processing time
    d. total processing time plus total late time divided by number of jobs
    e. the sum of flow time plus total late time divided by number of jobs
A

b. the sum of jobs’ flow times divided by the number of jobs


23
Q
  1. The scheduling sequencing rule which always results in the lowest average completion (flow) time is the:
    a. first come, first served (FCFS) rule

    b. shortest processing time first (SPT) rule

    c. earliest due date first (EDD) rule
    d. least slack per operation first (S/O) rule
    e. run until slack happens (RUSH) rule
A

b. shortest processing time first (SPT) rule


24
Q
  1. Which sequencing rule is designed specifically to minimize job tardiness?
    a. S/O

    b. EDD

    c. FCFS
    d. SPT
    e. LPT
A

b. EDD


25
Q
  1. A scheduling rule used for sequencing jobs through two work centers is:
    a. critical ratio rule

    b. Johnson’s rule

    c. slack per operation rule
    d. shortest processing time rule
    e. Pareto rule
A

b. Johnson’s rule


26
Q
  1. For the jobs listed below, which processing sequence would result using Johnson’s Rule?

a. c-a-d-b
b. b-d-a-c
c. a-b-c-d
d. d-c-b-a
e. c-a-b-d

A

e. c-a-b-d

27
Q
  1. What is the optimum job sequence for the jobs listed below using Johnson’s Rule?

a. e-g-f-d
b. d-g-f-e
c. d-f-g-e
d. e-d-f-g
e. f-e-d-g

A

c. d-f-g-e

28
Q
  1. A major difference between manufacturing and service systems in terms of scheduling is:
    a. variability in arrival and service rates

    b. processing cost per unit

    c. the number of units to be processed
    d. length of processing time
    e. output rate
A

a. variability in arrival and service rates


29
Q
  1. Scheduling in service systems often takes the form of:
    a. appointment systems

    b. reservation systems

    c. (A) and (B)
    d. makespan systems
    e. all of the above
A

c. (A) and (B)

30
Q
  1. Scheduling in service systems may involve scheduling:
    a. the workforce.

    b. the equipment.

    c. (a) and (b).
    d. customers.

    e. all of the above.
A

e. all of the above.

31
Q
  1. One disadvantage of appointment systems is:

    a. Capacity can be adjusted by varying hours.

    b. The customer’s desired time may be already taken.
    c. People generally accept it as fair.

    d. It can reduce customer waiting time.

    e. Appointments do not have to be all the same length.
A

b. The customer’s desired time may be already taken.

32
Q
  1. In an assignment model where there are fewer jobs than resources:
    a. Dummy jobs are needed to solve the problem.

    b. Dummy resources are needed to solve the problem.

    c. The problem can’t be solved using an assignment model.
    d. The problem will have multiple optimum solutions.

    e. The simplex method must be used to solve the problem.
A

a. Dummy jobs are needed to solve the problem.


SCMS Operations Management (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions