{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:41:31Z","timestamp":1775068891690,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T00:00:00Z","timestamp":1505952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST 105-2221-E-131 -025 -"],"award-info":[{"award-number":["MOST 105-2221-E-131 -025 -"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s12351-017-0349-y","type":"journal-article","created":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T09:02:23Z","timestamp":1505984543000},"page":"927-942","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Single machine scheduling with sequence-dependent setup times and delayed precedence constraints"],"prefix":"10.1007","volume":"20","author":[{"given":"Yiyo","family":"Kuo","sequence":"first","affiliation":[]},{"given":"Sheng-I","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yen-Hung","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,21]]},"reference":[{"key":"349_CR1","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","volume":"41","author":"E Balas","year":"1995","unstructured":"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\u2013109","journal-title":"Manage Sci"},{"key":"349_CR2","first-page":"247","volume":"70","author":"P Brucker","year":"1999","unstructured":"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\u2013266","journal-title":"Discrete Appl Math"},{"key":"349_CR3","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.eswa.2009.06.047","volume":"37","author":"P Chen","year":"2010","unstructured":"Chen P, Huang HK, Dong XY (2010) Iterated variable neighbourhood descent algorithm for the capacitated vehicle routing problem. Expert Syst Appl 37:1620\u20131627","journal-title":"Expert Syst Appl"},{"key":"349_CR4","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1109\/9.293187","volume":"39","author":"TCE Cheng","year":"1994","unstructured":"Cheng TCE, Janiak A (1994) Resource optimal control in some single-machine scheduling problems. IEEE Trans Autom Control 39:1243\u20131246","journal-title":"IEEE Trans Autom Control"},{"key":"349_CR5","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2005.06.021","volume":"175","author":"TCE Cheng","year":"2006","unstructured":"Cheng TCE, Kovalyov MY, Shakhlevich NV (2006a) Scheduling with controllable release dates and processing times: makespan minimization. Eur J Oper Res 175:751\u2013768","journal-title":"Eur J Oper Res"},{"key":"349_CR6","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.ejor.2005.06.072","volume":"175","author":"TCE Cheng","year":"2006","unstructured":"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\u2013781","journal-title":"Eur J Oper Res"},{"key":"349_CR7","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1016\/j.cor.2005.06.021","volume":"34","author":"BC Choi","year":"2007","unstructured":"Choi BC, Yoon SH, Chung SJ (2007) Single machine scheduling problems with resource dependent release times. Comput Oper Res 34:1988\u20132000","journal-title":"Comput Oper Res"},{"key":"349_CR8","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/j.ejor.2005.04.038","volume":"175","author":"FF Choobineh","year":"2006","unstructured":"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\u2013337","journal-title":"Eur J Oper Res"},{"key":"349_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-015-0428-y","author":"M Davari","year":"2016","unstructured":"Davari M, Demeulemeester E, Leus R, Nobibon FT (2016) Exact algorithms for single-machine scheduling with time windows and precedence constraints. J Sched. doi:\n10.1007\/s10951-015-0428-y","journal-title":"J Sched"},{"key":"349_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0166-218X(96)00110-2","volume":"70","author":"L Finta","year":"1996","unstructured":"Finta L, Liu Z (1996) Single machine scheduling subject to precedence delays. Discrete Appl Math 70:247\u2013266","journal-title":"Discrete Appl Math"},{"key":"349_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"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\u2013326","journal-title":"Ann Discret Math"},{"key":"349_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovic\u2019 N (2001) Variable neighbourhood search: principles and applications. Eur J Oper Res 130:449\u2013467","journal-title":"Eur J Oper Res"},{"key":"349_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0377-2217(91)90065-4","volume":"53","author":"A Janiak","year":"1991","unstructured":"Janiak A (1991) Single machine scheduling problem with a common deadline and resource dependent release dates. Eur J Oper Res 53:317\u2013325","journal-title":"Eur J Oper Res"},{"key":"349_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/(SICI)1520-6750(199802)45:1<99::AID-NAV6>3.0.CO;2-G","volume":"45","author":"A Janiak","year":"1998","unstructured":"Janiak A (1998) Single machine sequencing with linear models of release dates. Naval Res Logist 45:99\u2013113","journal-title":"Naval Res Logist"},{"issue":"12","key":"349_CR16","doi-asserted-by":"publisher","first-page":"3654","DOI":"10.1080\/00207543.2012.757666","volume":"51","author":"P Jula","year":"2013","unstructured":"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\u20133670","journal-title":"Int J Prod Res"},{"key":"349_CR17","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"349_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.04.007","volume":"202","author":"C Koulamas","year":"2010","unstructured":"Koulamas C (2010) The single-machine total tardiness scheduling problem: review and extensions. Eur J Oper Res 202:1\u20137","journal-title":"Eur J Oper Res"},{"key":"349_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2010.03.012","volume":"59","author":"Y Kuo","year":"2010","unstructured":"Kuo Y (2010) Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Comput Ind Eng 59:157\u2013165","journal-title":"Comput Ind Eng"},{"key":"349_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"EL Lawler","year":"1978","unstructured":"Lawler EL (1978) Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Algorithmic Asp Comb 2:75\u201390","journal-title":"Algorithmic Asp Comb"},{"key":"349_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.ijpe.2006.08.003","volume":"107","author":"DH Lee","year":"2007","unstructured":"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\u2013124","journal-title":"Int J Prod Econ"},{"key":"349_CR22","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1002\/1520-6750(199410)41:6<807::AID-NAV3220410609>3.0.CO;2-8","volume":"41","author":"CL Li","year":"1994","unstructured":"Li CL (1994) Scheduling with resource-dependent release dates\u2014a comparison of two different resource consumption functions. Naval Res Logist 41:807\u2013819","journal-title":"Naval Res Logist"},{"key":"349_CR23","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1002\/1520-6750(199509)42:6<949::AID-NAV3220420607>3.0.CO;2-3","volume":"42","author":"CL Li","year":"1995","unstructured":"Li CL, Swell EC, Cheng TCE (1995) Scheduling to minimize release-time resource consumption and tardiness penalties. Naval Res Logist 42:949\u2013966","journal-title":"Naval Res Logist"},{"key":"349_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cor.2015.08.010","volume":"66","author":"J Pereira","year":"2016","unstructured":"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\u2013152","journal-title":"Comput Oper Res"},{"key":"349_CR25","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"1995","unstructured":"Pinedo M (1995) Scheduling: theory, algorithms, and systems. Prentice Hall, Englewood Cliffs"},{"issue":"10","key":"349_CR26","doi-asserted-by":"publisher","first-page":"1300","DOI":"10.1287\/mnsc.31.10.1300","volume":"31","author":"CN Potts","year":"1985","unstructured":"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\u20131311","journal-title":"Manage Sci"},{"issue":"2","key":"349_CR27","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2013.02.048","volume":"229","author":"S Tanaka","year":"2013","unstructured":"Tanaka S, Sato S (2013) An exact algorithm for the precedence-constrained single-machine scheduling problem. Eur J Oper Res 229(2):345\u2013352","journal-title":"Eur J Oper Res"},{"key":"349_CR28","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cie.2009.06.006","volume":"58","author":"B Vahdani","year":"2010","unstructured":"Vahdani B, Zandieh M (2010) Scheduling trucks in cross-docking systems: robust meta-heuristics. Comput Ind Eng 58:12\u201324","journal-title":"Comput Ind Eng"},{"key":"349_CR29","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/S0377-2217(01)00292-2","volume":"142","author":"JA Ventura","year":"2002","unstructured":"Ventura JA, Kim D, Garriga F (2002) Single machine earliness-tardiness scheduling with resource-dependent release dates. Eur J Oper Res 142:52\u201369","journal-title":"Eur J Oper Res"},{"key":"349_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6377(94)90064-7","volume":"16","author":"ED Wikum","year":"1994","unstructured":"Wikum ED, Llewellyn DC, Nemhauser GL (1994) One-machine generalized precedence constrained scheduling problems. Oper Res Lett 16:87\u201399","journal-title":"Oper Res Lett"},{"key":"349_CR31","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.ejor.2003.04.004","volume":"164","author":"T Yang","year":"2005","unstructured":"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\u2013455","journal-title":"Eur J Oper Res"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0349-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-017-0349-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-017-0349-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T02:14:49Z","timestamp":1588040089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-017-0349-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,21]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["349"],"URL":"https:\/\/doi.org\/10.1007\/s12351-017-0349-y","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,21]]},"assertion":[{"value":"10 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2017","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2017","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}