Skip to main content
SpringerLink
Log in

Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart

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

Abstract

We consider the online scheduling of equal length jobs on unbounded parallel batch processing machines to minimize makespan with limited restart. In the problem \(m\) identical unbounded parallel batch processing machines are available to process the equal length jobs arriving over time. The processing batches are allowed limited restart. Here, “restart” means that a running task may be interrupted, losing all the work done on it, and the jobs in the interrupted task are then released and become independently unscheduled jobs, called restarted jobs. “Limited restart” means that only a running batch that contains no restarted jobs can be restarted. For this problem, we present a best possible online algorithm.

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

  • Chen H, Zhang YP, Yong XR (2009) On-line scheduling on a single bounded batch processing machine with restarts. In: Proceedings of the first international workshop on education technology and computer science. IEEE Computer Society, Washington, pp 868–871

  • Deng XT, Poon CK, Zhang YZ (2003) Approximation algorithms in batch processing. J Combin Optim 7:247–257

    Article  MathSciNet  MATH  Google Scholar 

  • Epstein L, Van Stee R (2003) Lower bounds for on-line single-machine scheduling. Theoret Comput Sci 299:439–450

    Article  MathSciNet  MATH  Google Scholar 

  • Fu RY, Tian J, Yuan JJ, Lin YX (2007) On-line scheduling in a parallel batch processing system to minimize makespan using restarts. Theoret Comput Sci 374:196–202

    Article  MathSciNet  MATH  Google Scholar 

  • Fu RY, Tian J, Yuan JJ, He C (2008) On-line scheduling on a batch machine to minimize makespan with limited restarts. Oper Res Lett 36:255–258

    Article  MathSciNet  MATH  Google Scholar 

  • Fu RY, Cheng TCE, Ng CT, Yuan JJ (2010) Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan. Inform Process Lett 110:444–450

    Article  MathSciNet  MATH  Google Scholar 

  • Hoogeveen H, Potts CN, Woeginger GJ (2000) On-line scheduling on a single machine: maximizing the number of early jobs. Oper Res Lett 27:193–197

    Article  MathSciNet  MATH  Google Scholar 

  • Hoogeveen JA, Vestjens APA (2000) A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM J Discret Math 13:56–63

    Article  MathSciNet  MATH  Google Scholar 

  • Liu PH, Lu XW, Fang Y (2012) A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. J Sched 15:77–81

    Article  MathSciNet  MATH  Google Scholar 

  • Liu HL, Yuan JJ (2014) Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart. Theoret Comput Sci 543:24–36

    Article  MathSciNet  MATH  Google Scholar 

  • Nong QQ, Cheng TCE, Ng CT (2008) An improved on-line algorithm for scheduling on two unrestrictive parallel-batch processing machines. Oper Res Lett 36:584–588

    Article  MathSciNet  MATH  Google Scholar 

  • Poon CK, Yu WC (2005) Online scheduling algorithms for a batch machine with finite capacity. J Combin Optim 9:167–186

    Article  MathSciNet  MATH  Google Scholar 

  • Tian J, Cheng TCE, Ng CT, Yuan JJ (2009a) Online scheduling on unbounded parallel-batch machines to minimize the makespan. Inform Process Lett 109:1211–1215

  • Tian J, Fu RY, Yuan JJ (2009b) A best online algorithm for scheduling on two parallel batch machines. Theoret Comput Sci 410:2291–2294

  • Tian J, Fu RY, Yuan JJ (2014) Online over time scheduling on parallel-batch machines: a survey. J Oper Res Soc China 2:445–454

    Article  MathSciNet  MATH  Google Scholar 

  • Uzsoy R, Lee CY, Martin-Vega LA (1992) A review of production planning and scheduling models in the semiconductor industry, part I: system characteristics, performance evaluation and production planning. IIE Trans Sched Logist 24:47–61

    Google Scholar 

  • Uzsoy R, Lee CY, Martin-Vega LA (1994) A survey of production planning and scheduling models in the semiconductor industry, part II: shop-floor control. IIE Trans Sched Logist 26:44–55

    Google Scholar 

  • Van den Akker M, Hoogeveen H, Vakhania N (2003) Restarts can help in the online minimization of the maximum delivery time on a single machine. J Sched 3:333–341

    Article  MATH  Google Scholar 

  • Van stee R, La Poutré H (2005) Minimizing the total completion time on-line on a single machine using restarts. J Algorithms 57:95–129

    Article  MathSciNet  MATH  Google Scholar 

  • Yuan JJ, Fu RY, Ng CT, Cheng TCE (2011) A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J Sched 14:361–369

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang GC, Cai XQ, Wong CK (2001) On-line algorithms for minimizing makespan on batch processing machines. Naval Res Logist 48:241–258

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang GC, Cai XQ, Wong CK (2003) Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Trans 35:175–181

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the associate editor and two anonymous referees for their constructive comments and kind suggestions. This work was supported by NSFC (11271338), NSFC (11171313), NSFC (11401604), NSFHN (132300410392), and Henan Institute of Engineering (Y2010018).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, Henan, People’s Republic of China

    Hailing Liu & Jinjiang Yuan

  2. College of Science, Henan Institute of Engineering, Zhengzhou, 451191, Henan, People’s Republic of China

    Hailing Liu

  3. School of Mathematical Sciences, Luoyang Normal University, Luoyang, 471022, Henan, People’s Republic of China

    Wenjie Li

Authors
  1. Hailing Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jinjiang Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenjie Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jinjiang Yuan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, H., Yuan, J. & Li, W. Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart. J Comb Optim 31, 1609–1622 (2016). https://doi.org/10.1007/s10878-015-9844-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9844-3

Keywords

Search

Navigation