Skip to main content
SpringerLink
Log in

Minimizing total flow time subject to preemption penalties in online scheduling

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

There has been extensive research over the decades on the preemptive scheduling. However, little attention has been devoted to problems where a certain time penalty such as setup times is incurred when preemption is allowed. In this paper, we consider the single-machine scheduling problem of minimizing the total flow time subject to job release dates and preemption penalties. When a job is started, whether initially or after being preempted, a job-dependent setup time must take place. The problem is strongly NP-hard even if the setup time is one unit. Therefore, we present a heuristic approach and validate it using some numerical examples.

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

  1. Potts CN, Wassenhove LNV (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43:395–406

    Article  MATH  Google Scholar 

  2. Monma CL, Potts CN (1993) Analysis of heuristics for preemptive parallel machine scheduling with batch setup times. Oper Res 41:981–993

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen B (1993) A better heuristic for preemptive parallel machine scheduling with batch setup times. SIAM J Comput 22:1303–1318

    Article  MATH  MathSciNet  Google Scholar 

  4. Zdrzalka S (1994) Preemptive scheduling with release dates, delivery times and sequence independent setup times. Eur J Oper Res 76:60–71

    Article  MATH  Google Scholar 

  5. Schuurman P, Woeginger GJ (1999) Preemptive scheduling with job-dependent setup times. Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp 759–767

  6. Liu Z, Cheng TCE (2002) Scheduling with job release dates, delivery times and preemption penalties. Inf Process Lett 82:107–111

    Article  MATH  MathSciNet  Google Scholar 

  7. Julien FM, Magazine MJ, Hall NG (1997) Generalized preemption models for single-machine dynamic scheduling problems. IIE Trans 29:359–372

    Google Scholar 

  8. Liu Z, Cheng E (2004) Minimizing total completion time subject to job release dates and preemption penalties. J Sched 7:313–327

    Article  MATH  MathSciNet  Google Scholar 

  9. Zheng F, Dai W, Xiao P, Zhao Y (2005) Competitive strategies for on-line production order disposal problem. In: Proc. of 1st International Conference on Algorithmic Applications in Management, pp 46–54

  10. Zheng F, Xu Y, Zhang E (2007) On-line production order scheduling with preemption penalties. J Comb Optim 13:189–204

    Article  MATH  MathSciNet  Google Scholar 

  11. Stanley PYF (2008) Lower bounds on online deadline scheduling with preemption penalties. Inf Process Lett 108:214–218

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran

    Mehdi Heydari, Seyed Jafar Sadjadi & Emran Mohammadi

Authors
  1. Mehdi Heydari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Seyed Jafar Sadjadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Emran Mohammadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emran Mohammadi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heydari, M., Sadjadi, S.J. & Mohammadi, E. Minimizing total flow time subject to preemption penalties in online scheduling. Int J Adv Manuf Technol 47, 227–236 (2010). https://doi.org/10.1007/s00170-009-2190-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-009-2190-9

Keywords

Search

Navigation