Two-stage flowshop with finite intermediate storage
碩士 === 中原大學 === 工業工程研究所 === 92 === This study addresses the two-stage flowshop with a batch processor in stage 1 and discrete processor in stage 2.There is buffer between the two stages to store a limited number of jobs when the jobs when the jobs are completed from the first stage. Any job ca...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/92189061198332445850 |
| Summary: | 碩士 === 中原大學 === 工業工程研究所 === 92 === This study addresses the two-stage flowshop with a batch processor in stage 1
and discrete processor in stage 2.There is buffer between the two stages to store a
limited number of jobs when the jobs when the jobs are completed from the first stage.
Any job can be blocked at first stage while there was not enough space for storage.
The objective measure of the problem is the makespan. This problem was shown to be
NP-complete. A heuristic procedure that generates approximate efficient solution is
presented and a branch-and-bound procedure that generates optimal solution is
proposed for benchmarking. The results of the experimental investigation of the
effectiveness of the algorithms are also presented.
|
|---|