Constraint-based resource allocation and scheduling in steel manufacturing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1551 LNCS, Issue , 1999, Pages 335-349

  Carlsson, Mats ^a   Kreuger, Per ^a   Astrom, Emil ^a  

^a SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

Finite domain constraints; Flow maximization; Scheduling; Steel manufacturing

Indexed keywords

CONSTRAINT-BASED; FINITE DOMAIN CONSTRAINTS; GREEDY ALGORITHMS; MAXIMIZATION PROBLEM; STEEL MANUFACTURING; SUB-PROBLEMS;

ALGORITHMS; SCHEDULING;

MANUFACTURE;

EID: 84867475769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (5)

1. K.R. Baker. Introduction to sequencing and scheduling. Wiley & Sons, 1974.
2. P. Bruckner and O. Thiele. A branch & bound method for the general-shop problem with sequencing dependent setup-times. OR Spectrum, 18:145-161, 1996.
3. J. Carlier and E. Pinson. An algorithm for solving the job-shop scheduling problem. Management Science, 35(2):164-176, 1989.
4. Mats Carlsson, Greger Ottosson, and Björn Carlson. An open-ended finite domain constraint solver. In H. Glaser, P. Hartel, and H. Kucken, editors, PLILP'97, International Symposium on Programming Languages: Implementations, Logics, and Programming, number 1292 in Lecture Notes in Computer Science, Southampton, September 1997. Springer-Verlag.
5. André Chamard, Annie Fischler, Dominique-Benoît Guinaudeau, and André Guillaud. CHIC lessons on CLP methodology. Technical Report ESPRIT EP5291 / D2.1.2.3, CHIC Project / Dassault Aviation / Bull, January 1995. (Constraint Handling in Industry and Commerce).