A methodology for schedule compression
Authors:
- 1 July 1996
- journal article
- research article
- Published by Taylor & Francis in Production Planning & Control
- Vol. 7 (4) , 407-417
Abstract
A generated schedule can be improved (especially on due date performance) simply by compressing the current schedule to the left. Additionally, two forms of schedule compression are available, i.e. simple compression and complex compression. In practical considerations, however, knowing exacdy where the compression eifort should be placed so that the schedule can be improved more efficiendy is a relatively difficult task. This decision requires an evaluation methodology, which is the primary objective of this study. The evaluation methodology is based on the priority weight computation for those affected operations. The priority weight computation is an integration of sequence effect weight with time effect weight. The priority weight information provides not only where the compression effort should be placed but also the intelligent information of (1) the operations related to the compression effort and (2) the time that job(s) can be packed to the left. Specifics of the schedule compression concepts and algorithms of the evaluation methodology are also discussed.Keywords
This publication has 11 references indexed in Scilit:
- Intelligent dispatching for flexible manufacturingInternational Journal of Production Research, 1991
- Knowledge-based approaches for scheduling problems: a surveyIEEE Transactions on Knowledge and Data Engineering, 1991
- Scheduling approaches for random job shop flexible manufacturing systemsInternational Journal of Production Research, 1991
- Flowshop scheduling with set-up, processing and removal times separatedInternational Journal of Production Research, 1991
- Optimal Dispatching in a Periodic Review Cellular Manufacturing SystemOperations Research, 1990
- A pattern-directed approach to FMS schedulingAnnals of Operations Research, 1988
- A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling ProblemOperations Research, 1988
- A state-of-the-art survey of dispatching rules for manufacturing job shop operationsInternational Journal of Production Research, 1982
- Heuristics and their design: a surveyEuropean Journal of Operational Research, 1981
- The design and analysis of heuristicsNetworks, 1981