Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
30713 | en_US |
dc.citation.spage |
30702 | en_US |
dc.citation.volume |
6 | en_US |
dc.contributor.author |
Ying, Kuo-Ching | en_US |
dc.contributor.author |
Lu, Chung-Cheng | en_US |
dc.contributor.author |
Lin, Shih-Wei | en_US |
dc.contributor.department |
運輸與物流管理系 註:原交通所+運管所 | zh_TW |
dc.contributor.department |
Department of Transportation and Logistics Management | en_US |
dc.date.accessioned |
2018-08-21T05:53:49Z | |
dc.date.available |
2018-08-21T05:53:49Z | |
dc.date.issued |
2018-01-01 | en_US |
dc.description.abstract |
The no-wait flowshop scheduling problem with hard due date constraints is critical to operations in many industries, such as plastic, chemical, and pharmaceutical manufacturing. However, to date, there is a lack of effective optimization algorithms for this NP-hard problem. This paper develops a new mixed integer linear programming (MILP) model and a two-phase enumeration algorithm to improve the best-so-far exact methods for solving this problem with the objective of minimizing the makespan. A comprehensive computational experiment is performed to compare the performances of the discussed exact methods. The computational results demonstrate that the proposed MILP model and the two-phase enumeration algorithm significantly outperform the best-so-far optimization methods, and the (sub-) optimal solutions to several unsolved instances from the literature are reported. | en_US |
dc.identifier.doi |
10.1109/ACCESS.2018.2834954 | en_US |
dc.identifier.issn |
2169-3536 | en_US |
dc.identifier.journal |
IEEE ACCESS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/ACCESS.2018.2834954 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/145185 | |
dc.identifier.wosnumber |
WOS:000436450000001 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Scheduling | en_US |
dc.subject |
no-wait flowshop | en_US |
dc.subject |
due date constraints | en_US |
dc.subject |
mathematical model | en_US |
dc.title |
Improved Exact Methods for Solving No-Wait Flowshop Scheduling Problems With Due Date Constraints | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文