Question: Using the LPT (longest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which

Using the LPT (longest processing time) decision rule for sequencing the jobs,

  

Using the LPT (longest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): Sequence 1 Job The following jobs are waiting to be processed at Rick Solano's machine center. Solano's machine center has a relatively long backlog and sets a fresh schedule every 2 weeks, which does not disturb earlier schedules. Below are the jobs to be scheduled today, which is day 241 (day 241 is a work day). Job names refer to names of clients and contract numbers. Compute all times based on initiating work on day 241. 2 3 4 5 Date Job Due Job Duration (days) Received Date BR-02 228 300 15 CX-01 225 270 25 LPT rule = The total flow time for the sequence developed using the days (round your response to two DE - 06 230 320 35 RG-05 235 360 40 SY-11 231 310 30 decimal places). The percentage utilization for the sequence developed using the LPT rule = % (enter your response as a percentage rounded to two decimal places). The average number of jobs in the system for the sequence developed using the LPT rule = jobs (round your response to two decimal places). The average tardiness (job lateness) for the sequence developed using the LPT rule = days (round your

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve this problem using the Longest Processing Time LPT decision rule we need to sequence the jo... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!