參考文獻
1.呂光棓、巫木誠(2006)。零工式排程之巨集啟發式演算法的比較。國立陽明交通大學工業工程與管理學系。碩士論文。2.陳禎祥、高嘉和、陳俊傑、劉伯晟、林文賓(2002)。迴流雙機流程工廠之動態排程探討。遠東技術學院工業工程與管理系。遠東學報第二十卷第一期。
3.潘建興、劉欣平(2022)。元啟發式最佳化演算法:新時代簡單高效又萬能的演算法。中研院訊1772期。
4.Andrew Alexander Harold Brown (2014). Dispatching Work: Finding the best dispatching method for real job-shops. UWSpace.
5.Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159(1), 135-159.
6.Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management science, 34(3), 391-401.
7.Adeyinka, F. M. (2021). Identification of Moving Bottlenecks in Production Systems. West Virginia University.
8.Balas, E. (1979). Disjunctive programming. Annals of discrete mathematics, 5, 3-51
9.Ba'Its, H. A., Puspita, I. A., & Bay, A. F. (2020). Combination of program evaluation and review technique (PERT) and critical path method (CPM) for project schedule development. International Journal of Integrated Engineering, 12(3), 68-75.
10.Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T. and van de Velde, S.L. (1998), Scheduling a batching machine. J. Sched., 1: 31-54.
11.Borgelt, C., Kruse, R. (2002). Induction of Association Rules: Apriori Implementation. In: Härdle, W., Rönz, B. (eds) Compstat. Physica, Heidelberg.
12.Binchao Chen, Timothy I. Matis.(2013). A flexible dispatching rule for minimizing tardiness in job shop scheduling, International Journal of Production Economics, Volume 141, Issue 1, 2013, Pages 360-365.
13.Chan, F., Chan, H. & Lau, H. (2002). The State of the Art in Simulation Study on FMS Scheduling: A Comprehensive Survey. Int J Adv Manuf Technol 19, 830–849 (2002).
14.Christian Blum, Andrea Rol. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, Volume 35, Issue 3, September 2003, pp 268–308.
15.Dimitris J. Bertsimas, Patrick Jaillet, Amedeo R. Odoni. (1990). A Priori Optimization. Operations Research 38(6):1019-1033.
16.de Souza, E. A. G., Nagano, M. S., & Rolim, G. A. (2022). Dynamic Programming algorithms and their applications in machine scheduling: A review. Expert Systems with Applications, 190, 116180.
17.Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 26(1), 29-41.
18.Fan, K., Zhai, Y., Li, X. et al. (2018). Review and classification of hybrid shop scheduling. Prod. Eng. Res. Devel. 12, 597–609.
19.Fong-Yuen Ding; Duangjai Kittichartphayak (1994). Heuristics for scheduling flexible flow lines. , 26(1), 27–34.
20.Glover, F. (1989). Tabu search—part I. ORSA Journal on computing, 1(3), 190-206.
21.Ghada El Khayat, Andre´ Langevin, Diane Riopel. (2006). Integrated production and material handling scheduling using mathematical programming and constraint programming. European Journal of Operational Research, 175 (2006), 1818–1832.
22.Georgios M. Kopanos a, Carlos A. Méndez, Luis Puigjaner. (2010). MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: A benchmark scheduling problem of the pharmaceutical industry. European Journal of Operational Research, 207(2), 644–655.
23.Hazır, Ö., Günalay, Y., & Erel, E. (2008). Customer order scheduling problem: a comparative metaheuristics study. The International Journal of Advanced Manufacturing Technology, 37(5), 589-598.
24.Hoitomt, D. J., Luh, P. B., & Pattipati, K. R. (1993). A practical approach to job-shop scheduling problems. IEEE transactions on Robotics and Automation, 9(1), 1-13.
25.Jacek Blazewicz, Erwin Pesch, Malgorzata Sterna. (2000). The disjunctive graph machine representation of the job shop scheduling problem, European Journal of Operational Research, Volume 127, Issue 2, 2000, Pages 317-331.
26.Jatinder N. D. GUPTA. (1976). A HEURISTIC ALGORITHM FOR THE FLOWSHOP SCHEDULING PROBLEM. R.A.LR.O. Recherche opérationnelle, vol. 10, n° 6, 1976, p. 63-73.
27.Jeffrey W. Herrmann. (2001). Department of Mechanical Engineering, University of Maryland,. College Park, MD 20742.
28.Kashani, M. H., & Jahanshahi, M. (2009, September). Using simulated annealing for task scheduling in distributed systems. In 2009 International conference on computational intelligence, modelling and simulation (pp. 265-269). IEEE.
29.Kaban, A. K., Othman, Z., Rohmah, D. S. (2012). Comparison of dispatching rules in job-shop Scheduling problem Using simulation: A case study. Int j simul model 11 (2012) 3, 129-140.
30.Kerzner, H. (2017). Project management: a systems approach to planning, scheduling, and controlling. John Wiley & Sons.
31.Lawrence, S. and Buss, A. (1994). Economic Analysis of Production Bottlenecks. Mathematical Problems in Engineering 1(4).
32.Liu, S. Q., Kozan, E. (2012). A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem. Journal of the Operational Research Society, 63(2), 168-182.
33.Lee, W. J., & Lee, K. C. (1997). A meta DSS approach to coordinating production/marketing decisions. In Proceedings of the ISDSS'97 Conference, University of Lausanne Switzerland (pp. 25-40).
34.Lee, W. J., & Lee, K. C. (1999). A meta decision support system approach to coordinating production/marketing decisions. Decision Support Systems, 25(3), 239-250.
35.Lewis, C. (2008). Linear programming: theory and applications. Whitman College Mathematics Department.
36.Malcolm, D. G.; Roseboom, J. H.; Clark, C. E.; Fazar, W. (1959). Application of a Technique for Research and Development Program Evaluation. Operations Research, 7(5), 646–669. doi:10.1287/opre.7.5.646
37.Mohammad Mahdi Ahmadian, Mostafa Khatami, Amir Salehipour, T.C.E. Cheng. (2021). Four decades of research on the open-shop scheduling problem to minimize the makespan, European Journal of Operational Research (2021).
38.Muminu O. Adamu, Aderemi O. Adewum. (2016). Minimizing The Weighted Number of Tardy Jobs on Multiple Machines: A Review. Journal of Industrial and Management Optimization · January 2016, pp.1465-1493.
39.Montoya-Torres, J. R., Soto-Ferrari, M., & Gonzalez-Solano, F. (2010). Production scheduling with sequence-dependent setups and job release times. Dyna, 77(163), 260-269.
40.Murota, K. (2020). Linear programming. In Computer Vision: A Reference Guide (pp. 1-7). Cham: Springer International Publishing.
41.Neapolitan, R., & Naimipour, K. (2015). Foundations of algorithms. Jones & Bartlett Publishers.
42.Oliver Holthaus, Chandrasekharan Rajendran. (1997). Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics, Volume 48, Issue 1, 10 January 1997, Pages 87-105.
43.Pacciarelli, D. (2002). Alternative graph formulation for solving complex factory-scheduling problems. International Journal of Production Research, 40(15), 3641-3653.
44.Pinedo, M. (2005). Planning and scheduling in manufacturing and services. Springer (New York).
45.Pinedo, M. L. (2016). Scheduling: Theory, Algorithms, and Systems, Springer International Publishing.
46.Potts C. N. and Kovalyov M. Y. (2000). Scheduling with batching: A review. European Journal of Poerational Research 120: 228-249.
47.Pedro Alfaro-Fernandez, Ruben Ruiz, Federico Pagnozzi, Thomas Stutzle. (2019). Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems, European Journal of Operational Research (2019).
48.Papatya S. Bicakci, Imdat Kara, Mujgan Sagir. (2021). Single‑Machine Order Acceptance and Scheduling Problem Considering Setup Time and Release Date Relations. Arab J Sci Eng 46, 1549–1559 (2021).
49.Rajendran, C., & Ziegler, H. (1997). An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research, 103(1), 129-138.
50.Roser, C., Nakano, M., & Tanaka, M. (2002, December). Shifting bottleneck detection. In Proceedings of the Winter Simulation Conference (Vol. 2, pp. 1079-1086). IEEE.
51.Reza Shamsaee, Mahmood Fathy, Ali Masoudi-Nejad. (2014). Extracting a cancer model by enhanced ant colony optimisation algorithm. Int. J. Data Mining and Bioinformatics, Vol. 10, No. 1, 2014:83-97.
52.Schwiegeishohn, U., & Yahyapour, R. (1998, March). Improving first-come-first-serve job scheduling by gang scheduling. In Workshop on Job Scheduling Strategies for Parallel Processing (pp. 180-198). Springer, Berlin, Heidelberg.
53.Stephen R. Lawrence, Arnold H. Buss. (1994). Shifting Production Bottlenecks: Causes, Cures, And Conundrums. Production And Operations Management Vol. 3, No. I, Winter 1994.
54.S. Kirkpatrick; C. D. Gelatt; M. P. Vecchi. (1983). Optimization by Simulated Annealing. Science, New Series, Vol. 220, No. 4598. (May 13, 1983), pp. 671-680.
55.Topaloglu, S., & Kilincli, G. (2009). A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization. The International Journal of Advanced Manufacturing Technology, 44, 781-794.