The hot strip mill production scheduling problem: A tabu search approach

European Journal of Operational Research

Volumn 106, Issue 2-3, 1998, Pages 317-335

  Lopez, Leo ^a,b   Carter, Michael W ^a   Gendreau, Michel ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSIDAD DE LAS AMÉRICAS PUEBLA   (Mexico)

^c UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Heuristics; Multicriteria optimization; Scheduling application; Steel production; Tabu search

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; DATA REDUCTION; HEURISTIC METHODS; IRON AND STEEL PLANTS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING; STRIP MILLS;

TABU SEARCH METHODS; TRAVELING SALESMAN PROBLEMS;

PRODUCTION CONTROL;

EID: 0032049311     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00277-4     Document Type: Article

References (31)

1. Adenso-Diaz, B., 1992. Restricted neighborhood in the tabu search for the flowshop problem. European Journal of Operational Research 62, 27-37.
2. Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, E., 1995. A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Centre de Recherche sur les Transports, Publication CRT-95-84.
3. Balas, E., 1989. The prize collecting traveling salesman problem. Networks 19, 621-636.
4. Balas, E., Martin, ROLL-AROUND: Software package for scheduling the rounds of a rolling mill. Copyright Balas and Martin Associates, Pittsburgh, PA.
5. Cheng, T.C.E., 1993. Parallel flowshop scheduling with a common machine. Hong Kong Polytechnic, Working Paper.
6. Costa, D., 1993. An evolutionary tabu search algorithm and the NHL scheduling problem. INFOR 33 (3), 161-178.
7. Cowling, P., 1995. Optimization in Industry (ch: Optimization in steel hot rolling). Wiley, NY.
8. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13, 533-549.
9. Glover, F., 1990. Tabu search - Part I. ORSA Journal on Computing 1 (3), 190-206.
10. Glover, F., 1991. Tabu search - Part II. ORSA Journal on Computing 2 (1), 4-32.
11. Glover, F., Laguna, M., Taillard, E., de Werra, D. (Eds.), 1993. Tabu Search (special issue). Annals of Operations Research 41.
12. Gupta, J.N.D., 1988. Two-stage, hybrid flowshop scheduling problem. Journal of the Operational Research 39 (4), 359-364.
13. Gupta, J.N.D., Tunc, E.A., 1991. Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. International Journal of Production Research 29 (7), 1489 1502.
14. Hansen, P., 1986. The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming. Congress on Numerical Methods in Combinatorial Optimization, Capri, Italy.
15. Hertz, A., 1991. Tabu search for large scale timetabling problems. European Journal of Operational Research 54, 39-47.
16. Icmeli, O., Erenguc, S.S., 1994. A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows. Computers and Operations Research 21 (8), 841-853.
17. Kosiba, E.D., Wright, J.R., Cobbs, A.E., 1992. Discrete event sequencing as a traveling salesman problem. Computers in Industry 19, 317-327.
18. Lim, C.J., McMahon, G.B., 1994. The three-machine flow-shop problem with arbitrary precedence relations. European Journal of Operational Research 78, 216-223.
19. Miller, D.L., Pekney, J.P., 1990. Exact solution of a large asymmetric traveling salesman problem. Science 251, 754-760.
20. Narasimhan, S.L., Mangianelli, P.M., 1987. A comparison of sequencing rules for a two-stage hybrid flow shop. Decision Sciences 18, 250-265.
21. Rajendran, C., Chaudhuri, D., 1992. A multi-stage parallel-processor flowshop problem with minimum flowtime. European Journal of Operational Research 57, 111-122.
22. Skorin-Kapov, J., Vakharia, A.J., 1993. Scheduling a flow-line manufacturing cell: A tabu search approach. International Journal of Production Research 31 (7), 1721-1734.
23. Sriskandarajah, C., Ladet, P., 1986. Some no-wait shops scheduling problems: Complexity aspect. European Journal of Operational Research 24, 424-438.
24. Sriskandarajah, C., 1993. Performance of scheduling algorithms for no-wait flowshops with parallel machines. European Journal of Operational Research 70, 365-378.
25. Sun, D., Batta, R., Lin, L., 1995. Effective job shop scheduling through active chain manipulation. Computers and Operations Research 22 (2), 159-172.
26. Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y., 1995. A New Neighborhood Structure for the Vehicle Routing Problem with Time Windows. Centre de Recherche sur les Transports, Publication CRT-95-66.
27. Widmer, M., Hertz, A., 1989. A new heuristic method for the flow shop sequencing problem. European Journal of Operational Research 41, 186-193.
28. Widmer, M., 1991. Job shop scheduling with tooling constraints: A tabu search approach. Journal of the Operational Research Society 42 (1), 75-82.
29. Wright, J.R., Houck, M.H., 1985. An application of systems modeling in steel production scheduling. Engineering Software IV, Proceedings of the Fourth International Conference, Kensington Exhibition Center, London, England, 15.127-15.140.
30. Wright, M., 1994. Timetabling country cricket fixtures using a form of tabu search. Journal of the Operational Research Society 47 (7), 758-770.
31. Yanney, J.D., Kuo, W., 1989. A practical approach to scheduling a multistage, multiprocessor flow-shop problem. International Journal of Production Research 27 (10), 1733-1742.