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

扫码查看

原文链接

NSTL

外文摘要：The Hot Strip Mill Production Scheduling Problem is a hard problem that arises in the steel industry when scheduling steel coil production. It can be modeled as a generalization of the Prize Collecting Traveling Salesman Problem with multiple and conflicting objectives and constraints. In this paper we formulate this problem as a mathematical program and propose a heuristic method to determine good approximate solutions. The heuristic is based on Tabu Search and a new idea called" Cannibalization". Computational results on production data from Dofasco are presented and analyzed. Comparison with actual production schedules indicates that the proposed method could produce significantly better schedules.

外文关键词：

Tabu searchscheduling applicationsteel productionheuristicsmulticriteria optimization

作者：

Leo Lopez、Michael W. Carter、Michel Gendreau

展开 >

作者单位：

Department of Mechanical and Industrial Engineering, University of Toronto, 5 King's College Road, Toronto, Ont., Canada M5S 3G8

Departement d'informatique et recherche operationnelle, Centre de recherche sur les transports, Universite de Montreal, C.P. 6128, Succursale Centre-Ville, Montreal, Que., Canada H3C 3J7

出版年：

1998

European Journal of Operational Research

ISSHP

ISSN：0377-2217

年,卷(期)：1998.106(2/3)