Explore BrainMass
Share

Makespan Scheduling Problem

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

A serial production line consists of two main workstations: an assembly workstation and a packaging workstation. The processing times for 11 jobs (in minutes) that must be processed on these two workstations are given below. There is plenty of space in between the workstations such that blocking does not occur.

a) Find the optimal job sequence for this serial system with the minimum makespan. Show steps to find the optimal solution.
b) Draw a Gantt chart that shows completion time values.

© BrainMass Inc. brainmass.com March 22, 2019, 12:55 am ad1c9bdddf
https://brainmass.com/math/discrete-math/makespan-scheduling-problem-517517

Attachments

Solution Preview

Objective: Our objective is to minimize the makespan time, which is the time taken to finish all jobs on all machines.
...

Solution Summary

This solution solves a makespan scheduling problem.

$2.19