{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T14:39:28Z","timestamp":1784731168173,"version":"3.55.0"},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"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":[[1999,7]]},"DOI":"10.1016\/s0377-2217(98)00023-x","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"156-170","source":"Crossref","is-referenced-by-count":228,"title":["A comparative study of dispatching rules in dynamic flowshops and jobshops"],"prefix":"10.1016","volume":"116","author":[{"given":"Chandrasekharan","family":"Rajendran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oliver","family":"Holthaus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00023-X_BIB1","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.1080\/00207549008942866","article-title":"Two new rules to minimize tardiness in a jobshop","volume":"28","author":"Anderson","year":"1990","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB2","unstructured":"Baker, K.R., 1974. Introduction to Sequencing and Scheduling. Wiley, New York"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/mnsc.6.3.311","article-title":"Simulation of a simplified job shop","volume":"6","author":"Baker","year":"1960","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB4","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(98)00023-X_BIB5","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(98)00023-X_BIB6","first-page":"221","article-title":"An experimental investigation of priority dispatching","volume":"11","author":"Conway","year":"1960","journal-title":"Journal of Industrial Engineering"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB7","first-page":"228","article-title":"Priority dispatching and job lateness in a job shop","volume":"16","author":"Conway","year":"1965","journal-title":"Journal of Industrial Engineering"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB8","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(98)00023-X_BIB9","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/nav.3800170103","article-title":"Review of sequencing research","volume":"17","author":"Day","year":"1970","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB10","unstructured":"French, S., 1982. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Ellis Horwood, Chichester, UK"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB11","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(98)00023-X_BIB12","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/0377-2217(93)E0353-Y","article-title":"Flowshop sequencing with mean flowtime objective","volume":"81","author":"Ho","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB13","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(98)00023-X_BIB14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0305-0483(92)90057-E","article-title":"Performance of priority rules in a due date flow shop","volume":"20","author":"Hunsucker","year":"1992","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB15","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0377-2217(94)90333-6","article-title":"Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment","volume":"72","author":"Hunsucker","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB16","doi-asserted-by":"crossref","unstructured":"Ignall, E., Schrage. L., 1965. Application of the branch-and-bound technique to some flowshop scheduling problems. Operations Research 13, 400\u2013412","DOI":"10.1287\/opre.13.3.400"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB17","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(98)00023-X_BIB18","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1287\/opre.32.6.1221","article-title":"Confidence intervals for steady-state simulations: I. A survey of fixed sample size procedures","volume":"32","author":"Law","year":"1984","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB19","doi-asserted-by":"crossref","unstructured":"Lorenzen, T.J., Anderson, V.L., 1993. Design of Experiments: A No-Name Approach, Marcel Dekker, New York","DOI":"10.1201\/9781482277524"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB20","unstructured":"Montgomery, D.C., 1991. Design and Analysis of Experiments, 3rd ed. Wiley, New York"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB21","doi-asserted-by":"crossref","unstructured":"Nawaz, M., Enscore, Jr., E.E., Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11, 91\u201395","DOI":"10.1016\/0305-0483(83)90088-9"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB22","unstructured":"Nanot, Y.R., 1963. An experimental investigation and comparative evaluation of priority disciplines in job-shop-like queueing networks. Research Report No. 87. Management Sciences Research Project, UCLA"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB23","unstructured":"Pinedo, M., 1995. Scheduling Theory, Algorithms and Systems, Prentice Hall, Englewood Cliffs, NJ"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB24","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0925-5273(93)90044-L","article-title":"An efficient dynamic dispatching rule for scheduling in a job shop","volume":"32","author":"Raghu","year":"1993","journal-title":"International Journal of Production Economics"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB25","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(98)00023-X_BIB26","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(98)00023-X_BIB27","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/00207547608956580","article-title":"A statistical comparison of the performance of simple dispatching rules for a particular set of job shops","volume":"14","author":"Rochette","year":"1976","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB28","doi-asserted-by":"crossref","unstructured":"Russell, R.S., Dar-el, E.M., Taylor III, B.W., 1987. A comparative analysis of the COVERT job sequencing rule using various shop performance measures. International Journal of Production Research 25, 1523\u20131540","DOI":"10.1080\/00207548708919930"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB29","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0272-6963(87)90018-0","article-title":"The use of cost-based priorities in random and flow shops","volume":"7","author":"Scudder","year":"1987","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB30","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/j.1540-5915.1996.tb01716.x","article-title":"Lot splitting in stochastic flow shop and job shop environments","volume":"27","author":"Smunt","year":"1996","journal-title":"Decision Sciences"},{"key":"10.1016\/S0377-2217(98)00023-X_BIB31","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","article-title":"Priority rules for job shops with weighted tardiness costs","volume":"33","author":"Vepsalainen","year":"1987","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179800023X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179800023X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T21:41:05Z","timestamp":1579038065000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179800023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S037722179800023X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00023-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}