Skip to main content
Log in

A note on special optimal batching structures to minimize total weighted completion time

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

    Article  MathSciNet  Google Scholar 

  • Brucker P (2001) Scheduling algorithms. Springer-Verlag, Berlin

    MATH  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

  • Coffman EG, Yannakakis M, Magazine MJ, Santos C (1990) Batch sizing and sequencing on a single machine. Ann Oper Res 26:135–147

    Article  MATH  MathSciNet  Google Scholar 

  • Liu ZH, Yuan JJ, Cheng TCE (2003) On scheduling an unbounded batch machine. Oper Res Lett 31:42–48

    Article  MATH  MathSciNet  Google Scholar 

  • Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120:228–249

    Article  MATH  MathSciNet  Google Scholar 

  • 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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenhua Li.

Additional information

Research supported by NSFC (10671183).

Rights and permissions

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-007-9070-8

Keywords

Navigation