{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T23:52:32Z","timestamp":1774482752104,"version":"3.50.1"},"reference-count":40,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1016\/s0377-2217(01)00338-1","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T15:24:03Z","timestamp":1034004243000},"page":"498-517","source":"Crossref","is-referenced-by-count":372,"title":["Job-shop scheduling with blocking and no-wait constraints"],"prefix":"10.1016","volume":"143","author":[{"given":"Alessandro","family":"Mascis","sequence":"first","affiliation":[]},{"given":"Dario","family":"Pacciarelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0377-2217(01)00338-1_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB2","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/S0191-2615(98)00041-1","article-title":"On-line timetable re-scheduling in regional train services","volume":"33","author":"Adenso-D\u0131\u0301az","year":"1999","journal-title":"Transportation Research Part B"},{"issue":"2","key":"10.1016\/S0377-2217(01)00338-1_BIB3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job shop scheduling problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB4","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1002\/net.3230200705","article-title":"Predicting deadlock in store-and-forward networks","volume":"20","author":"Arbib","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-218X(98)00148-6","article-title":"A three-dimensional matching model for perishable production scheduling","volume":"92","author":"Arbib","year":"1999","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB6","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","article-title":"Machine sequencing via disjunctive graphs: An implicit enumeration approach","volume":"17","author":"Balas","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","article-title":"Disjunctive programming","volume":"5","author":"Balas","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0166-218X(94)90204-6","article-title":"A branch and bound algorithm for the job-shop scheduling problem","volume":"49","author":"Brucker","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB9","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1080\/07408179808966488","article-title":"Greedy heuristics for rapid scheduling of trains on a single track","volume":"30","author":"Cai","year":"1998","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one-machine sequencing problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(01)00338-1_BIB11","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB12","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson's preemptive schedule for solving the job-shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustment of heads and tails for the job-shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00338-1_BIB14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","article-title":"A genetic algorithm for the job-shop problem","volume":"22","author":"Della Croce","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying taboo search to the job-shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00338-1_BIB16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/64.482954","article-title":"Scheduling high-grade steelmaking","volume":"11","author":"Dorn","year":"1996","journal-title":"IEEE Expert"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB17","series-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop","author":"French","year":"1982"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB18","series-title":"Operations Research Proceedings 1996 (Braunschweig)","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/978-3-642-60744-8_35","article-title":"Scheduling in production of concrete wares","author":"Grabowski","year":"1997"},{"issue":"3","key":"10.1016\/S0377-2217(01)00338-1_BIB19","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","article-title":"A survey on machine scheduling problems with blocking and no-wait in process","volume":"44","author":"Hall","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB20","first-page":"203","article-title":"An efficient algorithm for a job shop problem","volume":"1","author":"Kubiak","year":"1996","journal-title":"Mathematical Industrial Systems"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB21","series-title":"Supplement to Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques","author":"Lawrence","year":"1984"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB22","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/S0377-2217(99)00041-7","article-title":"A mathematical programming model for scheduling steelmaking-continuous casting production","volume":"120","author":"Lixin","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB23","series-title":"Integer and Combinatorial Optimization, Vancouver, B.C., 1996, pp. 389\u2013403","first-page":"389","article-title":"A new approach to compute optimal schedules for the job shop scheduling problem","volume":"vol. 1084","author":"Martin","year":"1996"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB24","unstructured":"A. Mascis, D. Pacciarelli, Machine scheduling via alternative graphs, Report DIA-46-2000, Dipartimento di Informatica e Automazione, Universit\u00e0 Roma Tre, Roma, Italy, 2000"},{"issue":"6","key":"10.1016\/S0377-2217(01)00338-1_BIB25","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1287\/opre.37.6.925","article-title":"Sequencing in an assembly line with blocking to minimize cycle time","volume":"37","author":"Mc Cormick","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB26","series-title":"Industrial Scheduling","year":"1963"},{"issue":"4","key":"10.1016\/S0377-2217(01)00338-1_BIB27","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.30.4.680","article-title":"Perishable inventory theory: A review","volume":"30","author":"Nahmias","year":"1982","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00338-1_BIB28","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(98)00017-4","article-title":"The permutation flow shop with buffers: A tabu search approach","volume":"116","author":"Nowicki","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/S0377-2217(01)00338-1_BIB29","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","article-title":"A fast taboo search algorithm for the job shop scheduling problem","volume":"42","author":"Nowicki","year":"1996","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB30","series-title":"Decomposition Methods for Complex Factory Scheduling Problems","author":"Ovacik","year":"1997"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB31","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/322203.322213","article-title":"Flowshop scheduling with limited temporary storage","volume":"27","author":"Papadimitriou","year":"1980","journal-title":"Journal of Associated Computer Machinery"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB32","series-title":"Scheduling \u2013 Theory, Algorithms and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB33","series-title":"Scheduling Theory and Its Applications","first-page":"277","article-title":"The job shop scheduling problem: A concise survey and some recent developments","author":"Pinson","year":"1997"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB34","first-page":"119","article-title":"Review of scheduling of process operations","volume":"78","author":"Reklaitis","year":"1982","journal-title":"AIChE Symposium Series"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB35","unstructured":"B. Roy, B. Sussman, Les probl\u00e8m d'ordonnancement avec contraintes disjonctives. Note DS No. 9 bis, SEMA, Paris, 1964"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB36","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/S0191-2615(99)00004-1","article-title":"Railway traffic control and train scheduling based on inter-train conflict management","volume":"33","author":"\u015eahin","year":"1999","journal-title":"Transportation Research Part B"},{"issue":"4","key":"10.1016\/S0377-2217(01)00338-1_BIB37","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/ijoc.7.4.453","article-title":"Problem and heuristic space search strategies for job shop scheduling","volume":"7","author":"Storer","year":"1995","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB38","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","article-title":"Parallel tabu search technique for the job shop scheduling problem","volume":"6","author":"Taillard","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB39","first-page":"46","article-title":"On the complexity of scheduling an arbitrary system","volume":"5","author":"Timkovsky","year":"1985","journal-title":"Soviet Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(01)00338-1_BIB40","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job shop scheduling by simulated annealing","volume":"40","author":"van Laarhoven","year":"1992","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003381?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003381?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T19:16:40Z","timestamp":1578424600000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701003381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0377221701003381"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00338-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}