Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/61565
Title: Breakout dynasearch for the single-machine total weighted tardiness problem
Authors: Ding, J
Lü, Z
Cheng, TCE 
Xu, L
Keywords: Adaptive perturbation strategy
Breakout local search
Dynasearch
Heuristic
Single-machine scheduling
Issue Date: 2016
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2016, v. 98, p. 1-10 How to cite?
Journal: Computers and industrial engineering 
Abstract: We present a breakout dynasearch algorithm (BDS) for solving the single-machine total weighted tardiness problem, in which a set of independent jobs with distinct processing times, weights, and due dates are to be scheduled on a single machine to minimize the sum of the weighted tardiness of all the jobs. BDS explores the search space by combining the dynasearch procedure and the adaptive perturbation strategy. Experimental results show that BDS virtually solves all the standard benchmark problem instances with 40, 50, and 100 jobs from the literature within 0.1 s. For 500 larger instances with 150, 200, 250, and 300 jobs, BDS obtains all the upper bounds with the same objective function of the optimal solutions within an average of 252 s, demonstrating the efficacy of BDS in terms of both solution quality and computational efficiency. We also analyze some key features of BDS to identify its success factors.
URI: http://hdl.handle.net/10397/61565
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2016.04.022
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Sep 9, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
Citations as of Sep 13, 2017

Page view(s)

48
Last Week
2
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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