Scheduling Distributed Permutation Flowshops with Flexible Assembly Machines and Setup Times
碩士 === 國立臺北科技大學 === 工業工程與管理系 === 107 === The distributed assembly permutation flowshop scheduling problem (DAPFSP) play an influential role in modern supply chains and manufacturing systems. The DAPFSP consists of two stages: production and assembly. However, the flexible assembly machines gain furt...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48pd6h |
| Summary: | 碩士 === 國立臺北科技大學 === 工業工程與管理系 === 107 === The distributed assembly permutation flowshop scheduling problem (DAPFSP) play an influential role in modern supply chains and manufacturing systems. The DAPFSP consists of two stages: production and assembly. However, the flexible assembly machines gain furthered importance of the coming years. Thus, this research tries to minimize the makespan for the DAPFSP with flexible assembly and sequence-independent setup times. Firstly, we present a state-of-the-art MILP model. A constructive heuristic and an improved heuristic are proposed. The computational experiments show that the proposed algorithm offers good performance to solve the DPFSP_FAST.
|
|---|