{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T12:23:53Z","timestamp":1769257433529,"version":"3.49.0"},"reference-count":20,"publisher":"EDP Sciences","issue":"5","license":[{"start":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T00:00:00Z","timestamp":1757030400000},"content-version":"vor","delay-in-days":4,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2025,7,25]]},"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:p>This paper deals with job shop scheduling problem (JSS) where both blocking and no-wait constraints (BNW) are considered. The blocking constraints are linked to storage capacity constraints. They appear when job completed by a machine and must be stored on this machine as long as the next machine that will process it is occupied by another job. The no-wait constraints, for their part, occur when a job must be processed continuously on different machines without any interruption between operations. The objective is to find a feasible order of operations on machines that minimizes total tardiness under blocking and no-wait constraints. To our knowledge, no study has treated this problem in the literature. To tackle this NP-hard problem, we propose, based on the mathematical model given by Lange and Werner [<jats:italic>J. Sched<\/jats:italic>. 21 (2018) 191\u2013207], to solve the blocking and no-wait (BNW) job shop scheduling problem. The BNW-JSS problem is formalized as a mixed-integer linear programming model (MILP). Several numerical experiments were performed using the CPLEX solver on the classical benchmark instances of Lawrence. This allowed us to assess the effectiveness of our model on the one hand and to report results for the BNW-JSS problem on the other hand.<\/jats:p>","DOI":"10.1051\/ro\/2025109","type":"journal-article","created":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T18:44:55Z","timestamp":1753814695000},"page":"2545-2558","source":"Crossref","is-referenced-by-count":1,"title":["A MILP model to minimize total tardiness in a job shop scheduling problem with blocking and no-wait constraints"],"prefix":"10.1051","volume":"59","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8523-6498","authenticated-orcid":false,"given":"Zineb","family":"Lissioued","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7851-6491","authenticated-orcid":false,"given":"Samia","family":"Ourari","sequence":"additional","affiliation":[]},{"given":"Hac\u00e8ne","family":"Ait Haddad\u00e8ne","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2025,9,5]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Pinedo M.L., Scheduling: Theory, Algorithms, and Systems, 4th edition. Springer, New York, USA (2012).","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"R2","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"Jain","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0377-2217(01)00338-1","volume":"143","author":"Mascis","year":"2002","journal-title":"Eur. J. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10951-017-0526-0","volume":"21","author":"Lange","year":"2018","journal-title":"J. Sched."},{"key":"R5","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"Hall","year":"1996","journal-title":"Oper. Res."},{"key":"R6","unstructured":"Candar O., Machine scheduling problems with blocking and no-wait in process. Working Paper, Department of Industrial Engineering, Bilkent University, Ankara, Turkey (1999)."},{"key":"R7","unstructured":"Roy B. and Sussman B., Les Probl\u00e8\u2018mes d\u2019ordonnancement AVEC contraintes disjonctives. Technical report, SEMA, Paris, France (1964)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Brizuela C.A., Zhao Y. and Sannomiya N., No-wait and blocking job-shops: challenging problems for GAs, in IEEE International Conference on Systems, Man and Cybernetics. Vol. 5. Tucson (2001) 2349\u20132354.","DOI":"10.1109\/ICSMC.2001.972908"},{"key":"R9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1023\/B:ANOR.0000039520.24932.4b","volume":"131","author":"Meloni","year":"2004","journal-title":"Ann. Oper. Res."},{"key":"R10","unstructured":"Van den Broek J.J.J. and Hurkens C.A.J., A new heuristic for job shops with no-wait and blocking constraints. Algorithms for Robust and Online Railway Optimization: Improving the Validity and Reliability of Large Scale Systems. ARRIVAL-TR. Vol. 0112 (2007)."},{"key":"R11","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/trsc.1100.0332","volume":"45","author":"Liu","year":"2010","journal-title":"Transp. Sci."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Oddi A., Rasconi R., Cesta A. and Smith S.F., Iterative improvement algorithms for the blocking job shop, in Proceedings of the 22nd International Conference on Automated Planning and Scheduling (2012) 199\u2013206.","DOI":"10.1609\/icaps.v22i1.13530"},{"key":"R13","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-014-9279-5","volume":"22","author":"Pranzo","year":"2015","journal-title":"J. Heuristics"},{"key":"R14","doi-asserted-by":"crossref","first-page":"2015","DOI":"10.3934\/jimo.2017029","volume":"13","author":"Dabah","year":"2016","journal-title":"J. Ind. Manag. Optim."},{"key":"R15","doi-asserted-by":"crossref","first-page":"13283","DOI":"10.1007\/s00500-019-03871-1","volume":"23","author":"Dabah","year":"2019","journal-title":"Soft Comput."},{"key":"R16","unstructured":"Dauz\u00e8re P.S., Pavageau C. and Sauer N., Mod\u00e9lisation et r\u00e9solution par PLNE d\u2019un probl\u00e8me r\u00e9el d\u2019ordonnancement avec contraintes de blocage, in 3\u00e8me congr\u00e8s ROADEF Nantes (2000) 216\u2013217."},{"key":"R17","unstructured":"Martinez S., Ordonnancement de syst\u00e8mes de production avec contraintes de blocage. Th\u00e8se, Universit\u00e9 de Nantes (2005)."},{"key":"R18","unstructured":"Trabelsi W., Sauvey C. and Sauer N., Heuristic methods for problems with blocking constraints solving job shop scheduling, in 8th International Conference of Modeling and Simulation, Evaluation and Optimization of Innovative Production Systems of Goods and Services. Hammamet, Tunisia (2010)."},{"key":"R19","unstructured":"Lawrence S., Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques. Graduate School of Industrial Administration, Carnegie Mellon University (1984)."},{"key":"R20","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025109\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T07:58:35Z","timestamp":1757059115000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":20,"journal-issue":{"issue":"5"},"alternative-id":["ro240845"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2025109","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]}}}