Abstract
This research deals with the single machine scheduling problem of minimizing the makespan with sequence dependent setup times and delayed precedence constraints. A makespan calculation model is first proposed. When given a feasible job sequence, the proposed model can calculate the makespan. Then a variable neighbourhood search (VNS) with four phases is proposed for optimizing the job sequence. The proposed VNS adopts five operations to search for new solutions, and modifies all solutions to satisfy precedence constraints. The proposed VNS will accept a worse solution over a better solution with a certain probability, in order to escape from a local optimum. The experimental results show that the proposed VNS provides the best results with less than 10 s of computation time. Therefore it is efficient and effective in solving the single machine scheduling problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas E, Lenstra JK, Vazacopoulos A (1995) The one-machine problem with delayed precedence constraints and its use in job scheduling. Manage Sci 41:94–109
Brucker P, Hilbig T, Hurink J (1999) A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Appl Math 70:247–266
Chen P, Huang HK, Dong XY (2010) Iterated variable neighbourhood descent algorithm for the capacitated vehicle routing problem. Expert Syst Appl 37:1620–1627
Cheng TCE, Janiak A (1994) Resource optimal control in some single-machine scheduling problems. IEEE Trans Autom Control 39:1243–1246
Cheng TCE, Kovalyov MY, Shakhlevich NV (2006a) Scheduling with controllable release dates and processing times: makespan minimization. Eur J Oper Res 175:751–768
Cheng TCE, Kovalyov MY, Shakhlevich NV (2006b) Scheduling with controllable release dates and processing times: total completion time minimization. Eur J Oper Res 175:769–781
Choi BC, Yoon SH, Chung SJ (2007) Single machine scheduling problems with resource dependent release times. Comput Oper Res 34:1988–2000
Choobineh FF, Mohebbi E, Khoo H (2006) A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times. Eur J Oper Res 175:318–337
Davari M, Demeulemeester E, Leus R, Nobibon FT (2016) Exact algorithms for single-machine scheduling with time windows and precedence constraints. J Sched. doi:10.1007/s10951-015-0428-y
Finta L, Liu Z (1996) Single machine scheduling subject to precedence delays. Discrete Appl Math 70:247–266
Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326
Hansen P, Mladenovic’ N (2001) Variable neighbourhood search: principles and applications. Eur J Oper Res 130:449–467
Janiak A (1991) Single machine scheduling problem with a common deadline and resource dependent release dates. Eur J Oper Res 53:317–325
Janiak A (1998) Single machine sequencing with linear models of release dates. Naval Res Logist 45:99–113
Jula P, Kones I (2013) Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains. Int J Prod Res 51(12):3654–3670
Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680
Koulamas C (2010) The single-machine total tardiness scheduling problem: review and extensions. Eur J Oper Res 202:1–7
Kuo Y (2010) Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput Ind Eng 59:157–165
Lawler EL (1978) Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Algorithmic Asp Comb 2:75–90
Lee DH, Cao Z, Meng Q (2007) Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm. Int J Prod Econ 107:115–124
Li CL (1994) Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions. Naval Res Logist 41:807–819
Li CL, Swell EC, Cheng TCE (1995) Scheduling to minimize release-time resource consumption and tardiness penalties. Naval Res Logist 42:949–966
Pereira J (2016) The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective. Comput Oper Res 66:141–152
Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, Englewood Cliffs
Potts CN (1985) A lagrangean based branch and bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time. Manage Sci 31(10):1300–1311
Tanaka S, Sato S (2013) An exact algorithm for the precedence-constrained single-machine scheduling problem. Eur J Oper Res 229(2):345–352
Vahdani B, Zandieh M (2010) Scheduling trucks in cross-docking systems: robust meta-heuristics. Comput Ind Eng 58:12–24
Ventura JA, Kim D, Garriga F (2002) Single machine earliness-tardiness scheduling with resource-dependent release dates. Eur J Oper Res 142:52–69
Wikum ED, Llewellyn DC, Nemhauser GL (1994) One-machine generalized precedence constrained scheduling problems. Oper Res Lett 16:87–99
Yang T, Peters BA, Tu M (2005) Layout design for flexible manufacturing systems considering single-loop directional flow patterns. Eur J Oper Res 164:440–455
Acknowledgements
This work was supported, in part, by the Ministry of Science and Technology of Taiwan, under Grant MOST 105-2221-E-131-025-.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kuo, Y., Chen, SI. & Yeh, YH. Single machine scheduling with sequence-dependent setup times and delayed precedence constraints. Oper Res Int J 20, 927–942 (2020). https://doi.org/10.1007/s12351-017-0349-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12351-017-0349-y