A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex

DOI10.1016/S0377-2217(99)00380-XzbMath1025.90523MaRDI QIDQ1577763

Lixin Tang, Jiyin Liu, Aiying Rong, Zihou Yang

Publication date: 24 November 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

scheduling; genetic algorithms; iron and steel industry; multiple traveling salesman problem; hot rolling production

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B30: Production models

90C27: Combinatorial optimization

90B90: Case-oriented studies in operations research

Related Items

A review of planning and scheduling systems and methods for integrated steel production, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, Scheduling in a continuous galvanizing line, A new approach to solving the multiple traveling salesperson problem using genetic algorithms, Lot sizing and furnace scheduling in small foundries, Integer linear programming formulations of multiple salesman problems and its variations, A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM, Production scheduling optimization algorithm for the hot rolling processes, Scheduling continuous aluminium casting lines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• The traveling salesman problem: An overview of exact and approximate algorithms
• A mixed integer programming model for scheduling orders in a steel mill
• Some Simple Applications of the Travelling Salesman Problem
• Steel production schedule generation
• Solution of a Large-Scale Traveling-Salesman Problem