653
Views
14
CrossRef citations to date
0
Altmetric
Articles

Simulation-based solution for a dynamic multi-crane-scheduling problem in a steelmaking shop

, &
Pages 6970-6984 | Received 23 May 2018, Accepted 25 Oct 2019, Published online: 11 Nov 2019
 

Abstract

Here, we present a simulation-based solution for a multi-crane-scheduling problem derived from a steelmaking shop. This problem features non-conflict constraint between cranes, station-capacity constraint, and jobs with inaccurate release times and different temporal scheduling objectives. The predictive–reactive rescheduling strategy was applied to solve the problem. The problem was modelled considering different temporal objectives for the jobs and workload objective for the cranes and the model was solved by a heuristic. In the simulation, the jobs were not directly given but generated by a job-prediction method. The cranes’ moving behaviours were controlled by a designed crane trajectory solution. Experimental tests were conducted using data from the site and the results show that the proposed crane-scheduling solution provided better scheduling results than both the exhaustive method and the method that is used in the production field. The best predictive spans for the jobs in this specific crane-scheduling problem were found to be 7–14 min. The real-time performance of the crane-scheduling solution is demonstrated to highly guarantee its practicability.

Acknowledgements

This work was supported by the National Natural Science Foundation of China under grant number 51674030; and National Key Research and Development Programme under grant number 2016YFB0601301.

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China under grant number 51674030; and National Key Research and Development Program under grant number 2016YFB0601301.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 973.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.