An efficient scheduling algorithm for the hot coil making in the steel mini-mill
Authors:
- Hyungwoo ParkHPHyungwoo Park
- Yushin HongYHYushin Hong
- Soo Young ChangSCSoo Young Chang
- 1 January 2002
- journal article
- Published by Taylor & Francis in Production Planning & Control
- Vol. 13 (3) , 298-306
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Steel production schedule generationInternational Journal of Production Research, 1997
- Analysis of a Hybrid Algorithm for Packing Unequal BinsSIAM Journal on Computing, 1988
- An Efficient Approximation Scheme for Variable-Sized Bin PackingSIAM Journal on Computing, 1987
- Variable Sized Bin PackingSIAM Journal on Computing, 1986
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Reduction operations for constraint satisfactionInformation Sciences, 1978
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- Worst-Case Performance Bounds for Simple One-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1974
- A O(|V|·|E|) algorithm for maximum matching of graphsComputing, 1974
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965