Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/178246
Authors: 
Li, Xiaoping
Chen, Long
Xu, Haiyan
Gupta, Jatinder N.
Year of Publication: 
2015
Citation: 
[Journal:] Operations Research Perspectives [ISSN:] 2214-7160 [Volume:] 2 [Year:] 2015 [Pages:] 13-23
Abstract: 
In this paper, Trajectory Scheduling Methods (TSMs) are proposed for the permutation flowshop scheduling problem with total tardiness minimization criterion. TSMs belong to an iterative local search framework, in which local search is performed on an initial solution, a perturbation operator is deployed to improve diversification, and a restart point mechanism is used to select the new start point of another cycle. In terms of the insertion and swap neighborhood structures, six composite heuristics are introduced, which exploit the search space with a strong intensification effect. Based on purely insertion-based or swap-based perturbation structures, three compound perturbation structures are developed that construct a candidate restart point set rather than just a single restart point. The distance between the current best solution and each start point of the set is defined, according to which the diversification effect of TSMs can be boosted by choosing the most appropriate restart point for the next iteration. A total of 18 trajectory scheduling methods are constructed by different combinations of composite heuristics. Both the best and worst combinations are compared with three best existing sequential meta-heuristics for the considered problem on 540 benchmark instances. Experimental results show that the proposed heuristics significantly outperform the three best existing algorithms within the same computation time.
Subjects: 
Scheduling
Heuristic
Permutation flow shop
Total tardiness
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by-nc-nd/4.0/
Document Type: 
Article

Files in This Item:
File
Size





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