HW-4 - SCM 3301 Homework # 4 Summer 2010 Page 1 of 10...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: SCM 3301 Homework # 4 Summer 2010 Page 1 of 10 MULTIPLE CHOICE Q 1 20 (3 POINTS EACH) 1. Gantt charts can be used to: a. monitor the progress of jobs but cannot be used to sequence work on each machine. b. sequence work on each machine but cannot be used to monitor the progress of each job. c. monitor the progress of jobs and sequence work on each machine. d. monitor the average number of defective parts generated by a machine on each job e. All of the above. 2. Which of the following is not a measure for evaluating service performances of waiting lines? a. average arrival rate b. average number of customers waiting in line c. percentage of capacity utilized d. the probability that an arrival will have to wait for service e. none of the above is a measure for evaluating service performance 3. Which of the following is an assumption in common single server queuing models? a. arrivals come from a very small, predictable population b. the average service rate is such that the service utilization is always greater than 1.0 c. every time the average wait time exceeds a certain level, extra servers are added to deal with the overflow d. the arrival rate is described by a Poisson distribution e. arrivals are treated on a shortest processing time (SPT) first 4. Which of the following statements concerning Johnsons rule for two machines in series is true? a. The sequence obtained from this rule may not be optimum since Johnsons rule is only a heuristic b. It minimizes makespan but does not minimize idle time c. It minimizes makespan and job lateness d. It minimizes idle time and makespan e. It maximizes makespan 5. Which of the following defines the makespan? a. the time at which the processing of the first job in the queue is completed b. the total time needed to complete a group of jobs c. the amount of time by which the completion time of the last job in the sequence exceeds its due date d. the average amount of time a job spends in the system (includes waiting time and processing time) e. none of the above defines the makespan SCM 3301 Homework # 4 Fall 2008 Page 2 of 10 6. Which of the following local scheduling rules tends to minimize the average lateness? a. first come, first served (FCFS) rule b. shortest processing time first (SPT) rule c. earliest due date first (EDD) rule d. longest processing time first (LPT) rule e. none of the above 7. Which of the following local scheduling rules tends to minimizes idle time?...
View Full Document

Page1 / 10

HW-4 - SCM 3301 Homework # 4 Summer 2010 Page 1 of 10...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online