Abstract
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.
Supported by NSFC(No.10371071), SSFC(No.03ZR14039), and SEFC(No.04RB06).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahmadi, J.h., Almadi, R.h., Dasu, S., Tang, C.S.: Batching and Jobs on Batch andDiscrete Processors. Operations Research 40, 750–763 (1992)
Brucker, P., Gladky, S., Hoogeveen, H., Kovalyov, M., Potts, C., Tantenhahn, T., Van de Velde, S.: Scheduling a batching machine. Journal of Scheduling 1(1), 31–54 (1998)
Coffman Jr., E., Nozari, A., Yannakakis, M.: Optimal Scheduling of Products with Two Subassemblies of a Single Machine. Operations Research 37, 426–436 (1989)
Garey, M.R., Johnson, D.S.: Computers and intactability: A guide to the theory of NP-completeness. Freeman, New York (1979)
Ikura, Y., Gimple, M.: Efficient scheduling algorithms for a single batch processing machine. Operations Research Letter 5, 61–65 (1986)
Julien, F., Magazine, M.: Batching and Scheduling Multi-Job Orders. CORS/TIMS/ORSA Vancouver Bulletin (1989)
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)
Lee, C.-Y., Uzsoy, R.: Minimizing makespan on a single batch processing machine with dynamic job arrivals. International Journal of Production Research 37, 219–236 (1999)
Lee, C.-Y., Uzsoy, R., Martin-Vega, L.A.: Efficient Algorithms for Scheduling Semiconductor Burn-in Operations. Operations Research 140(40), 764–775 (1992)
Liu, Z.-H., Yu, W.-C.: Scheduling one Batch Processor Subject to Job Release Dates. Discrete Applied Mathematics 105, 129–136 (2000)
Santos, C., Magazine, M.: Batching in Single Operation Manufacturing Syatem. Operations Research Letter 4, 99–103 (1985)
Tang, C.S.: Scheduling Batches on Parallel Machines with Major and Mi-nor Setups. European Journal of Operational Research 46, 28–37 (1990)
Tang, G., Zhang, F., Luo, S., Liu, L.: Theory of Modern Scheduling. Shanghai Popular Science Press (2003)
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, Canada
Webster, S., Baker, K.R.: Scheduling Groups of Jobs on a Single Machine. Operations Research 43, 692–703 (1995)
Zhang, G., Cai, X., Wong, C.K.: On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48, 241–258 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, B., Tang, G. (2006). Scheduling Jobs on a Flexible Batching Machine: Model, Complexity and Algorithms. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_11
Download citation
DOI: https://doi.org/10.1007/11750321_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)