A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
type: Item
instance of: scholarly article
title: A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
zbMATH Open document ID: 1025.90523
DOI: 10.1016/S0377-2217(99)00380-X
author: Lixin Tang
author: Jiyin Liu
author: Aiying Rong
author: Zihou Yang
published in: European Journal of Operational Research
publication date: 2003-11-24T00:00:00Z
Mathematics Subject Classification ID: 90B90
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1496128
zbMATH Keywords: iron and steel industry
zbMATH Keywords: hot rolling production
zbMATH Keywords: scheduling
zbMATH Keywords: multiple traveling salesman problem
zbMATH Keywords: genetic algorithms
MaRDI profile type: Publication
cites work: A mixed integer programming model for scheduling orders in a steel mill
cites work: Steel production schedule generation
cites work: Some Simple Applications of the Travelling Salesman Problem
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: The traveling salesman problem: An overview of exact and approximate algorithms
cites work: Q4692508
cites work: Q3829370
cites work: Q3829367
cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
description: scientific article; zbMATH DE number 1496128