Sequencing of jobs
7). Consider the following data on jobs waiting to be scheduled on two machines in serial.
Proc Time
Job Machine 1 Machine 2
A 5 8
B 3 9
C 8 7
D 7 2
E 4 6
Using Johnson's Rule to sequence the jobs, what would be the correct sequence for processing the jobs?
11) Consider the following data on jobs waiting to be scheduled on two machines in serial.
Proc Time
Job Machine 1 Machine 2
A 5 2
B 9 3
C 8 7
D 5 4
E 9 6
These jobs are sequenced by a scheduler in the following order: C E D B A. What will be the total flowtime (or makespan) for all of the jobs to be processed on both machines (from start of first job on first machine until completion of last job on second machine)?
© BrainMass Inc. brainmass.com June 3, 2020, 5:19 pm ad1c9bdddfhttps://brainmass.com/business/business-management/sequencing-jobs-21757
Attachments
Solution Preview
See attached file
7). Consider the following data on jobs waiting to be scheduled on two machines in serial.
Using Johnson's Rule to sequence the jobs, what would be the correct sequence for processing the jobs?
Answer: BEACD
Solution procedure:
Step 1 Select the SPT (SHORTEST PROCESSING TIME) from the list and identify the job.
Step 2 If the SPT is for the first processing facilities, schedule the corresponding job as early as possible. If it is for the second processing facilities, schedule the job as late as possible.
Step 3 Repeat Steps 2 and 3 until all jobs are scheduled.
SPT= 2 days for Job D . This is on machine 2 . Schedule D as the last job. ...
Solution Summary
Answers 2 questions on sequencing of jobs.