MAKESPAN MINIMIZATION FOR PARALLEL MACHINES SCHEDULING WITH AVAILABILITY CONSTRAINTS
A new method is developed to schedule jobs on parallel machines with availability constraints. The objective of the problem is to minimize the makespan of the total production schedule. Without the availability constraints the scheduling of machines is a Pm || Cmax problem. The scheduling of this pr...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10222/12733 |