Skip to main content
SpringerLink
Log in

Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time

  • Theoretical Paper
  • Published:
Journal of the Operational Research Society

Abstract

This paper considers the problem of scheduling a given number of jobs on a single machine to minimize the sum of maximum earliness and maximum tardiness when sequence-dependent setup times exist (1∣ST sd ∣ET max). In this paper, an optimal branch-and-bound algorithm is developed that involves the implementation of lower and upper bounding procedures as well as three dominance rules. For solving problems containing large numbers of jobs, a polynomial time-bounded heuristic algorithm is also proposed. Computational experiments demonstrate the effectiveness of the bounding and dominance rules in achieving optimal solutions in more than 97% of the instances.

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

Figure 1
Figure 2
Figure 3

Similar content being viewed by others

References

  • Allahverdi A, Gupta JND and Aldowaisan T (1999). A review of scheduling research involving setup considerations. Omega 27: 219–239.

    Article  Google Scholar 

  • Amin-Nayeri MR and Moslehi G (2000). Optimal algorithm for single machine sequencing to minimize early/tardy cost. J Esteghlal. Isfahan University of Technology 1: 35–48.

    Google Scholar 

  • Baker KR and Scudder GD (1990). Sequencing with earliness and tardiness penalties: A review. J Opl Res 38: 22–36.

    Article  Google Scholar 

  • Das SR, Gupta JND and Khumawala BM (1995). A saving index heuristic algorithm flow shop scheduling with sequence dependent set-up times. J Opl Res Soc 46: 1365–1373.

    Article  Google Scholar 

  • Davis JS and Kanet JJ (1993). Single-machine scheduling with early and tardy completion costs. Nav Res Logist 40: 85–101.

    Article  Google Scholar 

  • Fry TD, Armstrong RD and Blackstone JH (1987). Minimizing weighted absolute deviation in single machine scheduling. IIE Trans 9: 445–450.

    Article  Google Scholar 

  • Garey MR, Tarjan RE and Wilfong GT (1988). One-processor scheduling with symmetric earliness and tardiness. Math Opns Res 13: 330–348.

    Article  Google Scholar 

  • Kanet JJ and Sridharan V (2000). Scheduling with inserted idle time: Problem taxonomy and literature review. J Opl Res 48: 99–110.

    Article  Google Scholar 

  • Kim YD and Yano CA (1994). Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Nav Res Logist 41: 913–933.

    Article  Google Scholar 

  • Laguna M (1999). A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times. IIE Trans 31: 125–134.

    Google Scholar 

  • Liu C and Chang S (2000). Scheduling flexible flow shops with sequence-dependent setup effects. IEEE T Robotic Autom 16 (4): 408–419.

    Article  Google Scholar 

  • Luh PB, Gou L, Zhang Y, Nagahora T, Tsuji M, Yoneda K, Hasegawa T, Kyoya Y and Kano T (1998). Job shop scheduling with group dependent setups, finite buffers, and long time horizon. Ann Opns Res 76: 233–259.

    Article  Google Scholar 

  • Luo X and Chu C (2007). A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness. Eur J Opl Res 180: 68–81.

    Article  Google Scholar 

  • Mahnam M and Moslehi G (2009). A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times. Eng Optimiz 41: 521–536.

    Article  Google Scholar 

  • Panwalkar SS, Dudek RA and Smith ML (1973). Sequencing research and the industrial scheduling problem. In: Elmaghraby SE (ed). Symposium on the Theory of Scheduling and its Applications. Springer-Verlag: Berlin, pp 29–38.

    Chapter  Google Scholar 

  • Schaller J (2007a). A comparison of lower bounds for the single-machine early/tardy problem. Comput Opns Res 34: 2279–2292.

    Article  Google Scholar 

  • Schaller J (2007b). Scheduling on a single machine with family setups to minimize total tardiness. Int J Prod Econ 105: 329–344.

    Article  Google Scholar 

  • Schaller J and Gupta JND (2008). Single machine scheduling with family setups to minimize total earliness and tardiness. Eur J Opl Res 187: 1050–1106.

    Article  Google Scholar 

  • Sourd F (2005). Earliness–tardiness scheduling with setup considerations. Comput Opns Res 32: 1849–1865.

    Article  Google Scholar 

  • Sourd F (2006). Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints. Opns Res Lett 34: 591–598.

    Article  Google Scholar 

  • Tavakkoli-Moghaddam R, Moslehi G, Vasei M and Azaron A (2005). Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert. J Appl Math Comput 167: 1430–1450.

    Article  Google Scholar 

  • Tavakkoli-Moghaddam R, Moslehi G, Vasei M and Azaron A (2006). A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert. J Appl Math Comput 174: 388–408.

    Article  Google Scholar 

  • Wisner JD and Siferd SP (1995). A survey of LIS manufacturing practices in make-to-order machine shops. Prod Inventory Mngt J : 11–17.

  • Yano CA and Kim YD (1991). Algorithms for a class of single machine weighted tardiness and earliness problems. Eur J Opl Res 52: 161–178.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Isfahan University of Technology, Isfahan, Iran

    N Nekoiemehr & G Moslehi

Authors
  1. N Nekoiemehr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G Moslehi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N Nekoiemehr.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nekoiemehr, N., Moslehi, G. Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time. J Oper Res Soc 62, 1403–1412 (2011). https://doi.org/10.1057/jors.2010.94

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2010.94

Keywords

Search

Navigation