Exam 17: Scheduling

arrow
  • Select Tags
search iconSearch Question
  • Select Tags

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.7/5
(41)

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

(True/False)
4.7/5
(40)

List some of the objectives in scheduling.

(Essay)
4.9/5
(25)

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

(Multiple Choice)
4.9/5
(31)

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.7/5
(32)

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

(Multiple Choice)
4.7/5
(38)

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

(Multiple Choice)
4.7/5
(33)

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

(Multiple Choice)
4.7/5
(37)

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.9/5
(41)

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

(Multiple Choice)
4.8/5
(45)

Shop paperwork that travels with a job is known as a

(Multiple Choice)
4.8/5
(38)

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

(True/False)
4.9/5
(37)

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)
4.8/5
(27)

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

(Multiple Choice)
4.7/5
(40)

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

(True/False)
4.8/5
(34)

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

(Multiple Choice)
4.8/5
(39)

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

(Multiple Choice)
4.9/5
(38)

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

(Essay)
4.9/5
(42)

The process of assigning work to limited resources is known as

(Multiple Choice)
4.7/5
(30)

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
(48)
Showing 41 - 60 of 96
close modal

Filters

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