完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYing, Kuo-Chingen_US
dc.contributor.authorLinb, Shih-Weien_US
dc.contributor.authorLu, Chung-Chengen_US
dc.date.accessioned2017-04-21T06:56:21Z-
dc.date.available2017-04-21T06:56:21Z-
dc.date.issued2017en_US
dc.identifier.issn0020-7543en_US
dc.identifier.urihttp://dx.doi.org/10.1080/00207543.2016.1224949en_US
dc.identifier.urihttp://hdl.handle.net/11536/133221-
dc.description.abstractThis study addresses the single-machine scheduling problem with a common due window (CDW) that has a constant size and position. The objective is to minimise the total weighted earliness-tardiness penalties for jobs completed out of the CDW. To determine a schedule as close to optimum as possible, this study develops a dynamic dispatching rule and an effective constructive heuristic. The better performance of the proposed heuristic is demonstrated by comparing the results of it with those of a state-of-the-art greedy heuristic on a well-known benchmark problem set. In addition, we incorporate the constructive heuristic into a best-so-far meta-heuristic to examine the benefit of the proposed heuristic. The results show that the best known solutions in 144 out of the 250 benchmark instances are improved.en_US
dc.language.isoen_USen_US
dc.subjectschedulingen_US
dc.subjectheuristicsen_US
dc.subjectcommon due windowen_US
dc.subjectdispatching ruleen_US
dc.titleEffective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due windowen_US
dc.identifier.doi10.1080/00207543.2016.1224949en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF PRODUCTION RESEARCHen_US
dc.citation.volume55en_US
dc.citation.issue6en_US
dc.citation.spage1707en_US
dc.citation.epage1719en_US
dc.contributor.department運輸與物流管理系 註:原交通所+運管所zh_TW
dc.contributor.departmentDepartment of Transportation and Logistics Managementen_US
dc.identifier.wosnumberWOS:000396796700011en_US
顯示於類別:期刊論文