Skip to list

3.3. : * A set of jobs, each with a processing time on each machine and a routing that specifies the order in which the machines must be visited. * Goal: Schedule the jobs on the machines to minimize the makespan.

The maximum lateness is 6.

Let me know if you want me to continue.

2.3. : * Sort the jobs in increasing order of due date. * Schedule each job on the first available machine.

Also, you can add examples, exercises and solutions to each chapter.

Thanks.

See above.

Please let me know if you need any further assistance.