{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T10:47:15Z","timestamp":1773571635006,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1016\/s0377-2217(00)00105-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:54:50Z","timestamp":1027616090000},"page":"622-634","source":"Crossref","is-referenced-by-count":24,"title":["A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs"],"prefix":"10.1016","volume":"131","author":[{"given":"Chandrasekharan","family":"Rajendran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00105-3_BIB1","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","article-title":"A tabu search approach for the flow shop scheduling problem","volume":"109","author":"Ben-Daya","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207548208947745","article-title":"A state-of-the-art survey of dispatching rules for manufacturing job shop operations","volume":"20","author":"Blackstone","year":"1982","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB3","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n-job, m-machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB4","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","article-title":"An evaluation of flow-shop sequencing heuristics","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB5","first-page":"72","article-title":"Cellular manufacturing becomes philosophy of management at component facility","volume":"34","author":"Dumolien","year":"1983","journal-title":"Industrial Engineering"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","article-title":"Complexity of flowshop and jobshop scheduling","volume":"1","author":"Garey","year":"1976","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/00207547808930015","article-title":"Four simple heuristics for scheduling a flow-shop","volume":"16","author":"Gelders","year":"1978","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01721162","article-title":"A survey of priority rule-based scheduling","volume":"11","author":"Haupt","year":"1989","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB9","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/0377-2217(93)E0353-Y","article-title":"Flowshop sequencing with mean flow time objective","volume":"81","author":"Ho","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0925-5273(96)00068-0","article-title":"Efficient dispatching rules for scheduling in a job shop","volume":"48","author":"Holthaus","year":"1997","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB11","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/opre.13.3.400","article-title":"Application of the branch-and-bound technique to some flowshop scheduling problems","volume":"13","author":"Ignall","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB12","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0377-2217(93)E0235-P","article-title":"Modified simulated annealing algorithms for the flow shop sequencing problems","volume":"81","author":"Ishibuchi","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB14","doi-asserted-by":"crossref","first-page":"118","DOI":"10.15807\/jorsj.23.118","article-title":"Analysis for minimizing weighted mean flow-time in flow-shop scheduling","volume":"23","author":"Miyazaki","year":"1980","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.15807\/jorsj.21.287","article-title":"An adjacent pairwise approach to the mean flow-time scheduling problem","volume":"21","author":"Miyazaki","year":"1978","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flowshop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","article-title":"The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flowshop problem","volume":"17","author":"Ogbu","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB18","series-title":"Scheduling Theory, Algorithms and Systems","author":"Pinedo","year":"1995"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0925-5273(93)90024-F","article-title":"Heuristic algorithm for scheduling in a flowshop to minimize total flow time","volume":"29","author":"Rajendran","year":"1993","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB20","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1080\/00207549408957083","article-title":"A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria","volume":"32","author":"Rajendran","year":"1994","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0377-2217(96)00273-1","article-title":"An efficient heuristic for scheduling in a flowshop to minimize total weighted flow time of jobs","volume":"103","author":"Rajendran","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0305-0483(90)90017-4","article-title":"Dynamic job shop scheduling: A survey of simulation research","volume":"18","author":"Ramasesh","year":"1990","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB23","doi-asserted-by":"crossref","first-page":"2927","DOI":"10.1080\/00207549308956908","article-title":"Scheduling in a cellular manufacturing system \u2013 a simulated annealing approach","volume":"31","author":"Sridhar","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB24","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","article-title":"Some efficient heuristic methods for the flowshop sequencing problem","volume":"47","author":"Taillard","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(00)00105-3_BIB25","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","article-title":"A new heuristic method for the flowshop sequencing problem","volume":"41","author":"Widmer","year":"1989","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700001053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T19:56:02Z","timestamp":1555790162000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700001053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0377221700001053"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00105-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}