{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:03:25Z","timestamp":1777608205310,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T00:00:00Z","timestamp":1518393600000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10479-018-2775-5","type":"journal-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T13:28:07Z","timestamp":1518442087000},"page":"101-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic"],"prefix":"10.1007","volume":"267","author":[{"given":"E.","family":"Dhouib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Teghem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Loukil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,12]]},"reference":[{"issue":"2","key":"2775_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.engappai.2010.07.008","volume":"24","author":"C Artigues","year":"2011","unstructured":"Artigues, C., Huguet, M.-J., & Lopez, P. (2011). Generalized disjunctive constraint propagation for solving the job shop with time lags. Engineering Applications of Artificial Intelligence, 24(2), 211\u2013230.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2775_CR2","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.cor.2015.08.001","volume":"66","author":"J Benavides","year":"2016","unstructured":"Benavides, J., & Ritt, M. (2016). Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops. Computers & Operations Research, 66, 160\u2013169.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2775_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10288-005-0069-7","volume":"4","author":"JL Bouquard","year":"2006","unstructured":"Bouquard, J. L., & Lent\u00e9, C. (2006). Two-machine flow shop scheduling problems with minimal and maximal delays. 4OR, 4(1), 15\u201328.","journal-title":"4OR"},{"key":"2775_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1023\/B:ANOR.0000030683.64615.c8","volume":"129","author":"P Brucker","year":"2004","unstructured":"Brucker, P., Knust, S., Cheng, T. C. E., & Shakhlevich, N. V. (2004). Complexity results for flowshop and open shop scheduling problems with transportation delays. Annals of Operations Research, 129, 81\u2013106.","journal-title":"Annals of Operations Research"},{"issue":"7","key":"2775_CR5","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1016\/j.cor.2006.11.007","volume":"35","author":"A Caumond","year":"2008","unstructured":"Caumond, A., Lacomme, P., & Tchernev, N. (2008). A memetic algorithm for the job-shop with time lags. Computers & Operations Research, 35(7), 2331\u20132356.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"2775_CR6","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/70.544767","volume":"12","author":"C Chu","year":"1996","unstructured":"Chu, C., & Proth, J.-M. (1996). Single machine scheduling with chain structured precedence constraints and separation time windows. IEEE Transactions on Robotics and Automation, 12(6), 835\u2013844.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"5","key":"2775_CR7","doi-asserted-by":"publisher","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. Operations Research, 44(5), 777\u2013787.","journal-title":"Operations Research"},{"key":"2775_CR8","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol, E., Mehta, S., & Uzsoy, R. (1998). Benchmarks for shop scheduling problems. European Journal of Operational Research, 109, 137\u2013141.","journal-title":"European Journal of Operational Research"},{"key":"2775_CR9","unstructured":"Deppner, F. (2004). Ordonnancement d\u2019atelier avec contraintes temporelles entre op\u00e9rations. Phd thesis, Institut National Polytechnique de Lorraine, France"},{"key":"2775_CR10","unstructured":"Dhouib, E., Teghem, J., Tuyttens, D., & Loukil, T. (2013). Metaheuristic for Production Scheduling 1. In B. Jarboui, P. Siarry, & J. Teghem (Eds.), Chapter comparison of local search metaheuristics for a hierarchical flow shop optimization problem with time lags. New York: Wiley & ISTE."},{"issue":"2","key":"2775_CR11","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1111\/j.1475-3995.2012.00876.x","volume":"20","author":"E Dhouib","year":"2013","unstructured":"Dhouib, E., Teghem, J., & Loukil, T. (2013). Lexicographic optimization of a permutation flowshop with time lag constraints. International Transactions in Operational Research, 20(2), 213\u2013232.","journal-title":"International Transactions in Operational Research"},{"key":"2775_CR12","unstructured":"Dhouib, E. (2013). Exact and metaheuristic methods to solve flowshop scheduling problems with time lags. Phd thesis, Facult\u00e9 des Sciences Economiques et de Gestion de Sfax, Tunisie\u2013Univerit\u00e9 de Mons, Belgique."},{"issue":"6","key":"2775_CR13","doi-asserted-by":"publisher","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. (2006). Permutation flowshop scheduling problems with maximal and minimal time lags. Computers and Operations Research, 33(6), 1540\u20131556.","journal-title":"Computers and Operations Research"},{"key":"2775_CR14","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.ijpe.2006.08.018","volume":"112","author":"J Fondrevelle","year":"2008","unstructured":"Fondrevelle, J., Oulamara, A., & Portmann, M.-C. (2008). Permutation flowshop scheduling problems with time lags to minimize the weighted sum of machine completion times. International Journal of Production Economics, 112, 168\u2013176.","journal-title":"International Journal of Production Economics"},{"key":"2775_CR15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.cor.2015.02.005","volume":"60","author":"MA Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez, M. A., Oddi, A., Rasconi, R., & Valera, R. (2015). Scatter search with path relinking for the job shop with time lags and setup times. Computers and Operations Research, 60, 37\u201354.","journal-title":"Computers and Operations Research"},{"key":"2775_CR16","doi-asserted-by":"crossref","unstructured":"Grimes, D., & Hebrard, E. (2011). Models and strategies for variants of the job shop scheduling problem. Lecture Notes in Computer Science, (Vol. 6876, pp. 356\u2013372). Berlin: Springer.","DOI":"10.1007\/978-3-642-23786-7_28"},{"key":"2775_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0305-0548(00)00061-7","volume":"29","author":"JND Gupta","year":"2002","unstructured":"Gupta, J. N. D., Hennig, K., & Werner, F. (2002). Local search heuristics for two-stage flow shop problems with secondary criterion. Computers and Operations Research, 29, 123\u2013149.","journal-title":"Computers and Operations Research"},{"key":"2775_CR18","doi-asserted-by":"publisher","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. (1989). A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop. European Journal of Operational Research, 38, 228\u2013237.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2775_CR19","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s11590-014-0761-7","volume":"19","author":"I Hamdi","year":"2015","unstructured":"Hamdi, I., & Loukil, T. (2015). Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags. Optimization Letters, 19(3), 465\u2013482.","journal-title":"Optimization Letters"},{"issue":"4","key":"2775_CR20","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1504\/IJOR.2015.070142","volume":"23","author":"I Hamdi","year":"2015","unstructured":"Hamdi, I., Oulamara, A., & Loukil, T. (2015). A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags. International Journal of Operational Research, 23(4), 387\u2013405.","journal-title":"International Journal of Operational Research"},{"issue":"10","key":"2775_CR21","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1057\/jors.1985.160","volume":"36","author":"A Hodson","year":"1985","unstructured":"Hodson, A., Muhlemann, A. P., & Price, D. H. R. (1985). A microcomputer based solution to a practical scheduling problem. Journal of Operational Research Society, 36(10), 903\u2013914.","journal-title":"Journal of Operational Research Society"},{"key":"2775_CR22","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.amc.2010.05.089","volume":"217","author":"L-M Liao","year":"2010","unstructured":"Liao, L.-M., & Huang, C.-J. (2010). Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness. Applied Mathematics and Computation, 217, 557\u2013567.","journal-title":"Applied Mathematics and Computation"},{"key":"2775_CR23","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/j.ijpe.2011.11.011","volume":"135","author":"Y Mehravaran","year":"2012","unstructured":"Mehravaran, Y., & Logendran, R. (2012). Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times. International Journal of Production Economics, 135, 953\u2013963.","journal-title":"International Journal of Production Economics"},{"key":"2775_CR24","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0377-2217(93)E0140-S","volume":"81","author":"A Nagar","year":"1995","unstructured":"Nagar, A., Haddock, J., & Heragu, S. (1995). Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research, 81, 88\u2013104.","journal-title":"European Journal of Operational Research"},{"key":"2775_CR25","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","volume":"95","author":"VR Neppalli","year":"1996","unstructured":"Neppalli, V. R., Chen, C. L., & Gupta, J. N. D. (1996). Genetic algorithms for the two-stage bicriteria flowshop problem. European Journal of Operational Research, 95, 356\u2013373.","journal-title":"European Journal of Operational Research"},{"key":"2775_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0167-6377(91)90014-G","volume":"10","author":"CN Potts","year":"1991","unstructured":"Potts, C. N., Shmoys, D. B., & Williamson, D. P. (1991). Permutation vs. non-permutation flow shop schedules. Operations Research Letters, 10, 281\u2013284.","journal-title":"Operations Research Letters"},{"key":"2775_CR27","first-page":"820","volume":"23","author":"S Pugazhendhi","year":"2004","unstructured":"Pugazhendhi, S., Thiagarajan, S., Rajendran, C., & Anantharaman, N. (2004). Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective. International Journal of Advanced Manufacturing Technology, 23, 820\u2013830.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2775_CR28","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1057\/jors.1992.126","volume":"43","author":"C Rajendran","year":"1992","unstructured":"Rajendran, C. (1992). Two-stage flowshop scheduling problem with bicriteria. Journal of the Operational Research Society, 43, 871\u2013884.","journal-title":"Journal of the Operational Research Society"},{"key":"2775_CR29","doi-asserted-by":"publisher","first-page":"3328","DOI":"10.1016\/j.eswa.2012.12.041","volume":"40","author":"A Rossi","year":"2013","unstructured":"Rossi, A., & Lanzetta, M. (2013). Scheduling flow lines with buffers by ant colony digraph. Expert Systems with Applications, 40, 3328\u20133340.","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"2775_CR30","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1007\/s10845-012-0724-8","volume":"25","author":"A Rossi","year":"2014","unstructured":"Rossi, A., & Lanzetta, M. (2014). Native metaheuristics for non-permutation flowshop scheduling. Journal of Intellingent Manufacturing, 25(6), 1221\u20131233.","journal-title":"Journal of Intellingent Manufacturing"},{"key":"2775_CR31","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278\u2013285.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"2775_CR32","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1016\/0098-1354(91)80014-M","volume":"15","author":"M Tandon","year":"1991","unstructured":"Tandon, M., Cummings, P. T., & Levan, M. D. (1991). Flowshop sequencing with non-permutation schedules. Computers and Chemical Engineering, 15(8), 601\u2013607.","journal-title":"Computers and Chemical Engineering"},{"key":"2775_CR33","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1051\/ro:2001109","volume":"35","author":"V T\u2019Kindt","year":"2001","unstructured":"T\u2019Kindt, V., & Billaut, J.-C. (2001). Multicriteria scheduling problems: A survey. RAIRO\/Operations Research, 35, 143\u2013163.","journal-title":"RAIRO\/Operations Research"},{"key":"2775_CR34","volume-title":"Multicriteria scheduling","author":"V T\u2019Kindt","year":"2006","unstructured":"T\u2019Kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"2775_CR35","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0305-0548(02)00021-7","volume":"30","author":"V T\u2019Kindt","year":"2003","unstructured":"T\u2019Kindt, V., Gupta, J. N. D., & Billaut, J.-C. (2003). Two-machine flowshop scheduling with a secondary criterion. Computers and Operations Research, 30, 505\u2013526.","journal-title":"Computers and Operations Research"},{"key":"2775_CR36","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jmsy.2012.08.001","volume":"32","author":"B Vahedi-Nouria","year":"2013","unstructured":"Vahedi-Nouria, B., Fattahia, P., & Ramezanianb, R. (2013). Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints. Journal of Manufacturing Systems, 32, 167\u2013173.","journal-title":"Journal of Manufacturing Systems"},{"issue":"1","key":"2775_CR37","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0360-8352(94)00026-J","volume":"28","author":"DL Yang","year":"1995","unstructured":"Yang, D. L., & Chern, M. S. (1995). A two-machine flowshop sequencing problem with limited waiting time constraints. Computers and Industrial Engineering, 28(1), 63\u201370.","journal-title":"Computers and Industrial Engineering"},{"key":"2775_CR38","unstructured":"Yu, W. (1996). The two-machine flow shop problem with delays and the one-machine total tardiness problem. Phd thesis, Technische Universiteit, Eindhoven."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2775-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2775-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2775-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T01:54:31Z","timestamp":1549936471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2775-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,12]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["2775"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2775-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,12]]},"assertion":[{"value":"12 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}