Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17329
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorTan, Y-
dc.creatorCheng, TCE-
dc.creatorJi, M-
dc.date.accessioned2014-12-19T06:56:37Z-
dc.date.available2014-12-19T06:56:37Z-
dc.identifier.issn0020-7543-
dc.identifier.urihttp://hdl.handle.net/10397/17329-
dc.language.isoenen_US
dc.publisherTaylor & Francisen_US
dc.subjectLadle schedulingen_US
dc.subjectMultiple objectivesen_US
dc.subjectScatter search algorithmen_US
dc.subjectSemi-soft time windowsen_US
dc.titleA multi-objective scatter search for the ladle scheduling problemen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1080/00207543.2014.939238-
dcterms.abstractWe consider the ladle scheduling problem, which can be regarded as a vehicle routing problem with semi-soft time windows and adjustment times. The problem concerns allocating ladles to serve molten steel based on a given steelmaking scheduling plan, and determining the modification operations for the empty ladles after the service process. In addition, combining the controllable processing time of molten steel, the other aspect of the problem is to determine the service start times taking into consideration the technological constraints imposed in practice. We present a non-linear mathematical programming model with the conflicting objectives of minimising the occupation ratio of the ladles and maximising the degree of satisfaction with meeting the soft windows. To solve the multi-objective model, we develop a new scatter search (SS) approach by re-designing the common components of SS and incorporating a diversification generator, a combination method and a diversification criterion to conduct a wide exploration of the search space. We analyse and compare the performance of the proposed approach with a multi-objective genetic algorithm and with manual scheduling adopted in practical production using three real-life instances from a well-known iron-steel production plant in China. The computational results demonstrate the effectiveness of the proposed SS approach for solving the ladle scheduling problem.-
dcterms.bibliographicCitationInternational journal of production research, 2014-
dcterms.isPartOfInternational journal of production research-
dcterms.issued2014-
dc.identifier.scopus2-s2.0-84905290622-
dc.identifier.eissn1366-588X-
dc.identifier.rosgroupid2014003471-
dc.description.ros2014-2015 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Sep 7, 2020

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Oct 21, 2020

Page view(s)

127
Last Week
0
Last month
Citations as of Oct 25, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.