Abstract
Scheduling problems with batching operation are largely considered in the literature of the last decade. Batching means that sets of jobs which are processed on the same machine are grouped together into batches. One distinguish in the literature of scheduling two types of batching, namely, parallel batching and serial batching. In parallel batching, jobs are processed simultaneously so that the processing time of batch is given by the largest processing times of jobs of this batch. In serial batching, jobs are processed sequentially so that the processing of batch is given by the total processing times of jobs of this batch. This chapter focuses on several problems of no-wait scheduling problem including batching machines. Theoretical and experimental results are presented and some future researches are discussed.
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
References
Albers, S., Brucker, P.: The complexity of one-machine batching problems. Discrete Applied Mathematics, 47, 87–107 (1993)
Bellanger, A., Oulamara, A.: Scheduling hybrid flowshop with parallel batching machines and compatibilities. Computers and Operations Research 36(6), 1982–1992 (2009)
Boudhar, M.: Dynamic scheduling on a single batch processing machine with split compatibility graphs. Journal of Mathematical Modelling and Algorithms 2, 17–35 (2003)
Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. Belgian journal of operations research, statistics and computer science 40, 69–80 (2000)
Brucker, P., Gladky, A., Hoogeveen, J.A., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., Van de Velde, and S.L.: Scheduling a batch processing machine. Journal of Scheduling 1, 31–54 (1998)
Brucker, P., Kovalyov, M.Y.: Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research 43, 1–8 (1996)
Cheng, T.C.E., Liu, Z., Yu, W.: Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Transactions 33(8), 685–690 (2001)
Coffman Jr., E.G., Yannakakis, M., Magazine, M.J., Santos, C.A.: Batch sizing and job sequencing on a single machine. Annals of Operations Research 26, 135–147 (1990)
Deng, X., Feng, H., Zhang, P., Zhang, Y., Zhu, H.: Minimizing mean completion time in a batch processing system. Algorithmica 38(4), 513–528 (2004)
De Werra, D., Demange, M., Escoffier, B., Monnot, J., Paschos, V. Th.: Weighted coloring on planar, bipartite and split graphs : Complexity and approximation. Discrete Applied Mathematics 157(4), 819–832 (2009)
Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics 17, 449–467 (1965)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to NP-completeness. W.H. Freeman, San Francisco (1979)
Gavranovic, H., Finke, G.: Graph partitioning and set covering for optimal design of production system in the metal industry. In Proceedings of the second Conference on Management and Control of Production and Logistics - MCPL’00, Grenoble (2000)
Gilmore, P.C., Gomory, R. E.: Sequencing a one state-variable machine: A solvable case of the traveling salesman problem. Operations Research 12, 655–679 (1964)
Glass, C.A., Potts, C.N., Strusevich, V.A.: Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. Informs Journal on computing 13(2), 120–137 (2001)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rimooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling : a survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Oulamara, A., Finke, G., Kamgaing Kuiten, A.: Flowshop scheduling problem with batching machine and task compatibilities. Computers & Operations Research 36(2), 391–401 (2009)
Oulamara, A., Kovalyov, M.Y., Finke, G.: Scheduling a no-wait flowshop with unbounded batching machines. IIE Transactions on Scheduling and logistics 37(8), 685–696 (2005)
Potts, C.N., Kovalyov, M.Y.: Scheduling with batching : A review. Journal of Operational Research 120(2), 228–249 (2000)
Potts, C.N., Strusevich, V.A., Tautenhahn, T.: Scheduling batches with simultaneous job processing for two-machine shop problems. Journal of Scheduling 4(1), 25–51 (2001)
Potts, C.N., Van Wassenhove, L.N.: Integrating scheduling with batching and lotsizing : A review of algorithms and complexity. Operations Research Society 42, 395–406 (1992)
Uzsoy, R., Yang, Y.: Minimizing total weighted completion time on a single batch processing machine. Production and Operations Management 6(1), 57–73 (1997)
Webster, S., Baker, K.R.: Scheduling groups of jobs on a single machine. Operations Research 43, 692–704 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Oulamara, A. (2012). No-Wait Scheduling Problems with Batching Machines. In: RÃos-Mercado, R., RÃos-SolÃs, Y. (eds) Just-in-Time Systems. Springer Optimization and Its Applications(), vol 60. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1123-9_7
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1123-9_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-1122-2
Online ISBN: 978-1-4614-1123-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)