Russell Scheduling Exam Questions Ch.17

File: ch17, Chapter 17: Scheduling

True/False

1. Scheduling specifies when labor, equipment, and _______ are needed to produce a product.
   1. suppliers
   2. capacity
   3. customers
   4. facilities
2. Scheduling is considered the _______ stage of the planning process.
   1. first
   2. last
   3. most important
   4. least important
3. The wide variety of jobs in a job shop makes scheduling easy.

Difficulty: Easy

Learning Objective: LO 1

1. Managers typically use multiple objectives when constructing a schedule.

Difficulty: Easy

Learning Objective: LO 1

1. Minimizing overtime is one of several objectives that could be considered when constructing a schedule.

Difficulty: Easy

Learning Objective: LO 1

1. __________ is the scheduling and monitoring of day-to-day production in a job shop.
   1. The assignment method
   2. Production control
   3. Dispatching
   4. Load leveling
2. The scheduling function for mass production and job shop production are basically the same.

Difficulty: Moderate

Learning Objective: LO 1

1. Job shop scheduling is also known as shop floor control.

Difficulty: Moderate

Learning Objective: LO 1

1. Gantt charts show the planned and yet to be completed activities against total activities.

Difficulty: Moderate

Learning Objective: LO 1

1. The dispatch list contains the order in which work is assigned to a productive resource.

Difficulty: Moderate

Learning Objective: LO 1

1. The process of assigning work to limited resources is known as scheduling.

Difficulty: Moderate

Learning Objective: LO 2

1. The assignment method of linear programming can be used to determine the best allocation of jobs to machines or workers to tasks.

Difficulty: Easy

Learning Objective: LO 2

1. In a job shop environment, the process of prioritizing jobs assigned to a productive resource is called
   1. resource planning.
   2. sequencing.
   3. opportunity costs.
   4. scheduling.
2. Tardiness is defined as the difference between a job’s
3. flow time and makespan.
4. makespan and cycle time.
5. due date and completion date.
6. due date and start date.
7. Sequencing involves determining the order in which jobs are released to the shop floor.

Difficulty: Hard

Learning Objective: LO 2

1. The sequence in which jobs should be processed is typically determined using linear programming.

Difficulty: Moderate

Learning Objective: LO 2

1. The time required for a job to move through the system is referred to as
2. makespan.
3. cycle time
4. flow time.
5. takt time.
6. All sequencing rules strive to optimize both processing efficiency and due date performance.

Difficulty: Moderate

Learning Objective: LO 2

1. Johnson’s rule gives an optimal sequence for jobs processed serially through ______ processes..
2. 1
3. 2
4. 3
5. 4
7. The shortest processing time (SPT) rule is most useful when the job shop is
8. congested.
9. not congested.
10. at optimal utilization.
11. below optimal utilization.
12. The longest processing time (LPT) rule tends to complete larger jobs in-house when subcontracting is anticipated.

Difficulty: Moderate

Learning Objective: LO 2

1. The first-come, first-served (FCFS) sequencing rule should be only used when operating at high levels of capacity.

Difficulty: Moderate

Learning Objective: LO 2

1. Input/output control provides the information necessary to regulate work flow in a job shop environment.

Difficulty: Moderate

Learning Objective: LO 2

1. A work package travels with a job to specify what work needs to be done at a particular work station and where the job goes next.

Difficulty: Easy

Learning Objective: LO 2

1. Gantt charts show the planned but not the completed activities against a time scale.

Learning Objective: LO 2

1. Finite scheduling _______ a resource beyond its fixed capacity.
2. will not load
3. will load
4. will sequence
5. will not sequence
6. A manufacturing execution system is software that uses intelligent analytical tools and techniques to develop realistic schedules.

Learning Objective: LO 3

1. Genetic algorithms are based on the natural selection properties of genetics.

Learning Objective: LO 3

1. Increasing the capacity of a work center that is a bottleneck increases output.

Difficulty: Moderate

Learning Objective: LO 4

1. The _________________ approach to scheduling concentrates on scheduling the bottleneck resources.
2. assignment
3. First come, first served
4. Last come, last served
5. theory of constraints
6. With drum-buffer-rope (DBR), the bottleneck resource is always the buffer.

Difficulty: Moderate

Learning Objective: LO 4

1. Scheduling using the theory of constraints (TOC) requires that process batch sizes and transfer batch sizes always match.

Difficulty: Moderate

Learning Objective: LO 4

1. Typically, there are more options available when scheduling employees because labor is a very flexible resource.

Difficulty: Moderate

Learning Objective: LO 5

1. The assignment method of linear programming can be used for both loading and employee scheduling.

Difficulty: Moderate

Learning Objective: LO 5

Multiple Choice

1. Which of the following is not typically considered an objective of scheduling?
2. minimizing job lateness
3. maximizing time in the system
4. minimizing overtime
5. maximizing machine utilization

Difficulty: Easy

Learning Objective: LO 1

1. ______________ specifies when the labor, equipment and facilities are needed to produce a good or to provide a service.
2. Loading
3. Scheduling
4. Dispatching
5. Shop floor control

Difficulty: Easy

Learning Objective: LO 1

1. Which of the following is a possible objective in constructing a schedule.
2. Minimizing idle time
3. Minimizing response time
4. Meeting customer due dates
5. All of these answer choices are correct.

Difficulty: Easy

Learning Objective: LO 1

1. ______________ is the scheduling and monitoring of day-to-day production in a job shop.
2. Loading
3. Load Leveling
4. Dispatching
5. Shop floor control

Difficulty: Easy

Learning Objective: LO 1

1. The process of assigning work to limited resources is known as
2. loading.
3. sequencing.
4. monitoring.
5. dispatching

Difficulty: Easy

Learning Objective: LO 2

1. The process of prioritizing jobs that have been assigned to a resource is called
2. loading.
3. monitoring.
4. sequencing.
5. input/output analysis.

Difficulty: Easy

Learning Objective: LO 2

1. If a job is ahead of schedule, then its critical ratio (CR) will be
2. less than one.
3. greater than one.
4. equal to one.
5. None of these answer choices is correct.

Difficulty: Moderate

Learning Objective: LO 2

1. If the work remaining is greater than the time remaining, the critical ratio (CR) will be
2. less than one.
3. greater than one.
4. equal to one.
5. None of these answer choices is correct.

Difficulty: Moderate

Feedback: Sequencing

Learning Objective: LO 2

1. The time required to complete a group of jobs is referred to as
2. flow time.
3. makespan.
4. completion time.
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Sequencing

Learning Objective: LO 2

1. The sequencing rule that will minimize average job completion time for a set number of jobs to be processed on one machine is
2. first-come-first served (FCFS).
3. longest processing time (LPT).
4. shortest process time (SPT).
5. due date (DDATE).

Difficulty: Moderate

Feedback: Sequencing

Learning Objective: LO 2

1. The sequencing rule that minimizes average tardiness for a set of jobs to be processed on one machine is

a. first-come-first served (FCFS).

b. longest processing time (LPT)

c. shortest process time (SPT)

d. due date (DDATE).

Difficulty: Moderate

Feedback: Sequencing

Learning Objective: LO 2

1. If the following jobs are sequenced according to the first-come-first-served (FCFS) rule then the mean completion time in days for all jobs is (assume zero for today’s date)

1. 33 days.
2. 22 days.
3. 6.6 days.
4. 4.4 days.

Difficulty: Moderate

Feedback: Sequencing

Solution: Mean completion time = (8 + 14 + 25 + 30 + 33)/5 = 22 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the FCFS rule then the mean tardiness (in days) for all jobs is (assume zero for today’s date)

1. 5 days.
2. 8.33 days.
3. 10.6 days.
4. 25 days.

Difficulty: Moderate

Feedback: Sequencing
Solution: Mean tardiness = (0 + 0+ 8 + 20 + 25)/5 = 10.6 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the FCFS rule then the maximum job tardiness (in days) is (assume zero for today’s date)

1. 0 days.
2. 8 days.
3. 20 days.
4. 25 days.

Difficulty: Moderate

Feedback: Sequencing
Solution: Maximum job tardiness = MAX{0, 0 ,8, 20, 25} = 25 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the FCFS rule, then the total number of jobs that would be late is (assume zero for today’s date)

1. 4.
2. 3.
3. 2.
4. 1.

Difficulty: Moderate

Feedback: Sequencing

Solution: Total of jobs that would be late = COUNT{0, 0, 8, 20, 25} = 3 jobs

Learning Objective: LO 2

1. If the following jobs are sequenced according to the FCFS rule then job C is completed on day (assume zero for today’s date)

1. 11.
2. 17.
3. 25.
4. 30.

Difficulty: Moderate

Feedback: Sequencing

Solution: Completion of job C = 8 + 6 + 11 = 25 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SPT rule then the mean completion time (in days) for all jobs is (assume zero for today’s date)

1. 6.6 days.
2. 16 days.
3. 22 days.
4. 33 days.

Difficulty: Moderate

Feedback: Sequencing

Solution: Mean completion time = (3 + 8 + 14 + 22 + 33)/5 = 16 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SPT rule then the mean tardiness (in days) for all jobs is (assume zero for today’s date)

1. 16 days.
2. 13 days.
3. 5.2 days.
4. 3.2 days

Difficulty: Moderate

Feedback: Sequencing
Solution: Mean tardiness = (0 + 0 + 0 + 10 + 16)/5 = 5.2 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SPT rule then the maximum job tardiness (in days) is (assume zero for today’s date)

1. 26 days
2. 16 days
3. 10 days
4. 5.2 days

Difficulty: Moderate

Feedback: Sequencing
Solution: Maximum job tardiness = MAX{0, 0, 0, 10, 16} = 16 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SPT rule then the total number of jobs that would be late is (assume zero for today’s date)

1. 0 jobs.
2. 1 job.
3. 2 jobs.
4. 3 jobs.

Difficulty: Moderate

Feedback: Sequencing

Solution: Number of jobs that would be late = COUNT{0, 0, 0, 10, 16} = 2 jobs

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SPT rule then job B is completed on day (assume zero for today’s date)

1. 6.
2. 14.
3. 15.
4. 22

Difficulty: Moderate

Feedback: Sequencing

Solution: Completion for job B = 3 + 5 + 6 = 14 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the LPT rule then the mean completion time (in days) for all jobs is (assume zero for today’s date)

1. 118 days.
2. 6.6 days.
3. 33 days.
4. 23.6 days

Difficulty: Moderate

Feedback: Sequencing

Solution: Mean completion time = (11 + 19 + 25 + 30 + 33)/5 = 23.6 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the LPT rule then the mean tardiness (in days) for all jobs is (assume zero for today’s date)

1. 62 days.
2. 12.4 days.
3. 15.5 days.
4. 25 days

Difficulty: Moderate

Feedback: Sequencing

Solution: Mean tardiness = (0 + 7 + 10 + 20 + 25)/5 = 12.4 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the LPT rule then the maximum job tardiness (in days) is (assume zero for today’s date)

1. 7 days.
2. 10 days.
3. 20 days.
4. 25 days.

Difficulty: Moderate

Feedback: Sequencing
Solution: Maximum job tardiness = MAX{0, 7, 10, 20, 25} = 25 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the LPT rule then the total number of jobs that would be late is (assume zero for today’s date)

1. 5 jobs.
2. 4 jobs.
3. 3 jobs.
4. 2 jobs.

Difficulty: Moderate

Feedback: Sequencing

Solution: Number of late jobs = COUNT{0, 7, 10, 20, 25} = 4 jobs

Learning Objective: LO 2

1. If the following jobs are sequenced according to the LPT rule then job D would be completed on day (assume zero for today’s date )

1. 5.
2. 25.
3. 30.
4. 33.

Difficulty: Moderate

Feedback: Sequencing

Solution: Job D’s completion time = 11 + 8 + 6 + 5 = 30 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SLACK rule then the mean completion time (in days) for all jobs is (assume zero for today’s date)

1. 35 days.
2. 20.8 days.
3. 18.4 days.
4. 7 days.

Difficulty: Hard

Feedback: Sequencing
Solution: Solution: Mean completion time = (7 + 15 + 18 + 29 + 35)/5 = 20.8 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SLACK rule then the mean tardiness (in days) for all jobs is (assume zero for today’s date)

1. 11.25 days.
2. 9 days.
3. 20 days.
4. 12.5 days.

Difficulty: Hard

Feedback: Sequencing

Solution: Mean tardiness = (0 + 3 + 10 + 12 + 20)/5 = 9 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SLACK rule then the maximum job tardiness (in days) is (assume zero for today’s date)

1. 20 days.
2. 12 days.
3. 10 days.
4. 7 days

Difficulty: Hard

Feedback: Sequencing
Solution: Maximum job tardiness = MAX{0, 3, 10, 12, 20) = 20 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SLACK rule then the total number of jobs that would be late is (assume zero for today’s date)

1. 1 jobs.
2. 2 jobs.
3. 3 jobs
4. 4 jobs

Difficulty: Hard

Feedback: Sequencing
Solution: Total jobs late = COUNT{0, 3, 10, 12, 20} = 4 jobs

Learning Objective: LO 2

1. If the following jobs are sequenced according to the SLACK rule then job A would be completed on day (assume zero for today’s date)

1. 8.
2. 7.
3. 15.
4. 12.

Difficulty: Hard

Feedback: Sequencing

Solution: 8 + 7 = 15 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the DDATE rule then the mean completion time (in days) for all jobs is (assume zero for today’s date)

1. 16.4 days.
2. 22.6 days.
3. 28.7 days.
4. 33.0 days

Difficulty: Moderate

Feedback: Sequencing

Solution: Mean completion time = (3 + 8 + 16 + 22 + 33)/5 = 16.4 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the DDATE rule then the mean tardiness (in days) for all jobs is (assume zero for today’s date)

1. 9.0 days.
2. 5.4 days.
3. 3.2 days.
4. 2.8 days

Difficulty: Moderate

Feedback: Sequencing

Solution: Mean tardiness = (0 + 0 + 4 + 7 + 16)/5 = 5.4 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the DDATE rule then the maximum job tardiness (in days) is (assume zero for today’s date)

1. 12 days.
2. 15 days.
3. 16 days.
4. 27 days.

Difficulty: Moderate

Feedback: Sequencing

Solution: Maximum job tardiness = MAX{0, 0, 4, 7, 16} = 16 days

Learning Objective: LO 2

1. If the following jobs are sequenced according to the DDATE rule then the total number of jobs that would be late is (assume zero for today’s date)

1. 5 jobs.
2. 4 jobs.
3. 3 jobs.
4. 2 jobs.

Difficulty: Moderate

Feedback: Sequencing

Solution: Total late jobs = COUNT{0, 0, 4, 7, 16} = 3 jobs

Learning Objective: LO 2

1. If the following jobs are sequenced according to the DDATE rule then job A would be completed on day (assume zero for today’s date)

1. 8.
2. 12.
3. 16.
4. 22

Difficulty: Moderate

Feedback: Sequencing
Solution: Completion for job A = 3 + 5 + 8 = 16 days

Learning Objective: LO 2

1. Four products (1, 2, 3, and 4) must be processed on one of four machines (A, B, C, and D). The times required in minutes for each product on each machine are shown below.

If management wishes to assign products to machines so that the total time to complete all the products is minimized, then Product 1 is assigned to

1. machine A.
2. machine B.
3. machine C.
4. machine D.

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. Four products (1, 2, 3, and 4) must be processed on one of four machines (A, B, C, and D). The times required in minutes for each product on each machine are shown below.

If management wishes to assign products to machines so that the total time to complete all the products is minimized, then Product 3 is assigned to

1. machine A.
2. machine B.
3. machine C.
4. machine D.

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. Four products (1, 2, 3, and 4) must be processed on one of four machines (A, B, C, and D). The times required in minutes for each product on each machine are shown below.

If management wishes to assign products to machines so that the total time to complete all the products is minimized, then Product 4 is assigned to

1. machine A.
2. machine B.
3. machine C.
4. machine D.

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. Four products (1, 2, 3, and 4) must be processed on one of four machines (A, B, C, and D). The times required in minutes for each product on each machine are shown below.

If management assigns products to machines so that the total time to complete all jobs is minimized, then the time to complete Product 1 is

1. 10 minutes.
2. 9 minutes.
3. 16 minutes.
4. 12 minutes

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. Four products (1, 2, 3, and 4) must be processed on one of four machines (A, B, C, and D). The times required in minutes for each product on each machine are shown below.

The minimum time required to complete all the products is

1. 29 minutes.
2. 27 minutes.
3. 33 minutes.
4. 36 minutes.

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. The scheduling rule that minimizes the makespan time for a set of jobs that must be processed through a two-step system where every job follows the same sequence through the two processes is
2. the shortest processing time (SPT).
3. Johnson’s Rule.
4. the assignment method.
5. the minimal slack rule.

Difficulty: Easy

Feedback: Sequencing

Learning Objective: LO 2

1. The following set of jobs must be processed serially through a two-step system. If Johnson’s Rule is used to sequence the jobs then the order in which the jobs would be performed is

1. A-B-C-D-E
2. C-B-E-D-A
3. E-B-D-A-C
4. D-E-B-A-C

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. The following set of jobs must be processed serially through a two-step system. The times at each process are in hours. If Johnson’s Rule is used to sequence the jobs then the makespan time (in hours) for all jobs is

1. 42 hours.
2. 53 hours.
3. 90 hours.
4. 95 hours.

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. The following set of jobs must be processed serially through a two-step system. The times at each process are in hours. If Johnson’s Rule is used to sequence the jobs then Job C would start processing on operation 2 at

1. hour 13.
2. hour 26.
3. hour 47.
4. hour 53

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. The following set of jobs must be processed serially through a two-step system. The times at each process are in hours. If Johnson’s Rule is used to sequence the jobs then Job A would complete processing on operation 2 at

1. hour 21.
2. hour 35.
3. hour 38.
4. hour 47.

Difficulty: Hard

Feedback: Sequencing

Learning Objective: LO 2

1. A ________ chart is used to show both planned and completed activities against a time scale.
2. Gantt
3. dispatch
4. sequencing
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Monitoring

Learning Objective: LO 2

1. A _______________ is shop paperwork that travels with the job.
2. makespan chart
3. work package
4. dispatch list
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Monitoring

Learning Objective: LO 2

1. A ________________ shows both planned and completed activities against a time scale.
2. flow chart
3. Gantt chart
4. Pareto chart
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Monitoring

Learning Objective: LO 2

1. _________________ provides the information to regulate the flow of work to and from a network of work centers.
2. A dispatch list
3. Input/output control
4. A Gantt chart
5. Drum-buffer-rope

Difficulty: Moderate
Feedback: Monitoring

Learning Objective: LO 2

1. _________________ scheduling involves loading work onto the work center, leveling the load, sequencing the work, and monitoring its progress.
2. Finite
3. Terminal
4. Infinite
5. Genetic

Difficulty: Moderate

Feedback: Advanced Planning and Scheduling Systems

Learning Objective: LO 3

1. With _________________ scheduling, loading and sequencing decisions are made at the same time.
2. finite
3. terminal
4. infinite
5. genetic

Difficulty: Moderate

Feedback: Advanced Planning and Scheduling Systems

Learning Objective: LO 3

1. The class of software, with libraries of algorithms and heuristics from which to choose, has become known as
2. product life cycle (PLC).
3. genetic algorithms.
4. Advanced planning and scheduling (APS).
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Advanced Planning and Scheduling Systems

Learning Objective: LO 3

1. ______________ are based on natural selection properties of genetics.
2. Manufacturing execution systems
3. Genetic algorithms
4. Finite scheduling systems
5. Drum-buffer-rope schedules

Difficulty: Easy

Feedback: Advanced Planning and Scheduling Systems

Learning Objective: LO 3

1. A______________ monitors work status, machine status, material usage, and availability.
2. drum-buffer-rope system
3. manufacturing execution system
4. planning and control system
5. None of these answer choices is correct.

Difficulty: Moderate

Feedback: Advanced Planning and Scheduling Systems

Learning Objective: LO 3

1. Theory of constraints is a _____________ scheduling approach that concentrates on scheduling the bottleneck.
2. infinite
3. finite
4. genetic
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Theory of Constraints

Learning Objective: LO 4

1. To maintain the synchronization required for theory of constraints, Goldratt introduced the concept of
2. drum-buffer-rope.
3. transfer batches.
4. manufacturing execution systems.
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Theory of Constraints

Learning Objective: LO 4

1. Identifying the bottleneck is the ______________ step in the theory of constraints scheduling procedure.
2. first
3. second
4. last
5. None of these answer choices is correct.

Difficulty: Easy

Feedback: Theory of Constraints

Learning Objective: LO 4

1. Employee scheduling has _____________ options compared to work scheduling because labor is a ______________ resource.
2. many, less flexible
3. few, less flexible
4. many, more flexible
5. few, more flexible

Difficulty: Easy

Feedback: Employee Scheduling

Learning Objective: LO 5

1. The ________________ method of linear programming can be used to assign workers to different jobs.
2. transportation
3. differentiation
4. assignment
5. genetic

Difficulty: Easy

Feedback: Employee Scheduling

Learning Objective: LO 5

Short Answer Questions

95. What makes scheduling so difficult in a job shop?

Difficulty: Easy

Feedback: Objectives in Scheduling

Learning Objective: LO 1

96. List some of the objectives in scheduling.

Difficulty: Moderate

Feedback: Objectives in Scheduling

Learning Objective: LO 1

97. Why is monitoring an important component of job shop scheduling?

Difficulty: Moderate

Feedback: Monitoring

Learning Objective: LO 2

98. What is the difference between infinite scheduling and finite scheduling?

Difficulty: Moderate

Feedback: Advanced Planning and Scheduling Systems

Learning Objective: LO 3

99. Who developed the theory of constraints (TOC) and what is its approach to scheduling?

Difficulty: Hard

Feedback: Theory of Constraints

Learning Objective: LO 4

100. If the critical ratio is 0.5, the remaining processing time is 4 days, and the due date is on day 7, then today’s date is day __________.

a) 2

b) 4

c) 5

d) 7

101. If the following jobs are scheduled according to the FCFS rule,

the mean completion time is __________ days. (Assume 0 for today’s date.)

a) 10.4

b) 15.4

c) 25.4

d) 34.4

102. The following jobs are scheduled according to the FCFS rule.

The mean tardiness is __________ days. (Assume 0 for today’s date.)

a) 34.4

b) 22.8

c) 10.4

d) 10.1

103. The following jobs are scheduled according to the FCFS rule.

The maximum tardiness is __________ days. (Assume 0 for today’s date.)

a) 40

b) 36

c) 20

d) 18

104. The following jobs are scheduled according to the FCFS rule.

The minimum tardiness is __________ days. (Assume 0 for today’s date.)

a) 36

b) 18

c) 8

d) 0

105. The following jobs are scheduled according to the FCFS rule.

The number of jobs that would be late is __________ days. (Assume 0 for today’s date.)

a) 1

b) 3

c) 4

d) 5

106. The following jobs are scheduled according to the DDATE rule.

The mean completion time is __________ days. (Assume 0 for today’s date.)

a) 9.2

b) 10.4

c) 20.8

d) 22.8

107. The following jobs are scheduled according to the DDATE rule.

The mean tardiness is __________ days. (Assume 0 for today’s date.)

a) 9.2

b) 10.4

c) 15.8

d) 20.8

108. The following jobs are scheduled according to the DDATE rule.

The maximum tardiness is __________ days. (Assume 0 for today’s date.)

a) 40

b) 36

c) 32

d) 12

109. The following jobs are scheduled according to the DDATE rule.

The number of jobs that would be late is __________. (Assume 0 for today’s date.)

a) 4

b) 3

c) 2

d) 1