Skip to main content
SpringerLink
Log in

On-line machine scheduling with batch setups

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

Abstract

We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical processing times, for which efficient on-line heuristics are proposed and their competitive performance is evaluated.

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

Access this article

Log in via an institution

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

  • Allahverdi A, Gupta JN, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega, Int J Manag Sci 27:219–239

    Article  Google Scholar 

  • Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MathSciNet  MATH  Google Scholar 

  • Cheng TCE, Chen ZL, Kovalyov MY, Lin BMT (1996) Parallel-machine batching and scheduling to minimize total completion time. IIE Trans 28:953–956

    Google Scholar 

  • Coffman EG, Nozari A, Yannakakis M (1989) Optimal scheduling of products with two subassembles on a single machine. Oper Res Lett 37(3):426–436

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Gfeller B, Peeters L, Weber B, Widmayer P (2006a) Online single machine batch scheduling. In: LNCS, vol 4162. Springer, Berlin, pp 424–435

    Google Scholar 

  • Gfeller B, Peeters L, Weber B, Widmayer P (2006b) Single machine batch scheduling with release times. Institute of Theoretical Computer Science. ETH Zurich, Tech Rep 514:1–23

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Santos C, Magazine MJ (1985) Batching in single operation manufacturing systems. Oper Res Lett 4:99–103

    Article  MATH  Google Scholar 

  • Shallcross DF (1992) A polynomial algorithm for a one machine batching problem. Oper Res Lett 11:213–218

    Article  MathSciNet  MATH  Google Scholar 

  • Webster S, Baker KR (1995) Scheduling groups for jobs on a single machine. Oper Res 43(4):692–703

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, The University of Melbourne, Melbourne, VIC, 3010, Australia

    Lele Zhang & Andrew Wirth

Authors
  1. Lele Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Wirth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrew Wirth.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, L., Wirth, A. On-line machine scheduling with batch setups. J Comb Optim 20, 285–306 (2010). https://doi.org/10.1007/s10878-009-9211-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-009-9211-3

Keywords

Search

Navigation