The following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time 130 160 210 70 140 90 (min.) a. Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Job Flow Time (min) 1 2 3 4 5 6 minutes Makespan: Average flow time: minutes b. In what order would the jobs be processed using the SPT rule? The SPT sequence is -Select- --Select- -Select- -Select- -Select- -Select- Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The -Select- minimizes flow time and gets the most work done in the least amount of time.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter5: Network Models
Section: Chapter Questions
Problem 1C
icon
Related questions
Question
100%
The following six jobs are to be scheduled on a single machine:
Job
1
2
3
4
5 6
Processing time 130 160 210 70 140 90
(min.)
a. Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number.
Job Flow Time (min)
1
2
3
4
5
6
Makespan:
Average flow time:
b. In what order would the jobs be processed using the SPT rule?
The SPT sequence is -Select---Select---Select---Select---Select- V -Select- V.
Compute the average flow time after each job is completed. Round your answer to the nearest whole number.
Average flow time:
minutes
Compare this answer with your answer to part a.
The -Select-
minutes
minutes
✓ minimizes flow time and gets the most work done in the least amount of time.
Transcribed Image Text:The following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time 130 160 210 70 140 90 (min.) a. Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Job Flow Time (min) 1 2 3 4 5 6 Makespan: Average flow time: b. In what order would the jobs be processed using the SPT rule? The SPT sequence is -Select---Select---Select---Select---Select- V -Select- V. Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The -Select- minutes minutes ✓ minimizes flow time and gets the most work done in the least amount of time.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,