{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:56:08Z","timestamp":1777607768218,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T00:00:00Z","timestamp":1403049600000},"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":["Optim Lett"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11590-014-0761-7","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T12:44:52Z","timestamp":1403181892000},"page":"465-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags"],"prefix":"10.1007","volume":"9","author":[{"given":"Imen","family":"Hamdi","sequence":"first","affiliation":[]},{"given":"Ta\u00efcir","family":"Loukil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,18]]},"reference":[{"key":"761_CR1","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/70.544767","volume":"12","author":"C Chu","year":"1996","unstructured":"Chu, C., Proth, J.M.: Single machine scheduling with chain structured precedence constraints and separation time windows. IEEE Trans. Robot. Autom. 12, 835\u2013844 (1996)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"761_CR2","doi-asserted-by":"crossref","unstructured":"Coban, E., Hooker, J.N.: Single-facility scheduling over long time horizons by logic-based benders decomposition. In: Proceedings of CPAIOR, pp. 87\u201391 (2010)","DOI":"10.1007\/978-3-642-13520-0_11"},{"key":"761_CR3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0377-2217(99)00164-2","volume":"120","author":"FD Croce","year":"2000","unstructured":"Croce, F.D., Gupta, G.N.D., Tadei, R.: Minimizing tardy jobs in a flowshop with common due date. Eur. J. Oper. Res. 120, 375\u201381 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"761_CR4","unstructured":"Deppner, F.: Ordonnancement d\u2019atelier avec contraintes temporelles entre operations. Ph.D. Thesis, Institut National Polytechnique de Lorraine (in French) (2004)"},{"key":"761_CR5","first-page":"85","volume":"12","author":"E Dhouib","year":"2013","unstructured":"Dhouib, E., Teghem, J., Loukil, T.: Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints. J. Math. Model. Algorith. Oper. Res. 12, 85\u201399 (2013)","journal-title":"J. Math. Model. Algorith. Oper. Res."},{"key":"761_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, M.C.: Permutation flowshop scheduling problems with maximal and minimal time lags. Comput. Oper. Res. 33, 1540\u20131556 (2006)","journal-title":"Comput. Oper. Res."},{"key":"761_CR7","first-page":"156","volume":"4","author":"TF Ghassemi","year":"2010","unstructured":"Ghassemi, T.F., Olfat, L.: A set of algorithms for solving the generalized tardiness flowshop problems. J. Ind. Syst. Eng. 4, 156\u2013166 (2010)","journal-title":"J. Ind. Syst. Eng."},{"key":"761_CR8","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, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"761_CR9","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0377-2217(89)90108-2","volume":"38","author":"AMA Hariri","year":"1989","unstructured":"Hariri, A.M.A., Potts, C.N.: A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop. Eur. J. Oper. Res. 38, 228\u2013237 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"761_CR10","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1016\/S0098-1354(02)00100-X","volume":"26","author":"I Harjunkoski","year":"2002","unstructured":"Harjunkoski, I., Grossmann, I.E.: Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput. Chem. Eng. 26, 1533\u20131552 (2002)","journal-title":"Comput. Chem. Eng."},{"key":"761_CR11","first-page":"267","volume-title":"Principles and Practice of Constraint Programming: The Newport Papers","author":"JN Hooker","year":"1995","unstructured":"Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Saraswat, V., Van Hentenryck, P. (eds.) Principles and Practice of Constraint Programming: The Newport Papers, pp. 267\u2013288. MIT Press, Cambridge (1995)"},{"key":"761_CR12","unstructured":"Hooker, J.N.: Logic-based Benders decomposition. Carnegie-Mellon University, Technical report (1995)"},{"key":"761_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-540-30201-8_24","volume-title":"Principles and Practice of Constraint Programming","author":"JN Hooker","year":"2004","unstructured":"Hooker, J.N.: A hybrid method for planning and scheduling. In: Wallace, M. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 3258, pp. 305\u2013316. Springer, Berlin (2004)"},{"key":"761_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/11564751_25","volume-title":"Principles and Practice of Constraint Programming","author":"JN Hooker","year":"2005","unstructured":"Hooker, J.N.: Planning and scheduling to minimize tardiness. In: van Beek, P. (ed.) Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 3709, pp. 314\u2013327. Springer, Berlin (2005)"},{"key":"761_CR15","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"JN Hooker","year":"2007","unstructured":"Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Oper. Res. 55, 588\u2013602 (2007)","journal-title":"Oper. Res."},{"key":"761_CR16","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.E.: Algorithms for hybrid milp\/cp models for a class of optimization problems. INFORMS J. Comput. 13, 258\u2013276 (2001)","journal-title":"INFORMS J. Comput."},{"key":"761_CR17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"761_CR18","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0377-2217(03)00404-1","volume":"159","author":"E Lodree","year":"2004","unstructured":"Lodree, E., Jang, W., Klein, C.M.A.: New rule for minimizing the nu\u0131mber of tardy jobs in dynamic flowshops. Eur. J. Oper. Res. 159, 258\u2013263 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"761_CR19","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J.M.: An n job one machine algorithm for minimizing the number of late jobs. Manage. Sci. 15, 102\u2013109 (1968)","journal-title":"Manage. Sci."},{"key":"761_CR20","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2009.04.018","volume":"37","author":"AJ Ruiz-Torres","year":"2010","unstructured":"Ruiz-Torres, A.J., Ablanedo-Rosasb, J.H., Johnny, C.H.: Minimizing the number of tardy jobs in the flow shop problem with operation and resource flexibility. Comput. Oper. Res. 37, 282\u2013291 (2010)","journal-title":"Comput. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0761-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0761-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0761-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T18:30:26Z","timestamp":1565548226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0761-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,18]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["761"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0761-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,18]]}}}