Deck 24: Scheduling

Question 1

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

Answer 1

True

Question 2

Job shop scheduling is also known as shop floor control.

Answer 2

True

Question 3

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

Answer 3

False

Question 4

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

Question 5

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

Question 6

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

Question 7

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

Question 8

Job shop scheduling is usually performed by skilled machine operators.

Question 9

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

Question 10

Managers typically use multiple objectives when constructing a schedule.

Question 11

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

Question 12

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

Question 13

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

Question 14

Scheduling is considered the first stage of the planning process.

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

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

Question 22

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

A)loading.
B)monitoring.
C)sequencing.
D)input/output analysis.

Question 23

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.

Question 24

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

Question 25

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

Question 26

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

Question 27

______________ is the scheduling and monitoring of day-to-day production in a job shop.

A)Loading
B)Load Leveling
C)Dispatching
D)Shop floor control

Question 28

A manufacturing execution system is software that uses intelligent analytical tools and techniques to develop realistic schedules.

Question 29

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

Question 30

Which of the following is a possible objective in constructing a schedule.

A)Minimizing idle time
B)Minimizing response time
C)Meeting customer due dates
D)All of these answer choices are correct.

Question 31

______________ specifies when the labor,equipment and facilities are needed to produce a good or to provide a service.

A)Loading
B)Scheduling
C)Dispatching
D)Shop floor control

Question 32

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

Question 33

The process of assigning work to limited resources is known as

A)loading.
B)sequencing.
C)monitoring.
D)dispatching

Question 34

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

Question 35

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

Question 36

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

Question 37

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

Question 38

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

Question 39

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

Question 40

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

Question 41

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)

A)6.6 days.
B)16 days.
C)22 days.
D)33 days.

Question 42

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

Question 43

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

Question 44

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

Question 45

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.

Question 46

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.

Question 47

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

A)flow time.
B)makespan.
C)completion time.
D)None of these answer choices is correct.

Question 48

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

Question 49

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

Question 50

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.

Question 51

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 these answer choices is correct.

Question 52

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.

Question 53

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)

A)16 days.
B)13 days.
C)5.2 days.
D)3.2 days

Question 54

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)

A)5 days.
B)8.33 days.
C)10.6 days.
D)25 days.

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

Question 56

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 these answer choices is correct.

Question 57

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 )

A)5.
B)25.
C)30.
D)33.

Question 58

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

Question 59

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.

Question 60

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.

Question 61

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

A)29 minutes.
B)27 minutes.
C)33 minutes.
D)36 minutes.

Question 62

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.

Question 63

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

A)machine A.
B)machine B.
C)machine C.
D)machine D.

Question 64

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

Question 65

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

Question 66

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

Question 67

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

A)machine A.
B)machine B.
C)machine C.
D)machine D.

Question 68

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)20.8 days.
C)18.4 days.
D)7 days.

Question 69

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

Question 70

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.

Question 71

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)9 days.
C)20 days.
D)12.5 days.

Question 72

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

Question 73

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

Question 74

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

A)the shortest processing time (SPT).
B)Johnson's Rule.
C)the assignment method.
D)the minimal slack rule.

Question 75

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

A)machine A.
B)machine B.
C)machine C.
D)machine D.

Question 76

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)20 days.
B)12 days.
C)10 days.
D)7 days

Question 77

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

A)10 minutes.
B)9 minutes.
C)16 minutes.
D)12 minutes

Question 78

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.

Question 79

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.

Question 80

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.