Abstract
This paper focuses on the single machine sequencing and common due-date assignment problem for the objective of minimizing the sum of the penalties associated with earliness, tardiness and due-date assignment. Unlike the previous research articles on this class of scheduling problem, we consider sequence-dependent setup times that make the problem much more difficult. To solve the problem, a branch and bound algorithm, which incorporates the method to obtain lower and upper bounds as well as a dominance property to reduce the search space, is suggested that gives the optimal solutions for small-sized instances. Heuristic algorithms are suggested to obtain solutions for large-sized problems within a reasonable computation time. The performances of both the optimal and heuristic algorithms, in computational experiments on randomly generated test instances, are reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker KR (1974). Introduction to Sequencing and Scheduling . John Wiley & Sons: New York.
Baker KR and Scudder GD (1989). On the assignment of optimal due dates . J Opl Res Soc 40: 93–95.
Baker KR and Scudder GD (1990). Scheduling with earliness and tardiness penalties: a review . Opns Res 38: 22–36.
Birman M and Mosheiov G (2004). A note on due-date assignment on a two-machine flow-shop . Comput Opns Res 31: 473–480.
Biskup D and Jahnke H (2001). Common due-date assignment for scheduling on a single machine with jointly reducible processing times . Int J Prod Econ 69: 317–322.
Chen ZL (1996). Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs . Eur J Opl Res 93: 49–60.
Chen DW, Li S and Tang GC (1997). Single machine scheduling with common due date assignment in a group technology environment . Math Comput Model 25: 81–90.
Cheng TCE (1986). A note on the common due-date assignment problem . J Opl Res Soc 37: 1089–1091.
Cheng TCE (1989). A heuristic for common due-date assignment and job scheduling on parallel machines . J Opl Res Soc 40: 1129–1135.
Cheng TCE (1990). Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs . Eng Optimiz 16: 129–136.
Cheng TCE and Kovalyov MY (1996). Bath scheduling and common due-date assignment on a single machine . Discrete Appl Math 70: 231–245.
Cheng TCE, Oguz C and Qi XD (1996). Due-date assignment and single machine scheduling with compressible processing times . Int J Prod Econ 43: 29–35.
Cheng TCE, Chen ZL and Shakhlevich NV (2002). Common due-date assignment and scheduling with ready times . Comput Opns Res 29: 1957–1967.
De P, Ghosh JB and Wells CE (1991). On the multiple-machine extension to a common due-date assignment and scheduling problem . J Opl Res Soc 42: 419–422.
Diamond JE and Cheng TCE (2000). Error bound for common due date assignment and job scheduling on parallel machines . IIE Trans 32: 445–448.
Gordon V and Kubiak W (1998). Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs . Inform Process Lett 68: 153–159.
Gordon V, Proth JM and Chu C (2002). A survey of the state-of-the-art of common due-date assignment and scheduling research . Eur J Opl Res 139: 1–25.
Hall NG (1986). Scheduling problems with generalized due dates . IIE Trans 18: 220–222.
Kim S-I, Choi H-S and Lee D-H (2007). Scheduling algorithms for parallel machines with sequence-dependent setup and distinct ready times: minimizing total tardiness . Proc Inst Mech Eng Part B: J Eng Manuf 221: 1087–1096.
Li C-L, Mosheiov G and Yovel U (2007). An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs. Comput Opns Res, Available online.
Mosheiov G (2001). A common due-date assignment problem on parallel identical machines . Comput Opns Res 28: 719–732.
Ng CTD, Cheng TCE, Kovalyov MY and Lam SS (2003). Single machine scheduling with a variable common due date and resource-dependent processing times . Comput Opns Res 30: 1173–1185.
Panwalkar SS, Smith ML and Seidmann A (1982). Common due-date assignment to minimize total penalty for the one machine scheduling problem . Opns Res 30: 391–399.
Quaddus MA (1987). A generalized model of optimal due-date assignment by linear programming . J Opl Res Soc 38: 353–359.
Rabadi G, Mollaghasemi M and Anagnostopoulos GC (2004). A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time . Comput Opns Res 31: 1727–1751.
Shabtay D (2006). Due date assignments and scheduling a single machine with a general earliness/tardiness cost function. Comput Opns Res, Available online.
Shabtay D and Steiner G (2006). Two due date assignment problems in scheduling a single machine . Opns Res Lett 34: 683–691.
Xia Y, Chen B and Yue J (2008). Job sequencing and due date assignment in a single machine shop with uncertain processing times . Eur J Opl Res 184: 63–75.
Acknowledgements
This work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD, Basic Research Promotion Fund) (KRF-2007-331-D00547).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kim, JG., Lee, DH. Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times. J Oper Res Soc 60, 1264–1272 (2009). https://doi.org/10.1057/jors.2008.95
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2008.95