Purchase Solution

Makespan Scheduling Problem

Not what you're looking for?

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.

Solution Summary

This solution solves a makespan scheduling problem.

Solution Preview

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

Solution provided by:
Education
• MSc, Osmania University
• MSc, Indian Institute of Technology - Roorkee (I.I.T.-ROORKEE)
• BSc, Banaras Hindu University
Recent Feedback
• "Very fast turnaround. Excellent communication! Much appreciated!"
• "excellent"
• "excellent"
• "excellent work"
• "Fantastic..great solution and very well explained!!!!"

Free BrainMass Quizzes

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.