Exam 16: Scheduling

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

Effective scheduling cannot

(Multiple Choice)
4.8/5
(37)

The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received:   If he uses the first come, first served priority rule to schedule these jobs, what will be the average completion time? If he uses the first come, first served priority rule to schedule these jobs, what will be the average completion time?

(Multiple Choice)
4.8/5
(36)

The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespan to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body and paint work on each are as follows: The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespan to complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do the body and paint work on each are as follows:   Where in the optimum sequence should car E be scheduled? Where in the optimum sequence should car E be scheduled?

(Multiple Choice)
4.8/5
(45)

The priority rule which will sequence jobs in the order they are received is

(Multiple Choice)
4.8/5
(31)

The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received: The owner/operator of the local franchise of Handyman, Inc., has four jobs to do today, shown in the order they were received:   If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in his shop today? If he uses the shortest processing time first priority rule to schedule these jobs, what will be the average number of jobs in his shop today?

(Multiple Choice)
4.9/5
(44)

Priority rules generally assume that job setup cost is independent of the processing sequence of jobs.

(True/False)
4.9/5
(38)

Scheduling pertains to

(Multiple Choice)
4.9/5
(39)

Priority rules are used in low-volume systems to identify an optimal processing sequence.

(True/False)
4.7/5
(33)

When operations are often bottlenecked, additional planned idle time will improve the throughput in those areas.

(True/False)
4.8/5
(36)

Scheduling in intermediate-volume systems has three basic issues: run size, timing, and sequence.

(True/False)
4.9/5
(37)

For the jobs listed below, which processing sequence would result using Johnson's rule? For the jobs listed below, which processing sequence would result using Johnson's rule?

(Multiple Choice)
4.8/5
(38)

The scheduling sequencing rule which always results in the lowest average completion (flow)time is the

(Multiple Choice)
4.8/5
(37)

Which of the following is not an example of a high-volume system?

(Multiple Choice)
4.8/5
(34)

Which costs depend on the order in which the jobs are processed?

(Multiple Choice)
4.9/5
(39)

The purpose of cyclical scheduling is to

(Multiple Choice)
4.8/5
(37)

Job X, which has a duration of four days, is due by the close of business on Friday, December 23. Without looking at the work already scheduled on X's required resource, the scheduler schedules X to be begun on the morning of Tuesday, December 20. This is an example of

(Multiple Choice)
4.8/5
(33)

In a task assignment situation, in how many different ways can five jobs be assigned to five machines if each job must be assigned to each machine and each machine must be assigned one job?

(Multiple Choice)
4.7/5
(40)

A schedule chart depicts the loading and idle times for a group of machines or departments.

(True/False)
4.8/5
(35)

_____ charts are often the preferred charts related to loading and scheduling activities.

(Multiple Choice)
4.8/5
(37)

The following matrix shows relative costs for various job-machine combinations. Assume there must be one-to-one matching between jobs and machines. Which set of pairs constitutes the minimum-cost solution using the assignment method? The following matrix shows relative costs for various job-machine combinations. Assume there must be one-to-one matching between jobs and machines. Which set of pairs constitutes the minimum-cost solution using the assignment method?

(Multiple Choice)
4.8/5
(41)
Showing 61 - 80 of 102
close modal

Filters

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