Minimizing makespan for two parallel machines with job limit on each availability interval
- First Online:
- 10 Downloads
We consider the problem of scheduling jobs on two parallel machines that are not continuously available for processing. The machine is not available after processing a fixed number of jobs in order to make precision adjustment of machines such as in wafer manufacturing, to reload the feeder in printed circuit board production, or to undertake any other maintenance works such as cleaning and safety inspections. The objective of the problem is to minimize the makespan. Two different scheduling horizons are investigated for this problem. For the short-term scheduling horizon, we consider only the time period before the unavailability interval, while for the long-term horizon, machines are allowed to restart processing after the unavailability interval. For both cases, which are strongly NP-hard, exact optimization algorithms based on the branch and bound method are proposed. Although the algorithms have exponential time complexities, computational results show that they can solve optimally the various-sized problems in reasonable computation time.
Keywordsscheduling parallel machines availability constraint makespan branch and bound method
- Kellerer H (1998). Algorithms for multiprocessor scheduling with machine release times. IIE Trans 30: 991–999.Google Scholar
- Lenstra JK, Rinnooy Kan AHG and Brucker P (1977). Complexity of machine scheduling problems. Ann Discrete Math 1: 342–362.Google Scholar
- Pinedo M (2002). Scheduling: Theory, Algorithms, and System, 2nd edn. Prentice-Hall: Englewood Cliffs, NJ.Google Scholar