Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
367 | en_US |
dc.citation.issue |
1-4 | en_US |
dc.citation.spage |
355 | en_US |
dc.citation.volume |
56 | en_US |
dc.citation.woscount |
6 | |
dc.contributor.author |
Chung, Yu-Hsiang | en_US |
dc.contributor.author |
Tong, Lee-Ing | en_US |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2014-12-08T15:27:45Z | |
dc.date.available |
2014-12-08T15:27:45Z | |
dc.date.issued |
2011-09-01 | en_US |
dc.description.abstract |
Studies on scheduling with learning considerations have recently become important. Most studies focus on single-machine settings. However, numerous complex industrial problems can be modeled as flowshop scheduling problems. This paper thus focuses on minimizing the makespan in an m-machine permutation flowshop with learning considerations. This paper proposes a dominance theorem and a lower bound to accelerate the branch-and-bound algorithm for seeking the optimal solution. This paper also adapts four well-known existing heuristic algorithms to yield the near-optimal solutions. Eventually, the performances of all the algorithms proposed in this paper are reported for small and large job-sized problems. The computational experiments indicate that the branch-and-bound algorithm can solve problems of up to 18 jobs within a reasonable amount of time, and the heuristic algorithms are quite accurate with a mean error percentage of less than 0.1%. | en_US |
dc.identifier.doi |
10.1007/s00170-011-3172-2 | en_US |
dc.identifier.issn |
0268-3768 | en_US |
dc.identifier.journal |
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s00170-011-3172-2 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/20004 | |
dc.identifier.wosnumber |
WOS:000293247100030 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Scheduling | en_US |
dc.subject |
Learning effects | en_US |
dc.subject |
Flowshop | en_US |
dc.subject |
Makespan | en_US |
dc.title |
Makespan minimization for m-machine permutation flowshop scheduling problem with learning considerations | en_US |
dc.type |
Article | en_US |
檔案
- 000293247100030.pdf (250.4 KB, Adobe PDF)
所屬典藏: 期刊論文