A multi-objective optimisation algorithm for the hot rolling batch scheduling problem

The hot rolling batch scheduling problem is a hard problem in the steel industry. In this paper, the problem is formulated as a multi-objective prize collecting vehicle routing problem (PCVRP) model. In order to avoid the selection of weight coefficients encountered in single objective optimisation,...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of production research Vol. 51; no. 3; pp. 667 - 681
Main Authors:	Jia, S.J., Yi, J., Yang, G.K., Du, B., Zhu, J.
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis Group 01.02.2013 Taylor & Francis LLC
Subjects:	Algorithms ant colony optimisation Decision making models Effectiveness studies Hot rolling hot rolling batch scheduling Iron and steel industry Mathematical models Mathematical problems multi-objective optimisation Optimization Optimization algorithms Pareto optimality Pareto optimisation Pareto optimum Production scheduling Scheduling Structural steels
ISSN:	0020-7543, 1366-588X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!