Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms
Normal batching machine scheduling problems are assumed that the capacity of the machine, the maximum number of jobs that the machine can handle up to simultaneously, is fixed. However, in some realistic situations, the capacity of a machine is not constant. We call it a flexible batching machine. In this paper, we address the problem of scheduling jobs on a flexible batching machine to minimize the makespan. We prove that the problem is strong NP-hard, and its two agreeable cases are NP-hard. Then two pseudo-polynomial algorithms for the two cases are presented respectively.
Keywordsscheduling batching machine complexity dynamic programming
Unable to display preview. Download preview PDF.
- Julien, F., Magazine, M.: Batching and Scheduling Multi-Job Orders. CORS/TIMS/ORSA Vancouver Bulletin (1989)Google Scholar
- Lageweg, B.J., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Computer aided complexity classification of deterministic scheduling problems. Research Report BW138/81, Mathematisch Centrum, Amsterdam (1981)Google Scholar
- Tang, G., Zhang, F., Luo, S., Liu, L.: Theory of Modern Scheduling. Shanghai Popular Science Press (2003)Google Scholar
- Vickson, R.G., Magazine, M.J., Santos, C.A.: Batching and Scheduling of Components at a Single Facility. Working Paper 185-MS-1989, University of Waterloo, CanadaGoogle Scholar