{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:03:21Z","timestamp":1777608201541,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T00:00:00Z","timestamp":1418083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s12351-014-0166-5","type":"journal-article","created":{"date-parts":[[2014,12,8]],"date-time":"2014-12-08T09:21:30Z","timestamp":1418030490000},"page":"95-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Minimizing total tardiness in the permutation flowshop scheduling problem with minimal and maximal time lags"],"prefix":"10.1007","volume":"15","author":[{"given":"Imen","family":"Hamdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taicir","family":"Loukil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,9]]},"reference":[{"key":"166_CR1","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"key":"166_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1002\/nav.20000","volume":"51","author":"K Bulbul","year":"2004","unstructured":"Bulbul K, Kaminsky P, Yano C (2004) Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. Nav Res Logist 51:407\u2013445","journal-title":"Nav Res Logist"},{"key":"166_CR3","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/70.544767","volume":"12","author":"C Chu","year":"1996","unstructured":"Chu C, Proth JM (1996) Single machine scheduling with chain structured precedence constraints and separation time windows. IEEE Trans Robot Autom 12:835\u2013844","journal-title":"IEEE Trans Robot Autom"},{"key":"166_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/70.282535","volume":"10","author":"CS Czerwinski","year":"1994","unstructured":"Czerwinski CS, Luh PB (1994) Scheduling products with bills of materials using an improved Lagrangian relaxation technique. IEEE Trans Robot Autom 10:99\u2013111","journal-title":"IEEE Trans Robot Autom"},{"key":"166_CR5","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1287\/opre.44.5.777","volume":"44","author":"M Dell\u2019Amico","year":"1996","unstructured":"Dell\u2019Amico M (1996) Shop problems with two machines and time lags. J Oper Res 44:777\u2013787","journal-title":"J Oper Res"},{"key":"166_CR6","doi-asserted-by":"crossref","first-page":"1540","DOI":"10.1016\/j.cor.2004.11.006","volume":"33","author":"J Fondrevelle","year":"2006","unstructured":"Fondrevelle J, Oulamara A, Portmann MC (2006) Permutation flowshop scheduling problems with maximal and minimal time lags. Comput Oper Res 33:1540\u20131556","journal-title":"Comput Oper Res"},{"key":"166_CR7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.jfoodeng.2003.12.009","volume":"70","author":"LR Foulds","year":"2005","unstructured":"Foulds LR, Wilson JM (2005) Scheduling operations for the harvesting of renewable resources. J Food Eng 70:281\u2013292","journal-title":"J Food Eng"},{"key":"166_CR8","first-page":"156","volume":"4","author":"TF Ghassemi","year":"2010","unstructured":"Ghassemi TF, Olfat LA (2010) A set of algorithms for solving the generalized tardiness flowshop problems. J Ind Syst Eng 4:156\u2013166","journal-title":"J Ind Syst Eng"},{"key":"166_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham R, Lawler E, 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":"166_CR10","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1287\/opre.42.6.1025","volume":"42","author":"C Koulamas","year":"1994","unstructured":"Koulamas C (1994) The total tardiness problem: review and extensions. Oper Res 42:1025\u20131041","journal-title":"Oper Res"},{"key":"166_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018970020599","volume":"70","author":"G Liu","year":"1997","unstructured":"Liu G, Luh PB, Resch R (1997) Scheduling permutation flowshops using the lagrangian relaxation technique. Ann Oper Res 70:171\u2013189","journal-title":"Ann Oper Res"},{"key":"166_CR12","first-page":"1066","volume":"38","author":"PB Luh","year":"1993","unstructured":"Luh PB, Hoitomt DJ (1993) Scheduling of manufacturing systems using the Lagrangian relaxation technique. IEEE Xplore 38:1066\u20131080","journal-title":"IEEE Xplore"},{"key":"166_CR13","unstructured":"Nishi T, Isoya Y, Inuiguchi M (2009) An integrated column generation and lagrangian relaxation for flowshop scheduling problems: systems, man and cybernetics. SMC. IEEE international conference. pp 11\u201314"},{"key":"166_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.cor.2009.04.008","volume":"37","author":"T Nishi","year":"2010","unstructured":"Nishi T, Hiranakaa Y, Inuiguchi M (2010) Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Comput Oper Res 37:189\u2013198","journal-title":"Comput Oper Res"},{"key":"166_CR15","doi-asserted-by":"crossref","first-page":"4778","DOI":"10.1080\/00207543.2013.774469","volume":"51","author":"T Nishi","year":"2013","unstructured":"Nishi T, Hiranakaa Y (2013) Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness. Int J Product Res 51:4778\u20134796","journal-title":"Int J Product Res"},{"key":"166_CR16","volume-title":"Scheduling theory, algorithms, and systems","author":"M Pinedo","year":"1995","unstructured":"Pinedo M (1995) Scheduling theory, algorithms, and systems. Prentice Hall, Upper Saddle River, New Jersey"},{"key":"166_CR17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1023\/B:JOSH.0000036858.59787.c2","volume":"7","author":"W Yu","year":"2004","unstructured":"Yu W, Hoogeveen H, Lenstra JK (2004) Minimising makespan in a two machine flowshop with delays and unit time operations is NP-hard. J Sched 7:333\u2013348","journal-title":"J Sched"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-014-0166-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-014-0166-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-014-0166-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T04:04:36Z","timestamp":1559448276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-014-0166-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,9]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["166"],"URL":"https:\/\/doi.org\/10.1007\/s12351-014-0166-5","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,9]]}}}