A question in GATE 2012 Production and Industrial Engineering Paper with Solution has been updated:
Data for four jobs that need to be processed on a single machine are given below.
Job | P | Q | R | S |
Processing time (days) | 12 | 9 | 21 | 10 |
Due date (days) | 20 | 40 | 30 | 19 |
All the four jobs are available at time zero. If the jobs are scheduled using the Earliest Due Date (EDD) algorithm, then the job with maximum tardiness is
- S
- P
- Q
- R
No comments:
Post a Comment