Full Test Bank Ch17 Scheduling

CHAPTER 17

SCHEDULING

CHAPTER LEARNING OBJECTIVES

1. Describe scheduling techniques and list the objectives of scheduling. Scheduling techniques vary by type of production process. Scheduling in a job shop environment is difficult because jobs arrive at varying time intervals, require different resources and sequences of operations, and are due at different times. This lowest level of scheduling is referred to as shop floor control or production control. It involves assigning jobs to machines or workers (called loading), specifying the order in which operations are to be performed, and monitoring the work as it progresses. There are many objectives in constructing a schedule—some of which may conflict:

• Meeting customer due dates

• Minimizing job lateness

• Minimizing response time

• Minimizing completion time

• Minimizing time in the system

• Minimizing overtime

• Maximizing machine or labour use

• Minimizing idle time

• Minimizing work-in-process inventory

2. Explain what loading is and use the assignment method to load work on to limited resources. Loading is the process of assigning work to limited resources. The assignment method is a specialized linear programming solution procedure for deciding which worker to assign to a task, or which job to assign to a machine. The procedure creates an opportunity cost matrix and selects the best assignment in consideration of trade-offs among alternatives. See Section 17.2 for an example of the assignment method.

3. Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations. Sequencing is the process of prioritizing jobs and determining the processing order. See Section 17.3 for examples of sequencing jobs through one or two workstations.

4. Use several methods to monitor the progress of jobs in a job shop environment. Gantt charts can be used to monitor a job’s progress against the plan, and input/output controls monitor the input to and output from each work centre.

5. Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations. Realistic schedules must reflect capacity limitations. Infinite scheduling initially assumes infinite capacity and then manually “levels the load” of resources that have exceeded capacity. Finite scheduling loads jobs in priority order and delays those jobs for which current capacity is exceeded. The theory of constraints is a finite scheduling approach that schedules bottleneck resources first and then schedules other resources to support the bottleneck schedule. It also allows items to be transferred between resources in lot sizes that differ from the lot size in which the item is produced. Other advanced planning and scheduling techniques include mathematical programming, genetic algorithms, and simulation.

6. Use a heuristic to schedule workers and explain the capabilities provided by employee scheduling software. Employee scheduling is often difficult because of the variety of options available and the special requirements for individual workers. Scheduling heuristics are typically used to develop patterns of worker assignment (see Example 17.2 for an example). Automated workforce scheduling systems are becoming more commonplace. Scheduling software:

• Assigns qualified workers to standardize shift patterns, taking into account leave requests and scheduling conflicts

• Allows workers to bid on certain shifts and post and trade schedules

• Creates demand-driven forecasts of labour requirements and assigns workers to variable schedules that change dynamically with demand

TRUE-FALSE STATEMENTS

1. Scheduling specifies when labour, equipment and facilities are needed to produce a product.

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

2. Scheduling is considered the last stage of the planning process.

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

3. The wide variety of jobs in a job shop makes scheduling difficult.

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

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

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

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

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

6. Job-shop scheduling is usually performed by skilled machine operators.

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Comprehension

AACSB: Reflective Thinking

8. The scheduling function for mass production and job shop production are basically the same.

Difficulty: Medium

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Comprehension

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Explain what loading is and use the assignment method to load work on to limited resources.

Section Reference: 17.2 Loading

Blooms: Knowledge

AACSB: Reflective Thinking

11. Sequencing involves determining the order in which jobs are released to the shop floor.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

12. The sequence in which jobs should be processed is determined by using the linear programming.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

13. Determining the optimal allocation of jobs to machines or workers can be solved using the assignment method of linear programming.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

14. The process of prioritizing jobs that have been assigned to a resource is called sequencing.

Difficulty: Easy

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Knowledge

AACSB: Reflective Thinking

15. The time required for a job to move through the system is referred to as flow time.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Knowledge

AACSB: Reflective Thinking

16. All sequencing rules strive to optimize both processing efficiency and due date performance.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

17. Johnson’s rule gives an optimal sequence for jobs processed serially through a two step system.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

18. The shortest processing time (SPT) rule is most useful when the job shop is not congested.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

19. The longest processing time (LPT) rule tends to complete larger jobs in-house when subcontracting is anticipated.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

22. In a job shop environment, the process of prioritizing jobs assigned to a productive resource is called sequencing.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

23. Tardiness is defined as the difference between a job’s flow time and makespan.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Use several methods to monitor the progress of jobs in a job shop environment.

Section Reference: 17.4 Monitoring

Blooms: Comprehension

AACSB: Reflective Thinking

25. Increasing the capacity of a work centre that is a bottleneck increases the output.

Difficulty: Medium

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Comprehension

AACSB: Reflective Thinking

26. Finite scheduling will not load a resource beyond its fixed capacity.

Difficulty: Medium

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Comprehension

AACSB: Reflective Thinking

27. The theory of constraints (TOC) approach to scheduling concentrates on scheduling the bottleneck resources.

Difficulty: Medium

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Comprehension

AACSB: Reflective Thinking

28. With drum-buffer-rope (DBR), the bottleneck resource is always the buffer.

Difficulty: Medium

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Comprehension

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Comprehension

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Use a heuristic to schedule workers and explain the capabilities provided by employee scheduling software.

Section Reference: 17.6 Employee Scheduling

Blooms: Knowledge

AACSB: Reflective Thinking

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

Difficulty: Medium

Learning Objective: Use a heuristic to schedule workers and explain the capabilities provided by employee scheduling software.

Section Reference: 17.6 Employee Scheduling

Blooms: Knowledge

AACSB: Reflective Thinking

MULTIPLE CHOICE QUESTIONS

32. Which of the following is not typically considered an objective of scheduling?

a) minimizing job lateness

b) maximizing time in the system

c) minimizing overtime

d) maximizing machine utilization

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

33. The process of smoothing out the work assigned is known as

a) production control

b) sequencing

c) load levelling

d) dispatching

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking

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

a) loading.

b) sequencing.

c) monitoring.

d) dispatching

Difficulty: Easy

Learning Objective: Explain what loading is and use the assignment method to load work on to limited resources.

Section Reference: 17.2 Loading

Blooms: Knowledge

AACSB: Reflective Thinking

35. Which of the following is not part of the procedure for a minimization problem under the assignment method of loading?

a) performing row reductions

b) performing column reductions

c) developing a constraint matrix

d) developing an opportunity cost matrix

Difficulty: Medium

Learning Objective: Explain what loading is and use the assignment method to load work on to limited resources.

Section Reference: 17.2 Loading

Blooms: Comprehension

AACSB: Reflective Thinking

36. The process of prioritizing jobs that have been assigned to a resource is called

a) loading.

b) monitoring.

c) sequencing.

d) input/output analysis.

Difficulty: Easy

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Knowledge

AACSB: Reflective Thinking

37. If a job is ahead of schedule, then its critical ratio (CR) will be

a) less than one.

b) greater than one.

c) equal to one.

d) none of the above.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

38. If the work remaining is greater than the time remaining, the critical ratio (CR) will be

a) less than one.

b) greater than one.

c) equal to one.

d) none of the above.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

39. The time required to complete a group of jobs is referred to as

a) flow time.

b) makespan.

c) completion time.

d) none of the above.

Difficulty: Easy

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Knowledge

AACSB: Reflective Thinking

40. The sequencing rule that will minimize average job completion time for a set number 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: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

41. 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: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

42. 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)

a) 33 days.

b) 22 days.

c) 6.6 days.

d) 4.4 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

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

a) 5 days.

b) 8.33 days.

c) 10.6 days.

d) 25 days

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

44. 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)

a) 0 days.

b) 8 days.

c) 20 days.

d) 25 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

45. 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)

a) 4.

b) 3.

c) 2.

d) 1.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

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

a) 11.

b) 17.

c) 25.

d) 30.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

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

a) 6.6 days.

b) 16 days.

c) 22 days.

d) 33 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

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

a) 16 days.

b) 13 days.

c) 5.2 days.

d) 3.2 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

49. 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)

a) 26 days.

b) 16 days.

c) 10 days.

d) 5.2 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

50. 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)

a) 0 jobs.

b) 1 job.

c) 2 jobs.

d) 3 jobs.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

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

a) 6.

b) 14.

c) 15.

d) 22.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

52. 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)

a) 118 days.

b) 6.6 days.

c) 33 days.

d) 23.6 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

53. 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)

a) 62 days.

b) 12.4 days.

c) 15.5 days.

d) 25 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

54. 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)

a) 7 days.

b) 10 days.

c) 20 days.

d) 25 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

55. 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)

a) 5 jobs.

b) 4 jobs.

c) 3 jobs.

d) 2 jobs.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

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

a) 5.

b) 25.

c) 30.

d) 33.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

57. 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)

a) 35 days.

b) 19.4 days.

c) 18.4 days.

d) 7 days.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

58. 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)

a) 11.25 days.

b) 7.8 days.

c) 20 days.

d) 12.5 days.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

59. 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)

a) 18 days.

b) 12 days.

c) 10 days.

d) 7 days.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

60. 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)

a) 1 jobs.

b) 2 jobs.

c) 3 jobs.

d) 4 jobs.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

61. 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)

a) 8.

b) 7.

c) 15.

d) 12.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

62. 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)

a) 16.4 days.

b) 22.6 days.

c) 28.7 days.

d) 33.0 days

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

63. 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)

a) 9.0 days.

b) 5.4 days.

c) 3.2 days.

d) 2.8 days

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

64. 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)

a) 12 days.

b) 15 days.

c) 16 days.

d) 27 days.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

65. 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)

a) 5 jobs.

b) 4 jobs.

c) 3 jobs.

d) 2 jobs.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

66. 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)

a) 8.

b) 12.

c) 16.

d) 22.

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

67. Four products (1, 2, 3, and 4) must be processed on one of the 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

a) machine A

b) machine B

c) machine C

d) machine D

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

68. Four products (1, 2, 3, and 4) must be processed on one of the 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

a) machine A.

b) machine B.

c) machine C.

d) machine D.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

69. Four products (1, 2, 3, and 4) must be processed on one of the 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

a) machine A.

b) machine B.

c) machine C.

d) machine D.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

70. Four products (1, 2, 3, and 4) must be processed on one of the 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

a) 10 minutes.

b) 9 minutes.

c) 16 minutes.

d) 12 minutes

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

71. Four products (1, 2, 3, and 4) must be processed on one of the 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

a) 29 minutes.

b) 27 minutes.

c) 33 minutes.

d) 36 minutes.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

72. 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 the

a) shortest processing time (SPT).

b) Johnson’s Rule.

c) assignment method.

d) minimal slack rule.

Difficulty: Easy

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Knowledge

AACSB: Reflective Thinking

73. 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

a) A-B-C-D-E

b) C-B-E-D-A

c) E-B-D-A-C

d) D-E-B-A-C

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

74. 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

a) 42 hours.

b) 53 hours.

c) 90 hours.

d) 95 hours.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

75. 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

a) hour 13.

b) hour 26.

c) hour 47.

d) hour 53.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

76. 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

a) hour 21.

b) hour 35.

c) hour 38.

d) hour 47.

Difficulty: Hard

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Application

AACSB: Analytic

77. The difference between a job’s due date and its completion time is known as

a) flow time

b) makespan

c) tardiness

d) slack

Difficulty: Medium

Learning Objective: Explain what sequencing is and use rules and quantitative tools for optimizing the sequence of jobs processed through one or two workstations.

Section Reference: 17.3 Sequencing

Blooms: Comprehension

AACSB: Reflective Thinking

78. A ___ chart is used to show both planned and completed activities against a time scale.

a) Gantt

b) Dispatch

c) Sequencing

d) None of the above.

Difficulty: Easy

Learning Objective: Use several methods to monitor the progress of jobs in a job shop environment.

Section Reference: 17.4 Monitoring

Blooms: Knowledge

AACSB: Reflective Thinking

79. Shop paperwork that travels with a job is known as a

a) Gantt chart

b) work package

c) bill of materials

d) input/output document

Difficulty: Easy

Learning Objective: Use several methods to monitor the progress of jobs in a job shop environment.

Section Reference: 17.4 Monitoring

Blooms: Knowledge

AACSB: Reflective Thinking

80. A scheduling technique which loads without regards to capacity, then levels the load and sequences the jobs is known as

a) finite scheduling

b) infinite scheduling

c) advanced planning and scheduling

d) load levelling

Difficulty: Easy

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Knowledge

AACSB: Reflective Thinking

81. Which of the following best describes a scheduling technique that sequences jobs as part of the loading decision and where resources are never loaded beyond capacity?

a) finite scheduling

b) infinite scheduling

c) advanced planning and scheduling

d) load levelling

Difficulty: Easy

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Knowledge

AACSB: Reflective Thinking

82. A finite scheduling approach that concentrates on scheduling the bottleneck resource is known as

a) finite scheduling

b) infinite scheduling

c) advanced planning and scheduling

d) theory of constraints

Difficulty: Easy

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Knowledge

AACSB: Reflective Thinking

83. Which of the following is considered one of the most flexible resources?

a) materials

b) labour

c) utilities

d) overhead

Difficulty: Easy

Learning Objective: Use a heuristic to schedule workers and explain the capabilities provided by employee scheduling software.

Section Reference: 17.6 Employee Scheduling

Blooms: Knowledge

AACSB: Reflective Thinking

84. Automated scheduling systems typically include the following features except

a) staff scheduling

b) schedule bidding

c) staff bidding

d) schedule optimization

Difficulty: Easy

Learning Objective: Use a heuristic to schedule workers and explain the capabilities provided by employee scheduling software.

Section Reference: 17.6 Employee Scheduling

Blooms: Knowledge

AACSB: Reflective Thinking

SHORT-ANSWER ESSAY QUESTIONS

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

Difficulty: Easy

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Comprehension

AACSB: Reflective Thinking; Communication

86. List some of the objectives in scheduling.

Difficulty: Medium

Learning Objective: Describe scheduling techniques and list the objectives of scheduling.

Section Reference: 17.1 Scheduling Techniques

Blooms: Knowledge

AACSB: Reflective Thinking; Communication

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

Difficulty: Medium

Learning Objective: Use several methods to monitor the progress of jobs in a job shop environment.

Section Reference: 17.4 Monitoring

Blooms: Evaluation

AACSB: Reflective Thinking; Communication

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

Difficulty: Medium

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Evaluation

AACSB: Reflective Thinking; Communication

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

Difficulty: Hard

Learning Objective: Explain the basics of finite scheduling, and use the theory of constraints procedure to schedule multiple jobs through multiple workstations.

Section Reference: 17.5 Advanced Planning and Scheduling Systems

Blooms: Compression

AACSB: Reflective Thinking; Communication

90. Discuss some of the complexities involved with scheduling employees in the service firms.

Difficulty: Medium

Learning Objective: Use a heuristic to schedule workers and explain the capabilities provided by employee scheduling software.

Section Reference: 17.6 Employee Scheduling

Blooms: Synthesis

AACSB: Reflective Thinking; Communication

LEGAL NOTICE

Copyright © 2014 by John Wiley & Sons Canada, Ltd. or related companies. All rights reserved.

The data contained in these files are protected by copyright. This manual is furnished under licence and may be used only in accordance with the terms of such licence.

The material provided herein may not be downloaded, reproduced, stored in a retrieval system, modified, made available on a network, used to create derivative works, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning, or otherwise without the prior written permission of John Wiley & Sons Canada, Ltd.