三階段流程工廠在無閒置時間下之排程問題

Three machine flow-shop problem without idle time

林政德(Cheng-Te Ling)

指導教授 ： 蘇玲慧

中原大學/工學院/工業工程研究所/碩士(2005年)

https://doi.org/10.6840/cycu200500557

摘要

本研究是探討三階段流程型工廠在無閒置時間限制下之總完成時間最小化的排程問題，三個階段製程均為單機，本研究分析了三個案例，並找出其中兩個案例的最佳解排序方式，以及第三個案例在特殊情況下的最佳解。本研究的最佳解排序方法是以Johnson’s rule為基礎做延伸，其推導過程與排序方式會在研究中詳細說明。

關鍵字

無閒置時間 ； 流程型工廠 ； 完成時間

並列摘要

This paper studies three stages no-idle flow-shops problem in order to minimize the makespan. Every stage is a single machine. This paper considers three cases. We obtain two optimal solutions and find optimal solution only for special case on third case. The best permutation of this paper bases on Johnson’s rule. The relationships developed and results are detailed on this paper.

並列關鍵字

No idle time ； Total completing time ； Flow shop

參考文獻

[1] Adiri, I., & Pohoryles, D. (1982). Flow-shop/no-idle or no-wait scheduling to minimize the sum of completion times, Naval Research Quarterly, 29, 495–504.

[3]Elmaghraby, S., & Kamburowski, J. (1992). The analysis of activity networks under generalized precedence relations (GPRs). Management Science, 38, 1245–1263.

[4]Garey, M. R. D., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117–129.

[5]Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44, 510–515.

[6] Hankbooks in Operations Research and Management Science, vol. 4. Logistics of Production and Inventory, North-Holland, Amsterdam, PP. 445-522.