Publication Cover
Production Planning & Control
The Management of Operations
Volume 13, 2002 - Issue 3
100
Views
16
CrossRef citations to date
0
Altmetric
Original Articles

An efficient scheduling algorithm for the hot coil making in the steel mini-mill

Pages 298-306 | Published online: 15 Nov 2010

  • ASSAF , I. , CHEN , M. and KATZBERG , J. 1997 . Steel production schedule generation . International Journal of Production Research , 35 : 467 – 477 .
  • Box , R. E. and HERBE , D. G. JR . 1988 . A scheduling model for LTV Steel's Cleveland Works' Twin Strand Continuous Slab Caster . Interfaces , 18 (1) : 42 – 56 .
  • DIAZ , A. , SANCHO , L. , GARCIA , R. and LARRANETA , J. 1991 . A dynamic scheduling and control system in an ENSIDESA steel plant . Interfaces , 21 (5) : 53 – 62 .
  • EDMONDS , J. 1965a . Paths, trees and flowers . Canadian Journal of Mathematics , 47 : 449 – 467 .
  • EDMONDS , J. 1965b . Maximum matchings and a polyhedron with O, 1 vertices . Journal of Research of the Motional Bureau of Standards , 69B : 125 – 130 .
  • EVENS , S. and KARIV , O. An O(n25) algorithm for maximum matching in general graphs . Proceedings of the 16th Annual Symposium on Foundations of Computer Science . pp. 100 – 112 .
  • FRIESEN , D. K. and KHUL , F. S. 1988 . Analysis of a hybrid algorithm for packing unequal bins . Siam Journal on Computing , 17 (1) : 23 – 40 .
  • FRIESEN , D. K. and LANSTON , M. A. 1986 . Variable sized bin packing . Siam Journal on Computing , 15 (1) : 222 – 230 .
  • GABOW , H. N. 1975 . An efficient implementation of Edmond's algorithm for maximum matchings on graphs . Journal of ACM , 23 : 221 – 234 .
  • GAREY , M. R. and JOHNSON , D. S. 1979 . Computers and Intractability , San Francsico : W. H. Freeman .
  • HARALICK , R. M. , DAVIS , L. S. , ROSENFELD , A. and MILGRAM , D. L. 1978 . Reduction operation for constraint satisfaction . Information Science , 2 (5) : 199 – 219 .
  • HENTENYCK , P. V. 1989 . Constraint Satisfaction in Logic Programming , London : The MIT Press .
  • JOHNSON , A. D. , ULLMAN , J. D. , GAREY , M. R. and GRAHAM , R. L. 1974 . Worst-case performance bounds for simple onedimensional packing algorithms . Siam Journal on Computing , 3 (4) : 299 – 325 .
  • KAMEDA , T. and MUNRO , I. 1974 . An O(|V||E|) algorithm for maximum matching of graphs . Computing , 12 : 91 – 98 .
  • LEE , H. S. , MURTHY , S. S. , HAIDER , S. W. and MORSE , D. V. 1996 . Primary production scheduling at stcclmaking industries . IBM Journal of Research & Development , 40 (2) : 231 – 252 .
  • MICALI , S. and VAZIRANI , V. V. An algorithm for finding maximum matching in general graphs . Proceedings of the 21st Annual Symposium on the Foundations of Computer Science . pp. 17 – 27 .
  • MURGOLO , F. D. 1987 . An efficient approximation scheme for variable-sized bin packing . Siam Journal on Computing , 16 (1) : 149 – 161 .
  • ROBERT , M. , HARALICK , L. S. and GORDON , L. E. 1980 . Increasing tree search efficiency for constraint satisfaction problems . Artificial Intelligence , 14 : 263 – 313 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.