A comparative study of dispatching rules in dynamic flowshops and jobshops
Authors:
- Chandrasekharan RajendranCRChandrasekharan Rajendran
- Oliver HolthausOHOliver Holthaus
- 1 July 1999
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 116 (1) , 156-170
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Lot Splitting in Stochastic Flow Shop and Job Shop EnvironmentsDecision Sciences, 1996
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteriaInternational Journal of Production Research, 1994
- Performance of priority rules in a due date flow shopOmega, 1992
- Two new rules to minimize tardiness in a job shopInternational Journal of Production Research, 1990
- Dynamic job shop scheduling: A survey of simulation researchOmega, 1990
- A survey of priority rule-based schedulingOR Spectrum, 1989
- A comparative analysis of the COVERT job sequencing rule using various shop performance measuresInternational Journal of Production Research, 1987
- The use of cost‐based priorities in random and flow shopsJournal of Operations Management, 1987
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- Review of sequencing researchNaval Research Logistics Quarterly, 1970