臺灣博碩士論文加值系統

平行機排程問題(Parallel Machine Scheduling Problem ; PMSP)應用於許多產業的製造系統，如：鑄造產業(Casting Manufacturing)用於熱處理製程、半導體產業(Semiconductor Manufacturing)用於IC封裝測試等等，為提升相關製造系統的生產績效，PMSP歷年來不斷被許多研究人員所探討。而前篇專注討論PMSP之回顧文獻需追朔於2001年，故本研究選擇藉由客觀的主路徑分析(Main Path Analysis ; MPA)來完整並系統性回顧歷年及最新的PMSP研究之發展軌跡，並對搜索結果進行集群分析(Cluster Anaiysis ; CA)，由研究結果可得知PMSP未來整體性發展趨勢可考慮多目標函式與多限制條件之半導體議題做元啟發式演算法改進，而前五大子集群中之具序列相依整備時間(Sequence Dependent Setup Times)可往半導體議題討論，批次處理問題(Batch Scheduling)可考慮雙目標，具學習效應與退化性作業(Learning Effect and Deteriorating Operations)可提出混和元啟發式演算法求解，近似演算法(Approximation Algorithm)考慮多目標求解，線上排程(On-line Scheduling)考量機台數遞增問題。本研究所呈現之PMSP主路徑與各子領域之發展軌跡結果，可提供相關產業實務應用及後續研究的參考。

The Parallel Machine Scheduling Problem (PMSP) is applied in various manufacturing systems in industries such as Casting Manufacturing for heat treatment processes and Semiconductor Manufacturing for IC packaging and testing. To enhance the production efficiency of related manufacturing systems, PMSP has been continuously explored by many researchers over the years. The previous literature review on PMSP can be traced back to 2001. Therefore, this study chooses to conduct a comprehensive and systematic review of the development trajectory of PMSP research over the years, including the latest studies, using an objective approach called Main Path Analysis (MPA). The search results are then subjected to Cluster Analysis (CA). The research findings indicate that for the future overall development trend of PMSP, it is advisable to consider improving metaheuristic algorithms for semiconductor issues involving multiple objective functions and multiple constraints. Among the top five sub-clusters, the one related to Sequence Dependent Setup Times can be further explored in the context of semiconductor issues, Batch Scheduling can consider dual objectives, Learning Effect and Deteriorating Operations can be addressed using hybrid metaheuristic algorithms, Approximation Algorithms can be considered for multi-objective problem solving, and On-line Scheduling can tackle the problem of increasing the number of machines. The presented results of the main path and development trajectories of PMSP and its sub-domains in this study can provide references for practical applications in relevant industries and for future research.

摘 要 i
Abstract ii
致謝 iv
目錄 v
表目錄 vii
圖目錄 viii
第一章 緒論 1
1.1 研究動機 1
1.2 研究目的 3
1.3 研究限制 4
1.4 文獻架構 4
第二章 文獻探討 6
2.1平行機排程問題 6
2.1.1平行機排程問題分類 6
2.1.2平行機排程三域符號說明 7
2.1.3平行機排程問題相關回顧文獻 8
2.2主路徑分析相關文獻 12
第三章 研究方法 16
3.1研究流程 16
3.2資料來源 17
3.3關鍵字搜索與資料彙集 17
3.4文獻篩選 18
3.5主路徑分析(Main Path Analysis) 20
3.6集群分析(Cluster Analysis) 26
3.7 h-index與g-index 30
3.8 軟體介紹 32
第四章 研究結果 37
4.1資料統計結果 37
4.1.1期刊統計排名 38
4.1.2作者統計排名 40
4.1.3國家統計排名 42
4.2平行機排程主路徑分析 43
4.2.1全域主路徑 43
4.2.2關鍵延伸主路徑 53
4.3 集群分析 58
4.3.1第一子集群—具序列相依整備時間 60
4.3.2 第二子集群—批次處理 62
4.3.3第三子集群—具有學習效應與退化性作業限制 65
4.3.4第四子集群—近似演算法 67
4.3.5第五子集群—線上排程 69
第五章 結論與建議 71
5.1研究結論 71
5.2未來研究建議 74
參考文獻 75
附錄 85

1.Fowler, J.W. and L. Monch, A survey of scheduling with parallel batch (p-batch) processing. European Journal of Operational Research, 2022. 298(1): p. 1-24.
2.Zhiyi, T. and L. Ling. Online scheduling on parallel machines: A survey. 2020.
3.Mokotoff, E., Parallel machine scheduling problems: A survey. Asia-Pacific Journal of Operational Research, 2001. 18(2): p. 193.
4.Cheng, T. and C. Sin, A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 1990. 47(3): p. 271-292.
5.McNaughton, R., Scheduling with Deadlines and Loss Functions. Management Science, 1959. 6(1): p. 1-12.
6.Baker, K.R. and D. Trietsch, Principles of sequencing and scheduling. 2013: John Wiley & Sons.
7.Silva, C. and J.M. Magalhaes, Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Computers & Industrial Engineering, 2006. 50(1-2): p. 76-89.
8.Hsieh, J.-C., P.-C. Chang, and L.-C. Hsu, Scheduling of drilling operations in printed circuit board factory. Computers & Industrial Engineering, 2003. 44(3): p. 461-473.
9.Kim, D.-W., K.-H. Kim, W. Jang, and F.F. Chen, Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer-Integrated Manufacturing, 2002. 18(3-4): p. 223-231.
10.Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.R. Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, in Annals of discrete mathematics. 1979, Elsevier. p. 287-326.
11.Ullman, J.D., NP-complete scheduling problems. Journal of Computer and System sciences, 1975. 10(3): p. 384-393.
12.Lenstra, J.K. and A. Rinnooy Kan, Complexity of scheduling under precedence constraints. Operations Research, 1978. 26(1): p. 22-35.
13.Hu, T.C., Parallel sequencing and assembly line problems. Operations Research, 1961. 9(6): p. 841-848.
14.Brucker, P., M.R. Garey, and D.S. Johnson, Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness. Mathematics of Operations Research, 1977. 2(3): p. 275-284.
15.Gonzalez, T., Optimal mean finish time preemptive schedules, in Technical Report 220. 1977, Computer Science Department, Pennsylvania State University Chichester.
16.Lawler, E.L., J.K. Lenstra, and A. Rinnooy Kan. Recent developments in deterministic sequencing and scheduling: a survey. in Deterministic and Stochastic Scheduling: Proceedings of the NATO Advanced Study and Research Institute on Theoretical Approaches to Scheduling Problems held in Durham, England, July 6–17, 1981. 1982. Springer.
17.Gabow, H.N., An almost-linear algorithm for two-processor scheduling. Journal of the ACM, 1982. 29(3): p. 766-780.
18.Gonzalez, T.F. and D.B. Johnson, A new algorithm for preemptive scheduling of trees. Journal of the ACM, 1980. 27(2): p. 287-312.
19.Chen, N. and C.L. Liu. On a class of scheduling algorithms for multiprocessors computing systems. in Parallel Processing: Proceedings of the Sagamore Computer Conference, August 20–23, 1974. 2005. Springer.
20.Coffman, E.G. and R.L. Graham, Optimal scheduling for two-processor systems. Acta Informatica, 1972. 1: p. 200-213.
21.Davida, G. and D. Linton. A new algorithm for the scheduling of tree structured tasks. in Proc. Conf. Inform. Sci. and Syst., Baltimore, MD. 1976.
22.Frenk, J.B.G. and A.R. Kan, The rate of convergence to optimality of the LPT rule. Discrete Applied Mathematics, 1986. 14(2): p. 187-197.
23.Frenk, J. and A. Rinnooy Kan, The asymptotic optimality of the LPT rule. Mathematics of Operations Research, 1987. 12(2): p. 241-254.
24.Dogramaci, A. and J. Surkis, Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Management Science, 1979. 25(12): p. 1208-1216.
25.Cheng, T., A heuristic for common due-date assignment and job scheduling on parallel machines. Journal of the Operational Research Society, 1989. 40(12): p. 1129-1135.
26.Elmaghraby, S.E. and S.H. Park, Scheduling jobs on a number of identical machines. AIIE Transactions, 1974. 6(1): p. 1-13.
27.Bruno, J., E.G. Coffman Jr, and R. Sethi, Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 1974. 17(7): p. 382-387.
28.Sethi, R., On the complexity of mean flow time scheduling. Mathematics of Operations Research, 1977. 2(4): p. 320-330.
29.Ecker, K. and R. Hirschberg. Task scheduling with restricted preemptions. in PARLE'93 Parallel Architectures and Languages Europe: 5th International PARLE Conference Munich, Germany, June 14–17, 1993 Proceedings 5. 1993. Springer.
30.Rothkopf, M.H., Scheduling independent tasks on parallel processors. Management Science, 1966. 12(5): p. 437-447.
31.Lawler, E.L. and J.M. Moore, A functional equation and its application to resource allocation and sequencing problems. Management Science, 1969. 16(1): p. 77-84.
32.Sahni, S.K., Algorithms for scheduling independent tasks. Journal of the ACM, 1976. 23(1): p. 116-127.
33.Lenstra, J.K. and A. Rinnooy Kan, An introduction to multiprocessor scheduling. Questiio, 1981. 5.
34.Leung, J.Y.-T., On scheduling independent tasks with restricted execution times. Operations Research, 1982. 30(1): p. 163-171.
35.Hübscher, R. and F. Glover, Applying tabu search with influential diversification to multiprocessor scheduling. Computers & Operations Research, 1994. 21(8): p. 877-884.
36.Kampke, T., Simulated annealing: use of a new tool in bin packing. Annals of Operations Research, 1988. 16: p. 327-332.
37.Frangioni, A., E. Necciari, and M.G. Scutellà, A multi-exchange neighborhood for minimum makespan machine. 2000, Università di Pisa.
38.Edis, E.B., C. Oguz, and I. Ozkarahan, Parallel machine scheduling with additional resources: Notation, classification, models and solution methods. European Journal of Operational Research, 2013. 230(3): p. 449-463.
39.Zhu, X. and W.E. Wilhelm, Scheduling and lot sizing with sequence-dependent setup: A literature review. IIE transactions, 2006. 38(11): p. 987-1007.
40.Allahverdi, A., The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research, 2015. 246(2): p. 345-378.
41.Adamu, M.O. and A.O. Adewumi, Minimizing the weighted number of tardy jobs on multiple machines: A review. Journal of Industrial & Management Optimization, 2016. 12(4): p. 1465.
42.Alidaee, B., H. Li, H. Wang, and K. Womer, Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension. Omega, 2021. 103: p. 102446.
43.Hummon, N.P. and P. Dereian, Connectivity in a citation network: The development of DNA theory. Social Networks, 1989. 11(1): p. 39-63.
44.Hummon, N.P. and K. Carley, Social networks as normal science∗. Social Networks, 1993. 15(1): p. 71-106.
45.Carley, K.M., N.P. Hummon, and M. Harty, Scientific Influence: An Analysis of the Main Path Structure in the Journal of Conflict Resolution. Knowledge, 1993. 14(4): p. 417-447.
46.Lucio‐Arias, D. and L. Leydesdorff, Main‐path analysis and path‐dependent transitions in HistCite™‐based historiograms. Journal of the American Society for Information Science and Technology, 2008. 59(12): p. 1948-1962.
47.Liu, J.S. and L.Y.Y. Lu, An integrated approach for main path analysis: Development of the Hirsch index as an example. Journal of the American Society for Information Science and Technology, 2012. 63(3): p. 528-542.
48.Chen, Y.B., J.S. Liu, and P. Lin, Recent trend in graphene for optoelectronics. Journal of Nanoparticle Research, 2013. 15(2).
49.Chuang, T.C., J.S. Liu, L.Y.Y. Lu, and Y. Lee, The main paths of medical tourism: From transplantation to beautification. Tourism Management, 2014. 45: p. 49-58.
50.Kim, J. and J. Shin, Mapping extended technological trajectories: integration of main path, derivative paths, and technology junctures. Scientometrics, 2018. 116(3): p. 1439-1459.
51.Yeo, W., S. Kim, J.M. Lee, and J. Kang, Aggregative and stochastic model of main path identification: A case study on graphene. Scientometrics, 2014. 98(1): p. 633-655.
52.Lu, L.Y.Y. and J.S. Liu, A novel approach to identify the major research themes and development trajectory: The case of patenting research. Technological Forecasting and Social Change, 2016. 103: p. 71-82.
53.Liu, J.S., L.Y.Y. Lu, and M.H.C. Ho, A few notes on main path analysis. Scientometrics, 2019. 119(1): p. 379-391.
54.Yu, D. and L. Sheng, Knowledge diffusion paths of blockchain domain: the main path analysis. Scientometrics, 2020. 125(1): p. 471-497.
55.Yu, D. and T. Pan, Tracing knowledge diffusion of TOPSIS: A historical perspective from citation network. Expert Systems with Applications, 2021. 168.
56.Yu, D. and T. Pan, Tracing the main path of interdisciplinary research considering citation preference: A case from blockchain domain. Journal of Informetrics, 2021. 15(2).
57.Yu, D. and L. Sheng, Influence difference main path analysis: Evidence from DNA and blockchain domain citation networks. Journal of Informetrics, 2021. 15(4).
58.Han, F., S. Yoon, N. Raghavan, and H. Park, Investigating Company’s Technical Development Directions Based on Internal Knowledge Inheritance and Inventor Capabilities: The Case of Samsung Electronics. Sustainability (Switzerland), 2022. 14(5).
59.鄧皓容, 口碑發展趨勢－學術論文之主路徑分析, in 科技管理所. 2012, 國立臺灣科技大學: 台北市. p. 64.
60.Batagelj, V., Efficient Algorithms for Citation Network Analysis. ArXiv, 2003. cs.DL/0309023.
61.Liu, J.S. and C.H. Kuan, A new approach for main path analysis: Decay in knowledge diffusion. Journal of the Association for Information Science and Technology, 2016. 67(2): p. 465-476.
62.Batagelj, V. and A. Mrvar, Pajek-program for large network analysis. Connections, 1998. 21(2): p. 47-57.
63.Girvan, M. and M.E.J. Newman, Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America, 2002. 99(12): p. 7821-7826.
64.Hirsch, J.E., An index to quantify an individual's scientific research output. Proceedings of the National Academy of Sciences of the United States of America, 2005. 102(46): p. 16569-16572.
65.Egghe, L., An Improvement of the h-index: The g-index. Scientometrics, 2006: p. 8-9.
66.White, D.R., V. Batagelj, and A. Mrvar, Anthropology: Analyzing large kinship and marriage networks with Pgraph and Pajek. Social Science Computer Review, 1999. 17(3): p. 245-274.
67.Van Eck, N.J. and L. Waltman, Software survey: VOSviewer, a computer program for bibliometric mapping. Scientometrics, 2010. 84(2): p. 523-538.
68.Ou, J., J.Y.T. Leung, and C.L. Li, Scheduling parallel machines with inclusive processing set restrictions. Naval Research Logistics, 2008. 55(4): p. 328-338.
69.Ji, M., J.Y. Wang, and W.C. Lee, Minimizing resource consumption on uniform parallel machines with a bound on makespan. Computers and Operations Research, 2013. 40(12): p. 2970-2974.
70.Zhao, Q. and J. Yuan, Bicriteria scheduling of equal length jobs on uniform parallel machines. Journal of Combinatorial Optimization, 2020. 39(3): p. 637-661.
71.Li, K., X. Zhang, J.Y.T. Leung, and S.L. Yang, Parallel machine scheduling problems in green manufacturing industry. Journal of Manufacturing Systems, 2016. 38: p. 98-106.
72.Wang, S. and M. Liu, Multi-objective optimization of parallel machine scheduling integrated with multi-resources preventive maintenance planning. Journal of Manufacturing Systems, 2015. 37: p. 182-192.
73.Hsu, C.J., W.H. Kuo, and D.L. Yang, Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects. Applied Mathematical Modelling, 2011. 35(3): p. 1492-1496.
74.Ying, K.C. and H.M. Cheng, Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic. Expert Systems with Applications, 2010. 37(4): p. 2848-2852.
75.Cheng, T.C.E. and H.G. Kahlbacher, The parallel-machine common due-date assignment and scheduling problem is NP-hard. Asia-Pacific Journal of Operational Research, 1992. 9: p. 235-238.
76.Cheng, T.C. and Z.L. Chen, Parallel-machine scheduling problems with earliness and tardiness penalties. Journal of the Operational Research Society, 1994. 45(6): p. 685-695.
77.Chen, Z.-L. and W.B. Powell, A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. European Journal of Operational Research, 1999. 116(1): p. 220-232.
78.Chen, Z.L. and C.Y. Lee, Parallel machine scheduling with a common due window. European Journal of Operational Research, 2002. 136(3): p. 512-527.
79.Janiak, A., W.A. Janiak, T. Krysiak, and T. Kwiatkowski, A survey on scheduling problems with due windows. European Journal of Operational Research, 2015. 242(2): p. 347-357.
80.Pereira Lopes, M.J. and J.M.V. de Carvalho, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times. European Journal of Operational Research, 2007. 176(3): p. 1508-1527.
81.Rocha, P.L., M.G. Ravetti, G.R. Mateus, and P.M. Pardalos, Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers and Operations Research, 2008. 35(4): p. 1250-1264.
82.Tavakkoli-Moghaddam, R., F. Taheri, M. Bazzazi, M. Izadi, and F. Sassani, Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Computers and Operations Research, 2009. 36(12): p. 3224-3230.
83.Gao, J., A novel artificial immune system for solving multiobjective scheduling problems subject to special process constraint. Computers and Industrial Engineering, 2010. 58(4): p. 602-609.
84.Lin, Y.K., J.W. Fowler, and M.E. Pfund, Multiple-objective heuristics for scheduling unrelated parallel machines. European Journal of Operational Research, 2013. 227(2): p. 239-253.
85.Lin, Y.K., M.E. Pfund, and J.W. Fowler, Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems. Computers and Operations Research, 2011. 38(6): p. 901-916.
86.Morton, T. and A. Vepsalainen, Priority rules and leadtime estimation for job shop scheduling with weighted tardiness costs. Management Science, 1987. 33: p. 1036-1047.
87.Lin, Y.-K. and F.-Y. Hsieh, Unrelated parallel machine scheduling with setup times and ready times. International Journal of Production Research, 2014. 52(4): p. 1200-1214.
88.Pfund, M., J.W. Fowler, A. Gadkari, and Y. Chen, Scheduling jobs on parallel machines with setup times and ready times. Computers & Industrial Engineering, 2008. 54(4): p. 764-782.
89.Behnamian, J., M. Zandieh, and S.F. Ghomi, Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm. Expert Systems with Applications, 2009. 36(6): p. 9637-9644.
90.Yilmaz Eroglu, D., H.C. Ozmutlu, and S. Ozmutlu, Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times. International Journal of Production Research, 2014. 52(19): p. 5841-5856.
91.Chang, P.-C. and S.-H. Chen, Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Applied Soft Computing, 2011. 11(1): p. 1263-1274.
92.Arnaout, J.-P., G. Rabadi, and R. Musa, A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Journal of Intelligent Manufacturing, 2010. 21: p. 693-701.
93.Baykasoglu, A. and F.B. Ozsoydan, Dynamic scheduling of parallel heat treatment furnaces: A case study at a manufacturing system. Journal of Manufacturing Systems, 2018. 46: p. 152-162.
94.Ezugwu, A.E., O.J. Adeleke, and S. Viriri, Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times. PloS one, 2018. 13(7): p. e0200030.
95.Ezugwu, A.E. and F. Akutsah, An improved firefly algorithm for the unrelated parallel machines scheduling problem with sequence-dependent setup times. IEEE Access, 2018. 6: p. 54459-54478.
96.Wang, M. and G. Pan, A novel imperialist competitive algorithm with multi-elite individuals guidance for multi-object unrelated parallel machine scheduling problem. IEEE Access, 2019. 7: p. 121223-121235.
97.Lei, D., Y. Yuan, and J. Cai, An improved artificial bee colony for multi-objective distributed unrelated parallel machine scheduling. International Journal of Production Research, 2021. 59(17): p. 5259-5271.
98.Ewees, A.A., M.A. Al-qaness, and M. Abd Elaziz, Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times. Applied Mathematical Modelling, 2021. 94: p. 285-305.
99.Chang, Y.-C., K.-H. Chang, and C.-P. Zheng, Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards. Mathematics, 2022. 10(13): p. 2305.
100.Xing, W. and J. Zhang, Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 2000. 103(1-3): p. 259-269.
101.Logendran, R. and F. Subur, Unrelated parallel machine scheduling with job splitting. IIE Transactions, 2004. 36(4): p. 359-372.
102.Logendran, R., B. McDonell, and B. Smucker, Scheduling unrelated parallel machines with sequence-dependent setups. Computers & Operations Research, 2007. 34(11): p. 3420-3438.
103.Jouhari, H., et al., Sine-cosine algorithm to enhance simulated annealing for unrelated parallel machine scheduling with setup times. Mathematics, 2019. 7(11): p. 1120.
104.Ezugwu, A.E., Enhanced symbiotic organisms search algorithm for unrelated parallel machines manufacturing scheduling with setup times. Knowledge-Based Systems, 2019. 172: p. 15-32.
105.Sarac, T. and B. Tutumlu, A mix integer programming model and solution approach to determine the optimum machine number in the unrelated parallel machine scheduling problem. Journal of the Faculty of Engineering and Architecture of Gazi University, 2022. 37(1).
106.Sarac, T. and B. Tutumlu, A bi-objective mathematical model for an unrelated parallel machine scheduling problem with job-splitting. Journal of the Faculty of Engineering and Architecture of Gazi University, 2022. 37(4): p. 2293-2308.
107.Chen, C., M. Fathi, M. Khakifirooz, and K. Wu, Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times. Computers & Industrial Engineering, 2022. 165: p. 107915.
108.Monch, L., H. Balasubramanian, J.W. Fowler, and M.E. Pfund, Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Computers & Operations Research, 2005. 32(11): p. 2731-2750.
109.Kashan, A.H., B. Karimi, and M. Jenabi, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Computers & Operations Research, 2008. 35(4): p. 1084-1098.
110.Damodaran, P., M.C. Velez-Gallego, and J. Maya, A GRASP approach for makespan minimization on parallel batch processing machines. Journal of Intelligent Manufacturing, 2011. 22: p. 767-777.
111.Gallego, M.C.V., Algorithms for scheduling parallel batch processing machines with non-identical job ready times. 2009, Florida International University.
112.Damodaran, P. and M.C. Velez-Gallego, A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times. Expert Systems with Applications, 2012. 39(1): p. 1451-1458.
113.Xu, R., H. Chen, and X. Li, A bi-objective scheduling problem on batch machines via a Pareto-based ant colony system. International Journal of Production Economics, 2013. 145(1): p. 371-386.
114.Jia, Z.-h. and J.Y.-T. Leung, A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes. European Journal of Operational Research, 2015. 240(3): p. 649-665.
115.Stutzle, T. and H.H. Hoos, MAX–MIN ant system. Future Generation Computer Systems, 2000. 16(8): p. 889-914.
116.Coffman, J., Edward G, M.R. Garey, and D.S. Johnson, An application of bin-packing to multiprocessor scheduling. SIAM Journal on Computing, 1978. 7(1): p. 1-17.
117.Arroyo, J.E.C. and J.Y.-T. Leung, Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times. Computers & Operations Research, 2017. 78: p. 117-128.
118.Arroyo, J.E.C. and J.Y.-T. Leung, An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times. Computers & Industrial Engineering, 2017. 105: p. 84-100.
119.Zhou, S., J. Xie, N. Du, and Y. Pang, A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes. Applied Mathematics and Computation, 2018. 334: p. 254-268.
120.Zhang, H., Z.-h. Jia, and K. Li, Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines. Computers & Operations Research, 2020. 117: p. 104889.
121.Dorigo, M., V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1996. 26(1): p. 29-41.
122.Li, K., H. Zhang, C. Chu, Z.-h. Jia, and Y. Wang, A bi-objective evolutionary algorithm for minimizing maximum lateness and total pollution cost on non-identical parallel batch processing machines. Computers & Industrial Engineering, 2022. 172: p. 108608.
123.Kang, L. and C.T. Ng, A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. International Journal of Production Economics, 2007. 109(1-2): p. 180-184.
124.Wang, X.-Y. and J.-J. Wang, Scheduling deteriorating jobs with a learning effect on unrelated parallel machines. Applied Mathematical Modelling, 2014. 38(21-22): p. 5231-5238.
125.Huang, X., M.-Z. Wang, and P. Ji, Parallel machines scheduling with deteriorating and learning effects. Optimization Letters, 2014. 8: p. 493-500.
126.Woo, Y.-B., S. Jung, and B.S. Kim, A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Computers & Industrial Engineering, 2017. 109: p. 179-190.
127.Woo, Y.-B. and B.S. Kim, Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Computers & Operations Research, 2018. 95: p. 97-112.
128.Ding, J., L. Shen, Z. Lu, and B. Peng, Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration. Computers & Operations Research, 2019. 103: p. 35-45.
129.Salehi Mir, M.S., J. Rezaeian, and H. Mohamadian, Scheduling parallel machine problem under general effects of deterioration and learning with past-sequence-dependent setup time: heuristic and meta-heuristic approaches. Soft Computing, 2020. 24: p. 1335-1355.
130.Kalaki Juybari, J., S. Kalaki Juybari, and R. Hasanzadeh, Parallel machines scheduling with time-dependent deterioration, using meta-heuristic algorithms. SN Applied Sciences, 2021. 3: p. 1-13.
131.Glass, C.A. and H. Kellerer, Parallel machine scheduling with job assignment restrictions. Naval Research Logistics, 2007. 54(3): p. 250-257.
132.Li, C.-L. and X. Wang, Scheduling parallel machines with inclusive processing set restrictions and job release times. European Journal of Operational Research, 2010. 200(3): p. 702-710.
133.Mastrolilli, M., Efficient approximation schemes for scheduling problems with release dates and delivery times. Journal of Scheduling, 2003. 6(6): p. 521-531.
134.Huo, Y. and J.Y.-T. Leung, Parallel machine scheduling with nested processing set restrictions. European Journal of Operational Research, 2010. 204(2): p. 229-236.
135.Huo, Y. and J.Y.-T. Leung, Fast approximation algorithms for job scheduling with processing set restrictions. Theoretical Computer Science, 2010. 411(44-46): p. 3947-3955.
136.Kellerer, H., V. Kotov, M.G. Speranza, and Z. Tuza, Semi on-line algorithms for the partition problem. Operations Research Letters, 1997. 21(5): p. 235-242.
137.Seiden, S., J. Sgall, and G. Woeginger, Semi-online scheduling with decreasing job sizes. Operations Research Letters, 2000. 27(5): p. 215-221.
138.He, Y. and Z. Tan, Ordinal on-line scheduling for maximizing the minimum machine completion time. Journal of Combinatorial Optimization, 2002. 6(2): p. 199-206.
139.Tan, Z. and Y. He, Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters, 2002. 30(6): p. 408-414.
140.Tan, Z. and Y. Wu, Optimal semi-online algorithms for machine covering. Theoretical Computer Science, 2007. 372(1): p. 69-80.
141.Jiang, X., K. Lee, and M.L. Pinedo, Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time. European Journal of Operational Research, 2023. 305(2): p. 594-607.
142.Jiang, Y., X. Tang, K. Li, T. Cheng, and M. Ji, Approximation algorithms for bi-objective parallel-machine scheduling in green manufacturing. Computers & Industrial Engineering, 2023. 176: p. 108949.