Four jobs need to be sequenced through three machines with an open-shop setup (i.e. there are...

Transcribed Image Text:

Four jobs need to be sequenced through three machines with an open-shop setup (i.e. there are no precedence constraints on machine processing). The following data is available concerning the four jobs: Pij (secs) Machine 1 Machine 2 Machine 3 Due Date Weight Job 1 5 6 4 20 1 Job 2 2 7 6 20 3 Job 3 7 5 3 24 1 Job 4 5 6 3 18 2 □ Sequence the 4 jobs to each machine to simultaneously minimize makespan and total weighted tardiness. When even swaps are useful to compare alternative schedules, use the following value: (1 unit Makespan) is equivalent to (3 units total weigted tardiness.) Show a Gantt Chart to show such sequence and indicate the total weighted tardiness found. Four jobs need to be sequenced through three machines with an open-shop setup (i.e. there are no precedence constraints on machine processing). The following data is available concerning the four jobs: Pij (secs) Machine 1 Machine 2 Machine 3 Due Date Weight Job 1 5 6 4 20 1 Job 2 2 7 6 20 3 Job 3 7 5 3 24 1 Job 4 5 6 3 18 2 □ Sequence the 4 jobs to each machine to simultaneously minimize makespan and total weighted tardiness. When even swaps are useful to compare alternative schedules, use the following value: (1 unit Makespan) is equivalent to (3 units total weigted tardiness.) Show a Gantt Chart to show such sequence and indicate the total weighted tardiness found.

Answer rating: 100% (QA)

Explanation To find the optimal sequence for the jobs and machines in an openshop setup while minimizing makespan and total weighted tardiness we can ... View the full answer