臺灣博碩士論文加值系統

本研究探討雙機台間不具有儲存空間下極小化總延遲時間之雙機流程式生產排程問題。此篇我們假設有2台機台和n個工作，每個工作在兩機台分別有不同的工作時間以及交期時間，每個工作的釋放時間都相同，而工作的順序在進入機台1後就決定。如果工作在機台1完成後而機台2尚有未完成的工作，此時在機台1完成的工作將會被鎖在機台1，這將會使交期時間增加。
本文針對不具有儲存空間的雙機台排程問題所造成的延遲時間增加，提出5個定理來決定工作在最佳解排程下的的順序以及一個下限的方法來決定分支的方向，最後運用在分支界限法求得n個工作之最佳工作順序，使得總延遲時間為最小。在實驗分析裡我們先用相似的期刊論文驗證演算法的正確性。接下來我們比較Ronconi and Armentano (2001) 這篇論文在雙機台情境下的結果，我們得到了在工作數介於10至18之間我們的平均時間與平均產生的節點數都較Ronconi and Armentano (2001) 這篇論文來的有效率。

This paper considers a flow shop scheduling problem with blocking where the objective is to minimize total tardiness. There are two machines and n jobs, each job has different due date and the sequence of job is decided by machine 1. In two-machine flow shop with blocking scheduled problem, there are zero capacity buffer between machines and the job of completing is block on machine until the next downstream machine is available. The total tardiness will increase by influence of blocking constraint. We use branch and bound algorithm to find out an optimal sequence and propose five dominance criteria which are decide jobs of the precedence in an optimal schedule. For bounding, we extend lower bound of Pan, Chen and Chao (2002) to improve the branch and bound algorithm. In computation experiment, we use four scenarios of Ronconi and Armentano (2001) to test our algorithm. In job size between 10 and 18, our algorithm branches out fewer number of nodes as compared to the result in Ronconi and Armentano (2001).

摘要 i
Abstract ii
致謝 iii
Content iv
List of Table vi
List of Figure vii
Chapter 1 Introduction 1
1.1 Motivation and background 1
1.2 Problem Description 2
1.3 Research Objectives 2
1.4 Research Methodology and Framework 3
1.4.1 Research Methodology 3
1.4.2 Research Framework 4
Chapter 2 Literature review 5
2.1 Two-machine flow shop scheduling problem with total tardiness 5
2.1.1 Dominance criteria in literature 6
2.1.2 The lower bound in literature 7
2.2 Two-machine flow shop scheduling problem with blocking 8
Chapter 3 Two-machines flow shop scheduling problem with blocking for total tardiness minimization 9
3.1 Environment Description 9
3.2 Determination of total tardiness and makespan 10
3.3 Dominance criteria 14
3.3.1 Dominance criteria for single job 14
3.3.2 Dominance criteria for two adjacent job 15
3.4 Lower bound 22
3.5 A branch and bound algorithm for F2|Block|TT 25
Chapter 4 Validity and Evaluation 31
4.1 The Validity of the algorithm 31
4.2 The suitability of algorithm 35
Chapter 5 Conclusion 42
5.1 Research Contribution 42
5.2 Limitation Research 42
5.3 Future Research 43
References 44
Appendix A 46

Bank, M., Fatemi Ghomi, S. M. T., Jolai, F., Behnamian, J. (2012). Two-machine flow shop total tardiness scheduling problem with deteriorating jobs. Applied Mathematical Modelling, 36, 5418–5426.

Baptiste, P., Carlier, J., Jouglet, A. (2004). A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates. European Journal of Operational Research, 158, 595-608.

Fisher, M. L. (1976). A dual algorithm for the one-machine scheduling problem. Mathematical Programming, 11, 229-251.

Kim, Y. D. (1993). A New branch and bound algorithm for minimizing mean tardiness in two-machine flowshops. Computers &; Operation Research, 20, 391-401.

Kim, Y. D. (1995). Minimizing total tardiness in permutation flowshops. European Journal of Operational Research, 85, 541-555.

Lee, W. C., Shiau, Y. R., Chen, S. K., Wu, C. C. (2010). A two-machine flowshop scheduling problem with deteriorating jobs and blocking. International Journal of Production Economics, 124, 188-197.

Moslehi, G., Khorasanian, D. (2013). Optimizing blocking flow shop scheduling problem with total completion time criterion. Computers &; Operation Research, 40, 1874-1883.


Pan, J. C. H., Chen, J. S., Chao, C. M. (2002). Minimizing tardiness in a two-machine flow-shop. Computers &; Operation Research, 29, 869-885.

Pan, J. C. H., Fan, E. T. (1997). Two-machine flow-shop scheduling to minimize total tardiness. International Journal of Systems Science, 28, 405-414.

Ronconi, D. P., Armentano, V. A. (2001). Lower bounding schemes for flowshops with blocking in-process. The Journal of the Operational Research Society, 11, 1289-1297.

Ronconi, D. P., Henriques, L. R. S. (2009). Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega, 37, 272-281.

Sen, T., Dileepan, P., Gupta, J. N. D. (1989). The two-machine flowshop scheduling problem with total tardiness. Computers &; Operation Research, 16, 333-340.