Exam 24: Scheduling

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

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. 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 The minimum time required to complete all the products is

(Multiple Choice)
4.8/5
(65)

Theory of constraints is a _____________ scheduling approach that concentrates on scheduling the bottleneck.

(Multiple Choice)
4.8/5
(83)

_________________ provides the information to regulate the flow of work to and from a network of work centers.

(Multiple Choice)
5.0/5
(85)

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

(True/False)
5.0/5
(86)

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

(Multiple Choice)
4.9/5
(85)

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

(Multiple Choice)
4.7/5
(75)

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

(True/False)
4.8/5
(81)

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

(True/False)
4.9/5
(93)

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

(Multiple Choice)
4.9/5
(89)

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

(Multiple Choice)
4.8/5
(87)

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

(Multiple Choice)
5.0/5
(73)

Identifying the bottleneck is the ______________ step in the theory of constraints scheduling procedure.

(Multiple Choice)
4.8/5
(78)

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

(Essay)
4.9/5
(93)

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

(Multiple Choice)
4.8/5
(89)

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

(Multiple Choice)
4.9/5
(82)

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

(Multiple Choice)
4.8/5
(71)

The sequencing rule that will minimize average job completion time for a set number of jobs to be processed on one machine is

(Multiple Choice)
5.0/5
(81)

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

(Multiple Choice)
4.9/5
(78)

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

(True/False)
4.8/5
(80)

The ________________ method of linear programming can be used to assign workers to different jobs.

(Multiple Choice)
5.0/5
(95)
Showing 61 - 80 of 99
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)