NEW HEURISTICS FOR SOLVING THE ECONOMIC LOT SCHEDULING PROBLEM WITH REWORKS
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
251 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
229 | en_US |
dc.citation.volume |
7 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Chang, Yu-Jen | en_US |
dc.contributor.author |
Yao, Ming-Jong | en_US |
dc.contributor.department |
運輸與物流管理系 註:原交通所+運管所 | zh_TW |
dc.contributor.department |
Department of Transportation and Logistics Management | en_US |
dc.date.accessioned |
2014-12-08T15:37:34Z | |
dc.date.available |
2014-12-08T15:37:34Z | |
dc.date.issued |
2011-02-01 | en_US |
dc.description.abstract |
In this study, we are interested in the economic lot scheduling problem (ELSP) that considers manufacturing of the serviceable products and remanufacturing of the rework products. In this paper, we formulate a mathematical model for the ELSP with reworks using the common cycle approach in which only one manufacturing lot and only one rework lot for each product exist during a common cycle. In order to solve this problem, we propose two heuristics that not only search for the optimal cycle time and an optimal production sequence, but also utilize a simple scheduling heuristic to schedule the starting time of all the manufacturing and rework lots so as to minimize the average total costs. The first heuristic is a simple heuristic that employs a 2-opt search to obtain a close-to-optimal production sequence. The second heuristic, which is a refined version of the simple heuristic, employs a bisection search to look for an optimal cycle time. In our numerical experiments, we compare the effectiveness of both heuristics using randomly generated instances. | en_US |
dc.identifier.doi |
10.3934/jimo.2011.7.229 | en_US |
dc.identifier.issn |
1547-5816 | en_US |
dc.identifier.journal |
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.3934/jimo.2011.7.229 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/25830 | |
dc.identifier.wosnumber |
WOS:000286927300016 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Inventory | en_US |
dc.subject |
rework | en_US |
dc.subject |
logistics | en_US |
dc.subject |
heuristic | en_US |
dc.subject |
scheduling | en_US |
dc.subject |
search | en_US |
dc.title |
NEW HEURISTICS FOR SOLVING THE ECONOMIC LOT SCHEDULING PROBLEM WITH REWORKS | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文