New constructive heuristics for the total weighted tardiness problem

Title
New constructive heuristics for the total weighted tardiness problem
Author(s)
윤상흠이익선[이익선]
Keywords
JOB SHOPS; MINIMIZE
Issue Date
201101
Publisher
PALGRAVE MACMILLAN LTD
Citation
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.62, no.1, pp.232 - 237
Abstract
This note considers the single-machine total weighted tardiness problem. Three new heuristic algorithms are suggested and compared with other competing heuristics from the literature, such as Apparent Tardiness Cost, Weighted Covert and Weighted Modified Due Date. The experimental tests show that the suggested heuristic algorithms outperform the existing heuristics. Journal of the Operational Research Society (2011) 62, 232-237. doi:10.1057/jors.2009.186 Published online 24 February 2010
URI
http://hdl.handle.net/YU.REPOSITORY/25797http://dx.doi.org/10.1057/jors.2009.186
ISSN
0160-5682
Appears in Collections:
경영대학 > 경영학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

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

BROWSE