Abstract
A batch is a subset of jobs which must be processed jointly in either serial or parallel form. The algorithmic aspects of the batching scheduling problems have been extensively studied in the literature. This paper presents necessary and sufficient conditions of the existence of optimal batch sequences for the single machine, batching, total weighted completion time scheduling problems on two batching ways: (1) all jobs form one batch; (2) each batch contains a single job. This kind of conditions can help us to recognize some special optimal schedules quickly.
Similar content being viewed by others
References
Albers S, Brucker P (1993) The complexity of one-machine batching problem. Discret Appl Math 46:87–107
Brucker P (2001) Scheduling algorithms. Springer-Verlag, Berlin
Brucker P, Gladky A, Hoogeveen H, Kovalyov MY, Potts CN, Tautenhahn T, van de Velde SL (1998) Scheduling a batching machine. J Sched 1:31–54
Coffman EG, Yannakakis M, Magazine MJ, Santos C (1990) Batch sizing and sequencing on a single machine. Ann Oper Res 26:135–147
Liu ZH, Yuan JJ, Cheng TCE (2003) On scheduling an unbounded batch machine. Oper Res Lett 31:42–48
Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120:228–249
Yuan JJ, Lin YX, Cheng TCE, Ng CT (2007) Single machine serial-batching scheduling problem with common batch size to minimize total weighted completion time. Int J Prod Econ 105:402–406
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by NSFC (10671183).
Rights and permissions
About this article
Cite this article
Li, W., Yuan, J. & Lin, Y. A note on special optimal batching structures to minimize total weighted completion time. J Comb Optim 14, 475–480 (2007). https://doi.org/10.1007/s10878-007-9070-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9070-8