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.
Purchase this Solution
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.
...
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!!!!"
Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities
This quiz test you on how well you are familiar with solving quadratic inequalities.
Graphs and Functions
This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.
Probability Quiz
Some questions on probability
Geometry - Real Life Application Problems
Understanding of how geometry applies to in real-world contexts
Multiplying Complex Numbers
This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.