Production scheduling for hot rolling processes with time windows in the steel industry Online publication date: Mon, 30-Jun-2014
by Mahdi Nakhaeinejad; Nasim Nahavandi
International Journal of Agile Systems and Management (IJASM), Vol. 7, No. 2, 2014
Abstract: This paper investigates the hot rolling production scheduling problem in the steel industry. The aim of hot rolling process scheduling (HRPS) is to construct a rolling sequence which optimises a set of given criteria under constraints. This paper presents the model and solution method for hot rolling production scheduling with time windows. Three heuristic algorithms based on an elementary shortest path problem with resource constraints (ESPPRC) are developed. The methods combine exact method and heuristics to obtain near-optimal solutions for this problem. The methods are divided into two phases: in the first phase, non-dominated feasible turns are generated; in the second phase, some turns are selected and sequenced to form the scheduling. The experimental results show that the proposed mathematical model and the heuristic algorithms can be applied in practice to provide production efficiency and economic benefits for the hot rolling scheduling problem.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Agile Systems and Management (IJASM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook