跳到主要內容

臺灣博碩士論文加值系統

(18.97.14.86) 您好!臺灣時間:2025/02/08 02:54
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:黃子奇
研究生(外文):HUANG, TZ-CHI
論文名稱:單機排程問題之主路徑分析
論文名稱(外文):Main Path Analysis for Single Machine Scheduling Problems
指導教授:應國卿應國卿引用關係
指導教授(外文):YING, KUO-CHING
口試委員:應國卿黃乾怡林詩偉
口試委員(外文):YING, KUO-CHINGHUANG, CHIEN-YILIN, SHIH-WEI
口試日期:2022-12-27
學位類別:碩士
校院名稱:國立臺北科技大學
系所名稱:工業工程與管理系
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2023
畢業學年度:111
語文別:中文
論文頁數:147
中文關鍵詞:單機排程問題主路徑分析集群分析
外文關鍵詞:Single Machine Scheduling ProblemMain Path AnalysisCluster Analysis
相關次數:
  • 被引用被引用:0
  • 點閱點閱:154
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
本研究以排程領域之子領域單機排程問題為研究主題,研究過去三十四年來單機排程問題研究的發展情況。本研究採用主路徑分析法進行系統性文獻回顧,目前使用主路徑分析方法之研究逐年增加,但在排程領域裡還未曾有人使用過,本研究為首次引入。本文透過關鍵字策略在Web of Science上搜集到4527篇論文,經過一系列的篩選最終剩下2904篇單機排程問題相關文獻,並以此做爲本研究的資料集進行主路徑分析。本文使用主路徑分析中總體主路徑和關鍵延伸主路徑,用以分析單機排程問題研究最重要發展主軸及發展過程中的關鍵延伸議題。研究結果將單機排程領域過去三十四年分成四個發展階段,分別說明每個時期所聚焦的議題、關鍵技術及特色。此外,本研究使用集群分析和關鍵字分析方法來探索單機排程領域的子領域發展情況,從中提取出最主要的五大子集群。最後,依據研究結果提出單機排程問題未來的研究方向。
This study focuses on the subdomain of single-machine scheduling problems in the field of scheduling. It investigates the development of single-machine scheduling problem research over the past 34 years. The research employs the method of main path analysis for a systematic literature review. Although the use of main path analysis has been increasing in research, it has not been previously applied in the scheduling field, making this study the first to introduce it. Through a keyword strategy, a total of 4,527 papers were collected from the Web of Science. After a series of screening processes, 2,904 relevant papers on single-machine scheduling problems remained, which were used as the dataset for the main path analysis in this study. Overall main paths and key extended main paths were used to analyze the most important development axes and critical extended issues in the research on single-machine scheduling problems. The study results divided the past 34 years of single-machine scheduling research into four development stages, explaining the focused issues, key technologies, and characteristics of each period. Additionally, cluster analysis and keyword analysis methods were used to explore the development of subdomains within the field of single-machine scheduling, resulting in the identification of the top five major subclusters. Finally, based on the research findings, future research directions for single-machine scheduling problems were proposed.
摘 要 i
ABSTRACT ii
誌 謝 iii
目 錄 iv
表目錄 vi
圖目錄 vii
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 2
1.3 研究限制 3
1.4 論文架構 3
第二章 文獻探討 6
2.1 主路徑分析 6
2.1.1引證網絡知識擴散模式 6
2.1.2 主路徑分析的發展 8
2.1.3演算方法 11
2.1.4 MPA的演算步驟及搜尋方法 15
2.1.5 MPA相關研究文獻 19
2.2單機排程問題定義及數學符號 22
第三章 研究方法 24
3.1研究流程 24
3.2資訊蒐集階段 26
3.2.1關鍵字選擇與檢索策略 26
3.2.2蒐集與整理文獻 26
3.3資料處理階段 29
3.3.1主路徑分析 29
3.3.2可視化MPA結果 32
3.4資訊分析與探索階段 35
3.4.1基礎敘述統計 35
3.4.2主路徑分析 35
3.4.3集群分析 36
3.4.4 VOSviewer關鍵字分析 39
第四章 研究結果 41
4.1敘述統計 41
4.2總體主路徑 49
4.2.1第一階段1987~1999年:SMSP上各種限制下的資源分配 50
4.2.2第二階段1999~2010年:在學習效應及群組技術下的SMSP 51
4.2.3第三階段:2010年至今:同時考慮學習和退化效應的SMSP 55
4.3關鍵延伸主路徑 60
4.3.1第一階段1987~2004年:聚焦在決定工單排序的SMSP 61
4.3.2第二階段2004~2010年:考慮學習效應的SMSP 63
4.3.3第三階段2010~2019年:三條獨立發展階段 64
4.3.4第四階段2019年至今:較爲發散階段 67
4.4集群分析與VOSviewer關鍵字分析 69
4.4.1集群一:在學習效應或退化效應下解決各類單機排程問題 72
4.4.2集群二:討論與提早延遲相關單機排程問題的各種方法論 76
4.4.3集群三:在各種方法及限制下求解保養活動之單機排程問題 89
4.4.4集群四:在各種方法及限制下求解延遲相關之單機排程問題 98
4.4.5集群五:使用各種代理人機制來解決各項單機排程問題 107
第五章 結論 119
5.1結論與貢獻 119
5.2未來展望 120
參考文獻 123
附錄 一 142
附錄 二 144

Abdul-Razaq, T., & Potts, C. (1988). Dynamic programming state-space relaxation for single-machine scheduling. Journal of the Operational Research Society, 39(2), 141-152.
Abdul-Razaq, T., Potts, C. N., & Van Wassenhove, L. N. (1990). A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics, 26(2-3), 235-253.
Adiri, I., Bruno, J., Frostig, E., & Rinnooy Kan, A. (1989). Single machine flow-time scheduling with a single breakdown. Acta Informatica, 26, 679-696.
Agnetis, A., de Pascale, G., & Pacciarelli, D. (2009). A Lagrangian approach to single-machine scheduling problems with two competing agents. Journal of Scheduling, 12(4), 401-415. https://doi.org/10.1007/s10951-008-0098-0
Ahmadizar, F., & Hosseini, L. (2011). A Novel Ant Colony Algorithm for the Single-Machine Total Weighted Tardiness Problem with Sequence Dependent Setup Times. International Journal of Computational Intelligence Systems, 4(4), 456-466. https://doi.org/10.1080/18756891.2011.9727804
Alidaee, B., & Womer, N. K. (1999). Scheduling with Time Dependent Processing Times: Review and Extensions. The Journal of the Operational Research Society, 50(7). https://doi.org/10.2307/3010325
Bai, J., Li, Z.-R., & Huang, X. (2012). Single-machine group scheduling with general deterioration and learning effects. Applied Mathematical Modelling, 36(3), 1267-1274. https://doi.org/10.1016/j.apm.2011.07.068
Bai, M., & Zhao, Y. (2019). A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint. Engineering Optimization, 52(8), 1313-1322. https://doi.org/10.1080/0305215x.2019.1650922
Baker, K. R., & Cole Smith, J. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6, 7-16.
Barbieri, N., Ghisetti, C., Gilli, M., Marin, G., & Nicolli, F. (2016). A Survey of the Literature on Environmental Innovation Based on Main Path Analysis. Journal of Economic Surveys, 30(3), 596-623. https://doi.org/10.1111/joes.12149
Batagelj, V. (2003). Efficient Algorithms for Citation Network Analysis. cs/0309023. Retrieved September 01, 2003, from https://ui.adsabs.harvard.edu/abs/2003cs........9023B
Batagelj, V., & Mrvar, A. (1998). Pajek-program for large network analysis. Connections, 21(2), 47-57.
Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173-178. https://doi.org/10.1016/s0377-2217(98)00246-x
Boland, N., Clement, R., & Waterer, H. (2016). A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems. INFORMS Journal on Computing, 28(1), 14-30. https://doi.org/10.1287/ijoc.2015.0661
Bülbül, K., Kaminsky, P., & Yano, C. (2007). Preemption in single machine earliness/tardiness scheduling. Journal of Scheduling, 10(4-5), 271-292. https://doi.org/10.1007/s10951-007-0028-6
Chen, C. (2000). Domain visualization for digital libraries. In 2000 IEEE Conference on Information Visualization. An International Conference on Computer Visualization and Graphics.
Chen, C.-L. (2019). Iterated population-based VND algorithms for single-machine scheduling with sequence-dependent setup times. Soft Computing, 23(11), 3627-3641. https://doi.org/10.1007/s00500-018-3014-3
Chen, W.-J. (2006). Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. Journal of the Operational Research Society, 57(4), 410-415.
Chen, Y., Su, L.-H., Tsai, Y.-C., Huang, S., & Chou, F.-D. (2019). Scheduling Jobs on a Single Machine With Dirt Cleaning Consideration to Minimize Total Completion Time. IEEE Access, 7, 22290-22300. https://doi.org/10.1109/access.2019.2898905
Cheng, T. C. E., Ng, C. T., & Yuan, J. J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188(2), 603-609. https://doi.org/10.1016/j.ejor.2007.04.040
Cheng, T., Wu, C., & Lee, W. (2008). Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects. Information Sciences, 178(11), 2476-2487. https://doi.org/10.1016/j.ins.2008.02.002
Conway, R. W., Maxwell, W. L., & Miller, L. W. (1971). Theory of scheduling, 1967. Addison-Wesley, Reading, Mass.[: 5] M. EISENBERG, TwO queues with changeover times, Operations Res.(2), 19, 386-401.
Eren, T., & Güner, E. (2007). A bicriteria scheduling problem with a learning effect: Total completion time and total tardiness. INFOR: Information Systems and Operational Research, 45(2), 75-81.
Fernandez-Viagas, V., & Costa, A. (2021). Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times. Swarm and Evolutionary Computation, 63. https://doi.org/10.1016/j.swevo.2021.100869
Freud, D., & Mosheiov, G. (2021). Scheduling with competing agents, total late work and job rejection. Computers & Operations Research, 133. https://doi.org/10.1016/j.cor.2021.105329
Fry, T. D., Armstrong, R. D., & Blackstone, J. H. (1987). Minimizing Weighted Absolute Deviation in Single Machine Scheduling. IIE Transactions, 19(4), 445-450. https://doi.org/10.1080/07408178708975418
Fry, T. D., Leong, G. K., & Rakes, T. R. (1987). Single machine scheduling: a comparison of two solution procedures. Omega, 15(4), 277-282.
Fu, H., Wang, M., Li, P., Jiang, S., Hu, W., Guo, X., & Cao, M. (2019). Tracing Knowledge Development Trajectories of the Internet of Things Domain: A Main Path Analysis. IEEE Transactions on Industrial Informatics, 15(12), 6531-6540. https://doi.org/10.1109/tii.2019.2929414
Gao, W.-J., Huang, X., & Wang, J.-B. (2009). Single-machine scheduling with precedence constraints and decreasing start-time dependent processing times. The International Journal of Advanced Manufacturing Technology, 46(1-4), 291-299. https://doi.org/10.1007/s00170-009-2089-5
Garfield, E., Sher, I. H., & Torpie, R. J. (1964). The use of citation data in writing the history of science.
Girvan, M., & Newman, M. E. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12), 7821-7826.
Goldengorin, B., & Romanuke, V. (2021a). Experimental analysis of tardiness in preemptive single machine scheduling. Expert Systems with Applications, 186. https://doi.org/10.1016/j.eswa.2021.114947
Goldengorin, B., & Romanuke, V. (2021b). Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness. Computers & Industrial Engineering, 155. https://doi.org/10.1016/j.cie.2020.107090
González, M. A., & Vela, C. R. (2015). An efficient memetic algorithm for total weighted tardiness minimization in a single machine with setups. Applied Soft Computing, 37, 506-518. https://doi.org/10.1016/j.asoc.2015.07.050
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of Discrete Mathematics (Vol. 5, pp. 287-326). Elsevier.Graves, G. H., & Lee, C. Y. (1999). Scheduling maintenance and semiresumable jobs on a single machine. Naval Research Logistics (NRL), 46(7), 845-863. https://doi.org/10.1002/(sici)1520-6750(199910)46:7<845::Aid-nav6>3.0.Co;2-#
Guo, Q., & Tang, L. (2015). An improved scatter search algorithm for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. Applied Soft Computing, 29, 184-195. https://doi.org/10.1016/j.asoc.2014.12.030
Gupta, S. K., & Kyparisis, J. (1987). Single machine scheduling research. Omega, 15(3), 207-227. https://doi.org/10.1016/0305-0483(87)90071-5
Hall, N. G., & Posner, M. E. (1991). Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date. Operations Research, 39(5), 836-846. https://doi.org/10.1287/opre.39.5.836
Hall, N. G., Kubiak, W., & Sethi, S. P. (1991). Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date. Operations Research, 39(5), 847-856. https://doi.org/10.1287/opre.39.5.847
He, H., Liu, M., & Wang, J.-B. (2015). Resource constrained scheduling with general truncated job-dependent learning effect. Journal of Combinatorial Optimization, 33(2), 626-644. https://doi.org/10.1007/s10878-015-9984-5
He, R., Yuan, J., Ng, C. T., & Cheng, T. C. E. (2021). Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work. Journal of Combinatorial Optimization, 41(2), 504-525. https://doi.org/10.1007/s10878-021-00697-2
Huang, S., Zhou, H., Tsai, Y.-C., Chen, Y., & Chou, F.-D. (2019). Minimizing the Total Weighted Completion Time of a Single Machine With Flexible Maintenance. IEEE Access, 7, 122164-122182. https://doi.org/10.1109/access.2019.2937812
Huang, X., & Wang, J. J. (2015). Machine scheduling problems with a position-dependent deterioration. Applied Mathematical Modelling, 39(10-11), 2897-2908. https://doi.org/10.1016/j.apm.2014.11.002
Huang, X., Wang, J.-B., & Wang, X.-R. (2009). A generalization for single-machine scheduling with deteriorating jobs to minimize earliness penalties. The International Journal of Advanced Manufacturing Technology, 47(9-12), 1225-1230. https://doi.org/10.1007/s00170-009-2242-1
Huang, X., Wang, M.-Z., & Wang, J.-B. (2011). Single-machine group scheduling with both learning effects and deteriorating jobs. Computers & Industrial Engineering, 60(4), 750-754. https://doi.org/10.1016/j.cie.2011.01.009
Hummon, N. P., & Doreian, P. (1989). Connectivity in a Citation Network - the Development of DNA Theory. Social Networks, 11(1), 39-63. https://doi.org/10.1016/0378-8733(89)90017-8
Hung, S. C., Liu, J. S., Lu, L. Y., & Tseng, Y. C. (2014). Technological change in lithium iron phosphate battery: the key-route main path analysis. Scientometrics, 100, 97-120.
Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness.
Jackson, J. R. (1957). Simulation research on job shop production. Naval Research Logistics Quarterly, 4(4), 287-295.
Jain, A. S., & Meeran, S. (1999). Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research, 113(2), 390-434.
Janiak, A. (1987). ONE-MACHINE SCHEDULING WITH ALLOCATION OF CONTINUOUSLY DIVISIBLE RESOURCE AND WITH NO PRECEDENCE CONSTRAINTS [Article]. Kybernetika, 23(4), 289-293.
Janiak, A. (1991). Single machine scheduling problem with a common deadline and resource dependent release dates. European Journal of Operational Research, 53(3), 317-325. https://doi.org/10.1016/0377-2217(91)90065-4
Janiak, A., & Li, C. L. (1994). Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption. Mathematical and Computer Modelling, 20(2), 53-58. https://doi.org/10.1016/0895-7177(94)90206-2
Jaramillo, F., & Erkoc, M. (2017). Minimizing total weighted tardiness and overtime costs for single machine preemptive scheduling. Computers & Industrial Engineering, 107, 109-119.
Jaramillo, F., Keles, B., & Erkoc, M. (2020). Modeling single machine preemptive scheduling problems for computational efficiency. Annals of Operations Research, 285(1-2), 197-222. https://doi.org/10.1007/s10479-019-03298-9
Jo, S. J., Jeung, C.-W., Park, S., & Yoon, H. J. (2009). Who is citing whom: Citation network analysis among HRD publications from 1990 to 2007. Human Resource Development Quarterly, 20(4), 503-537. https://doi.org/10.1002/hrdq.20023
Johnson, S. M. (1954). Optimal two‐and three‐stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61-68.
Jula, P., & Kones, I. (2012). Scheduling a single machine to maintain a dynamic WIP profile in coordinated manufacturing chains. The International Journal of Advanced Manufacturing Technology, 59(9-12), 1167-1179. https://doi.org/10.1007/s00170-011-3554-5
Jula, P., & Kones, I. (2013). Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains. International Journal of Production Research, 51(12), 3654-3670. https://doi.org/10.1080/00207543.2012.757666
Jula, P., & Rafiey, A. (2012). Coordinated scheduling of a single machine with sequence-dependent setup times and time-window constraints. International Journal of Production Research, 50(8), 2304-2320. https://doi.org/10.1080/00207543.2011.575089
Kacem, I. (2008). Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering, 54(3), 401-410. https://doi.org/10.1016/j.cie.2007.08.005
Kacem, I. (2009). Approximation algorithms for the Makespan minimization with positive tails on a single machine with a fixed non-availability interval. Journal of Combinatorial Optimization, 17(2), 117-133. https://doi.org/10.1007/s10878-007-9102-4
Kayhan, B. M., & Yildiz, G. (2021). Reinforcement learning applications to machine scheduling problems: a comprehensive literature review. Journal of Intelligent Manufacturing. https://doi.org/10.1007/s10845-021-01847-3
Kedad-Sidhoum, S., & Sourd, F. (2010). Fast neighborhood search for the single machine earliness–tardiness scheduling problem. Computers & Operations Research, 37(8), 1464-1471. https://doi.org/10.1016/j.cor.2009.11.002
Kim, K.-I., Xu, Y., & Pak, C.-J. (2020). Technological development trajectory of chromatography: main path analysis based on patent citation network. SN Applied Sciences, 2(12). https://doi.org/10.1007/s42452-020-03946-x
Kirlik, G., & Oguz, C. (2012). A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Computers & Operations Research, 39(7), 1506-1520. https://doi.org/10.1016/j.cor.2011.08.022
Kuo, W.-H., & Yang, D.-L. (2006). Single-machine group scheduling with a time-dependent learning effect. Computers & Operations Research, 33(8), 2099-2112. https://doi.org/10.1016/j.cor.2004.11.024
Lee, C.-Y., & Liman, S. D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica, 29, 375-382.
Lee, C.-Y., & Lin, C.-S. (2001). Single-machine scheduling with maintenance and repair rate-modifying activities. European Journal of Operational Research, 135(3), 493-513.
Lee, W.-C., Wu, C.-C., & Sung, H.-J. (2004). A bi-criterion single-machine scheduling problem with learning considerations. Acta Informatica, 40(4), 303-315. https://doi.org/10.1007/s00236-003-0132-9
Li, C.-L. (1994). Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions. Naval Research Logistics, 41(6), 807-819. https://doi.org/10.1002/1520-6750(199410)41:6<807::Aid-nav3220410609>3.0.Co;2-8
Li, C.-L., Sewell, E. C., & Cheng, T. C. E. (1995). Scheduling to minimize release-time resource consumption and tardiness penalties. Naval Research Logistics, 42(6), 949-966. https://doi.org/10.1002/1520-6750(199509)42:6<949::Aid-nav3220420607>3.0.Co;2-3
Li, S.-S., & Yuan, J.-J. (2020). Single-machine scheduling with multi-agents to minimize total weighted late work. Journal of Scheduling, 23(4), 497-512. https://doi.org/10.1007/s10951-020-00646-7
Li, S.-S., Chen, R.-X., & Tian, J. (2020). Multitasking scheduling problems with two competitive agents. Engineering Optimization, 52(11), 1940-1956. https://doi.org/10.1080/0305215x.2019.1678609
Liang, H., Wang, J.-J., Xue, Y., & Cui, X. (2016). IT outsourcing research from 1992 to 2013: A literature review based on main path analysis. Information & Management, 53(2), 227-251. https://doi.org/10.1016/j.im.2015.10.001
Liao, X., Zhang, H., Koshimura, M., Huang, R., Yu, W., Li, F., & Yazdi, M. (2021). Modeling and Solving Scheduling in Overloaded Situations with Weighted Partial MaxSAT. Mathematical Problems in Engineering, 2021, 1-17. https://doi.org/10.1155/2021/9615463
Liaw, C.-F. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers & Operations Research, 26(7), 679-693.
Liberati, A., Altman, D. G., Tetzlaff, J., Mulrow, C., Gotzsche, P. C., Ioannidis, J. P., Clarke, M., Devereaux, P. J., Kleijnen, J., & Moher, D. (2009). The PRISMA statement for reporting systematic reviews and meta-analyses of studies that evaluate health care interventions: explanation and elaboration. PLoS Med, 6(7), e1000100. https://doi.org/10.1371/journal.pmed.1000100
Liu, J. S., & Kuan, C.-H. (2016). A new approach for main path analysis: Decay in knowledge diffusion. Journal of the Association for Information Science and Technology, 67(2), 465-476. https://doi.org/10.1002/asi.23384
Liu, J. S., & Lu, L. Y. Y. (2012). 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, 63(3), 528-542. https://doi.org/10.1002/asi.21692
Liu, J. S., Lu, L. Y. Y., & Ho, M. H.-C. (2019). A few notes on main path analysis. Scientometrics, 119(1), 379-391. https://doi.org/10.1007/s11192-019-03034-x
Liu, P., Tang, L., & Zhou, X. (2010). Two-agent group scheduling with deteriorating jobs on a single machine. The International Journal of Advanced Manufacturing Technology, 47(5-8), 657-664. https://doi.org/10.1007/s00170-009-2224-3
Liu, S.-C., Duan, J., Lin, W.-C., Wu, W.-H., Kung, J.-Y., Chen, H., & Wu, C.-C. (2018). A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion. Asia-Pacific Journal of Operational Research, 35(05). https://doi.org/10.1142/s0217595918500379
Liu, W., & Jiang, C. (2019). Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation. Engineering Optimization, 52(1), 74-89. https://doi.org/10.1080/0305215x.2019.1580705
Liu, W., Wang, X., Wang, X., Zhao, P., & Yousefi, S. (2021). Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights. Mathematical Problems in Engineering, 2021, 1-8. https://doi.org/10.1155/2021/2232696
Low, C., Ji, M., Hsu, C.-J., & Su, C.-T. (2010). Minimizing the Makespan in a single machine scheduling problems with flexible and periodic maintenance. Applied Mathematical Modelling, 34(2), 334-342. https://doi.org/10.1016/j.apm.2009.04.014
Lu, Y.-Y., & Liu, J.-Y. (2017). A note on resource allocation scheduling with position-dependent workloads. Engineering Optimization, 50(10), 1810-1827. https://doi.org/10.1080/0305215x.2017.1414207
Lu, Y.-Y., Wang, J.-B., Ji, P., & He, H. (2017). A note on resource allocation scheduling with group technology and learning effects on a single machine. Engineering Optimization, 49(9), 1621-1632. https://doi.org/10.1080/0305215x.2016.1265305
Lu, Y.-Y., Wang, J.-J., & Huang, X. (2015). Scheduling jobs with position and sum-of-processing-time based processing times. Applied Mathematical Modelling, 39(14), 4013-4021. https://doi.org/10.1016/j.apm.2014.12.021
Lu, Y.-Y., Wei, C.-M., & Wang, J.-B. (2012). Several single-machine scheduling problems with general learning effects. Applied Mathematical Modelling, 36(11), 5650-5656. https://doi.org/10.1016/j.apm.2012.01.022
Martinelli, R., Mariano, F. C. M. Q., & Martins, C. B. (2022). Single machine scheduling in make to order environments: a systematic review. Computers & Industrial Engineering, 108190.
Meng, L., Chonghui, Z., Chenhong, Y., & Yujing, Y. (2021). Knowledge diffusion trajectories in the Pythagorean fuzzy field based on main path analysis. International Journal of Intelligent Computing and Cybernetics, 15(1), 124-143. https://doi.org/10.1108/ijicc-06-2021-0128
Mor, B. (2021). Single-machine lot scheduling with variable lot processing times. Engineering Optimization, 53(2), 321-334. https://doi.org/10.1080/0305215x.2020.1722119
Mor, B., & Mosheiov, G. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206(3), 540-546. https://doi.org/10.1016/j.ejor.2010.03.003
Mor, B., & Mosheiov, G. (2011). Single machine batch scheduling with two competing agents to minimize total flowtime. European Journal of Operational Research, 215(3), 524-531. https://doi.org/10.1016/j.ejor.2011.06.037
Mor, B., & Mosheiov, G. (2016). A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance. Journal of Combinatorial Optimization, 33(4), 1454-1468. https://doi.org/10.1007/s10878-016-0049-1
Mor, B., & Mosheiov, G. (2017). Minimizing maximum cost on a single machine with two competing agents and job rejection. Journal of the Operational Research Society, 67(12), 1524-1531. https://doi.org/10.1057/s41274-016-0003-8
Mor, B., & Mosheiov, G. (2021). A note on the single machine CON and CONW problems with lot scheduling. Journal of Combinatorial Optimization, 42(2), 327-338. https://doi.org/10.1007/s10878-021-00709-1
Mor, B., Mosheiov, G., & Shapira, D. (2021). Single machine lot scheduling with optional job-rejection. Journal of Combinatorial Optimization, 41(1), 1-11. https://doi.org/10.1007/s10878-020-00651-8
Mosheiov, G. (1991). V-Shaped Policies for Scheduling Deteriorating Jobs. Operations Research, 39(6), 979-991. https://doi.org/10.1287/opre.39.6.979
Mosheiov, G. (1994). Scheduling jobs under simple linear deterioration. Computers & Operations Research, 21(6), 653-659. https://doi.org/10.1016/0305-0548(94)90080-9
Mosheiov, G. (1995). Scheduling jobs with step-deterioration; Minimizing Makespan on a single- and multi-machine. Computers & Industrial Engineering, 28(4), 869-879. https://doi.org/10.1016/0360-8352(95)00006-m
Mosheiov, G. (1996). Λ-shaped policies to schedule deteriorating jobs. Journal of the Operational Research Society, 47(9), 1184-1191.
Mosheiov, G. (2001). Scheduling problems with a learning effect. European Journal of Operational Research, 132(3), 687-693. https://doi.org/10.1016/s0377-2217(00)00175-2
Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147(3), 665-670. https://doi.org/10.1016/s0377-2217(02)00358-2
Panwalkar, S., Smith, M., & Koulamas, C. (1993). A heuristic for the single machine tardiness problem. European Journal of Operational Research, 70(3), 304-310.
Pinedo, M. L. (2012). Scheduling (Vol. 29). Springer.
Potts, C. N., & Van Wassenhove, L. N. (1991). Single Machine Tardiness Sequencing Heuristics. IIE Transactions, 23(4), 346-354. https://doi.org/10.1080/07408179108963868
Qi, X. (2007). A note on worst-case performance of heuristics for maintenance scheduling problems. Discrete Applied Mathematics, 155(3), 416-422. https://doi.org/10.1016/j.dam.2006.06.005
Rudek, R. (2017). The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: Strongly NP-hard. Applied Mathematical Modelling, 50, 314-332. https://doi.org/10.1016/j.apm.2017.05.034
Russell, R. M., & Holsenback, J. E. (1997). Evaluation of leading heuristics for the single machine tardiness problem. European Journal of Operational Research, 96(3), 538-545.
Russell, R., & Holsenback, J. (1997). Evaluation of greedy, myopic and less-greedy heuristics for the single machine, total tardiness problem. Journal of the Operational Research Society, 48, 640-646.
Seidgar, H., Abedi, M., Tadayonirad, S., & Fazlollahtabar, H. (2015). A hybrid particle swarm optimisation for scheduling just-in-time single machine with preemption, machine idle time and unequal release times. International Journal of Production Research, 53(6), 1912-1935. https://doi.org/10.1080/00207543.2014.970705
Sen, T., Sulek, J. M., & Dileepan, P. (2003). Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. International Journal of Production Economics, 83(1), 1-12.
Shen, P., Wei, C.-M., & Wu, Y.-B. (2011). A note on deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. The International Journal of Advanced Manufacturing Technology, 58(5-8), 723-725. https://doi.org/10.1007/s00170-011-3400-9
Shokoufi, K., & Rezaeian, J. (2020). An exact solution approach using a novel concept for single machine preemptive scheduling problem in the just-in-time production system. Journal of Industrial and Production Engineering, 37(5), 215-228. https://doi.org/10.1080/21681015.2020.1772384
Smith, W. E. (1955). Various optimizers for single-stage production.
Sourd, F. (2005). Earliness–tardiness scheduling with setup considerations. Computers & Operations Research, 32(7), 1849-1865. https://doi.org/10.1016/j.cor.2003.12.002
Sourd, F. (2006). Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints. Operations Research Letters, 34(5), 591-598. https://doi.org/10.1016/j.orl.2005.06.005
Sourd, F. (2009). New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. INFORMS Journal on Computing, 21(1), 167-175. https://doi.org/10.1287/ijoc.1080.0287
Sourd, F., & Kedad-Sidhoum, S. (2008). A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling, 11(1), 49-58. https://doi.org/10.1007/s10951-007-0048-2
Su, L.-H., & Wang, H.-M. (2017). Minimizing total absolute deviation of job completion times on a single machine with cleaning activities. Computers & Industrial Engineering, 103, 242-249. https://doi.org/10.1016/j.cie.2016.11.009
Subramanian, A., Battarra, M., & Potts, C. N. (2014). An Iterated Local Search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times. International Journal of Production Research, 52(9), 2729-2742. https://doi.org/10.1080/00207543.2014.883472
Szwarc, W., & Mukhopadhyay, S. K. (1996). Earliness and tardiness single machine scheduling with proportional weights. Journal of Global Optimization, 9(3-4), 227-238.
Tanaka, S., & Araki, M. (2013). An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times. Computers & Operations Research, 40(1), 344-352. https://doi.org/10.1016/j.cor.2012.07.004
Tanaka, S., & Fujikuma, S. (2012). A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. Journal of Scheduling, 15(3), 347-361. https://doi.org/10.1007/s10951-011-0242-0
Tanaka, S., Fujikuma, S., & Araki, M. (2009). An exact algorithm for single-machine scheduling without machine idle time. Journal of Scheduling, 12(6), 575-593. https://doi.org/10.1007/s10951-008-0093-5
Tasgetiren, M. F., Pan, Q.-K., & Liang, Y.-C. (2009). A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. Computers & Operations Research, 36(6), 1900-1915.
Valente, J. M. S., & Alves, R. A. F. S. (2008). Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. Computers & Operations Research, 35(7), 2388-2405. https://doi.org/10.1016/j.cor.2006.11.004
van Eck, N. J., & Waltman, L. (2010). Software survey: VOSviewer, a computer program for bibliometric mapping. Scientometrics, 84(2), 523-538. https://doi.org/10.1007/s11192-009-0146-3
Vasilev, S. H., & Foote, B. L. (1997). On minimizing resource consumption with constraints on the Makespan and the total completion time. European Journal of Operational Research, 96(3), 612-621. https://doi.org/10.1016/s0377-2217(96)00095-1
Verhulst, P. (1845). La loi d’accroissement de la population. Nouveaux Memories de l’Académie Royale des Sciences et Belles-Lettres de Bruxelles, 18, 14-54.
Verspagen, B. (2007). Mapping Technological Trajectories as Patent Citation Networks: A Study on the History of Fuel Cell Research. Advances in Complex Systems, 10(01), 93-115. https://doi.org/10.1142/s0219525907000945
Wan, G., & Yen, B. P.-C. (2002). Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties. European Journal of Operational Research, 142(2), 271-281.
Wang, D.-J., Yin, Y., Cheng, S.-R., Cheng, T. C. E., & Wu, C.-C. (2016). Due date assignment and scheduling on a single machine with two competing agents. International Journal of Production Research, 54(4), 1152-1169. https://doi.org/10.1080/00207543.2015.1056317
Wang, J.-B., & Liang, X.-X. (2019). Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint. Engineering Optimization, 51(2), 231-246. https://doi.org/10.1080/0305215x.2018.1454442
Wang, J.-B., & Sun, L. (2009). Single-machine group scheduling with linearly decreasing time-dependent setup times and job processing times. The International Journal of Advanced Manufacturing Technology, 49(5-8), 765-772. https://doi.org/10.1007/s00170-009-2444-6
Wang, J.-B., & Wang, J.-J. (2015a). Research on scheduling with job-dependent learning effect and convex resource-dependent processing times. International Journal of Production Research, 53(19), 5826-5836. https://doi.org/10.1080/00207543.2015.1010746
Wang, J.-B., & Wang, J.-J. (2015b). Single-machine scheduling problems with precedence constraints and simple linear deterioration. Applied Mathematical Modelling, 39(3-4), 1172-1182. https://doi.org/10.1016/j.apm.2014.07.028
Wang, J.-B., Gao, W.-J., Wang, L.-Y., & Wang, D. (2008). Single machine group scheduling with general linear deterioration to minimize the Makespan. The International Journal of Advanced Manufacturing Technology, 43(1-2), 146-150. https://doi.org/10.1007/s00170-008-1667-2
Wang, J.-B., Huang, X., Wu, Y.-B., & Ji, P. (2011). Group scheduling with independent setup times, ready times, and deteriorating job processing times. The International Journal of Advanced Manufacturing Technology, 60(5-8), 643-649. https://doi.org/10.1007/s00170-011-3639-1
Wang, J.-B., Jiang, Y., & Wang, G. (2008). Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. The International Journal of Advanced Manufacturing Technology, 41(11-12), 1221.
Wang, J.-B., Lin, L., & Shan, F. (2008). Single-machine group scheduling problems with deteriorating jobs. The International Journal of Advanced Manufacturing Technology, 39(7-8), 808-812. https://doi.org/10.1007/s00170-007-1255-x
Wang, J.-B., Wang, L.-Y., Wang, D., & Wang, X.-Y. (2008). Single-machine scheduling with a time-dependent deterioration. The International Journal of Advanced Manufacturing Technology, 43(7-8), 805-809. https://doi.org/10.1007/s00170-008-1760-6
Wang, J.-J., & Liu, Y.-J. (2014). Single-machine bicriterion group scheduling with deteriorating setup times and job processing times. Applied Mathematics and Computation, 242, 309-314. https://doi.org/10.1016/j.amc.2014.05.048
Wang, W., Wang, J.-J., Wang, J.-B., & Xie, L. (2021). Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation. Complexity, 2021, 1-13. https://doi.org/10.1155/2021/6615824
Wang, X.-R., & Wang, J.-J. (2013). Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Applied Mathematical Modelling, 37(4), 2388-2393. https://doi.org/10.1016/j.apm.2012.05.025
Wang, X.-Y., & Wang, J.-J. (2013). Single-machine due date assignment problem with deteriorating jobs and resource-dependent processing times. The International Journal of Advanced Manufacturing Technology, 67(1-4), 255-260. https://doi.org/10.1007/s00170-013-4771-x
Wu, C.-C., & Lee, W.-C. (2003). Scheduling linear deteriorating jobs to minimize Makespan with an availability constraint on a single machine. Information Processing Letters, 87(2), 89-93. https://doi.org/10.1016/s0020-0190(03)00262-x
Wu, C.-C., Azzouz, A., Chen, J.-Y., Xu, J., Shen, W.-L., Lu, L., Ben Said, L., & Lin, W.-C. (2021). A two-agent one-machine multitasking scheduling problem solving by exact and metaheuristics. Complex & Intelligent Systems, 8(1), 199-212. https://doi.org/10.1007/s40747-021-00355-4
Wu, C.-C., Shiau, Y.-R., & Lee, W.-C. (2008). Single-machine group scheduling problems with deterioration consideration. Computers & Operations Research, 35(5), 1652-1659. https://doi.org/10.1016/j.cor.2006.09.008
Wu, W.-H., Xu, J., Wu, W.-H., Yin, Y., Cheng, I. F., & Wu, C.-C. (2013). A tabu method for a two-agent single-machine scheduling with deterioration jobs. Computers & Operations Research, 40(8), 2116-2127. https://doi.org/10.1016/j.cor.2013.02.025
Xu, D., Yin, Y., & Li, H. (2009). A note on "scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize Makespan". European Journal of Operational Research, 197(2), 825-827. https://doi.org/10.1016/j.ejor.2008.07.021
Xu, H., Lü, Z., & Cheng, T. C. E. (2013). Iterated Local Search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness. Journal of Scheduling, 17(3), 271-287. https://doi.org/10.1007/s10951-013-0351-z
Xu, H., Lü, Z., Yin, A., Shen, L., & Buscher, U. (2014). A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. Computers & Operations Research, 50, 47-60. https://doi.org/10.1016/j.cor.2014.04.009
Xu, Y.-T., Zhang, Y., & Huang, X. (2014). Single-machine ready times scheduling with group technology and proportional linear deterioration. Applied Mathematical Modelling, 38(1), 384-391. https://doi.org/10.1016/j.apm.2013.05.064
Yan, J., Tseng, F.-M., & Lu, L. Y. Y. (2018). Developmental trajectories of new energy vehicle research in economic management: Main path analysis. Technological Forecasting and Social Change, 137, 168-181. https://doi.org/10.1016/j.techfore.2018.07.040
Yang, S.-J. (2010). Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration. Applied Mathematics and Computation, 217(7), 3321-3329. https://doi.org/10.1016/j.amc.2010.08.064
Yang, S.-J., & Yang, D.-L. (2010). Single-machine group scheduling problems under the effects of deterioration and learning. Computers & Industrial Engineering, 58(4), 754-758. https://doi.org/10.1016/j.cie.2010.02.006
Yang, Y., Yin, G., Wang, C., & Yin, Y. (2020). Due date assignment and two-agent scheduling under multitasking environment. Journal of Combinatorial Optimization, 44(4), 2207-2223. https://doi.org/10.1007/s10878-020-00600-5
Yano, C. A., & Kim, Y.-D. (1991). Algorithms for a class of single-machine weighted tardiness and earliness problems. European Journal of Operational Research, 52(2), 167-178.
Yin, N., Kang, L., & Wang, X.-Y. (2014). Single-machine group scheduling with processing times dependent on position, starting time and allotted resource. Applied Mathematical Modelling, 38(19-20), 4602-4613. https://doi.org/10.1016/j.apm.2014.03.014
Yin, N., Wang, J.-B., Wang, D., Wang, L.-Y., & Wang, X.-Y. (2010). Deteriorating jobs and learning effects on a single-machine scheduling with past-sequence-dependent setup times. The International Journal of Advanced Manufacturing Technology, 46(5-8), 707-714.
Yin, Y., Cheng, S.-R., Cheng, T. C. E., Wu, C.-C., & Wu, W.-H. (2012). Two-agent single-machine scheduling with assignable due dates. Applied Mathematics and Computation, 219(4), 1674-1685. https://doi.org/10.1016/j.amc.2012.08.008
Yin, Y., Wang, W., Wang, D., & Cheng, T. C. E. (2017). Multi-agent single-machine scheduling and unrestricted due date assignment with a fixed machine unavailability interval. Computers & Industrial Engineering, 111, 202-215. https://doi.org/10.1016/j.cie.2017.07.013
Yin, Y., Wu, W.-H., Cheng, T. C. E., & Wu, C.-C. (2015). Single-machine scheduling with time-dependent and position-dependent deteriorating jobs. International Journal of Computer Integrated Manufacturing, 28(7), 781-790. https://doi.org/10.1080/0951192x.2014.900872
Yin, Y., Xu, J., Cheng, T. C. E., Wu, C.-C., & Wang, D.-J. (2016). Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work. Naval Research Logistics (NRL), 63(2), 172-183. https://doi.org/10.1002/nav.21684
Yin, Y., Yang, Y., Wang, D., Cheng, T. C. E., & Wu, C.-C. (2018). Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents. Naval Research Logistics (NRL), 65(5), 393-409. https://doi.org/10.1002/nav.21813
Yin, Y., Ye, D., & Zhang, G. (2014). Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval. Information Sciences, 274, 310-322. https://doi.org/10.1016/j.ins.2014.02.142
Ying, K.-C., Lu, C.-C., & Chen, J.-C. (2016). Exact algorithms for single-machine scheduling problems with a variable maintenance. Computers & Industrial Engineering, 98, 427-433. https://doi.org/10.1016/j.cie.2016.05.037
Yu, D., & Sheng, L. (2020). Knowledge diffusion paths of blockchain domain: the main path analysis. Scientometrics, 125(1), 471-497. https://doi.org/10.1007/s11192-020-03650-y
Yu, D., & Yan, Z. (2021). Knowledge diffusion of supply chain bullwhip effect: main path analysis and science mapping analysis. Scientometrics, 126(10), 8491-8515. https://doi.org/10.1007/s11192-021-04105-8
Yu, S., & Wu, Z. (2021). A three criteria scheduling problem with two competing agents. Computers & Industrial Engineering, 162. https://doi.org/10.1016/j.cie.2021.107754
Yuan, J., Shang, W., & Feng, Q. (2005). A note on the scheduling with two families of jobs. Journal of Scheduling, 8(6), 537-542.
Yung, J. W., Meyer, P. S., & Ausubel, J. H. (1999). The Loglet Lab software: a tutorial. Technological Forecasting and Social Change, 61(3), 273-295.
Zhang, B., Ma, L., & Liu, Z. (2020). Literature Trend Identification of Sustainable Technology Innovation: A Bibliometric Study Based on Co-Citation and Main Path Analysis. Sustainability, 12(20). https://doi.org/10.3390/su12208664
Zhang, B., Wu, D., Song, Y., Liu, K., & Xiong, J. (2020). A Novel Fast Parallel Batch Scheduling Algorithm for Solving the Independent Job Problem. Applied Sciences, 10(2). https://doi.org/10.3390/app10020460
Zhang, Y., Geng, Z., & Yuan, J. (2020). Two-Agent Pareto-Scheduling of Minimizing Total Weighted Completion Time and Total Weighted Late Work. Mathematics, 8(11). https://doi.org/10.3390/math8112070
Zhang, Y., Yuan, J., Ng, C. T., & Cheng, T. C. E. (2021). Pareto-optimization of three-agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work. Naval Research Logistics (NRL), 68(3), 378-393. https://doi.org/10.1002/nav.21961
Zhao, C., & Hsu, C.-J. (2019). Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs. Engineering Optimization, 51(11), 1938-1943. https://doi.org/10.1080/0305215x.2018.1558446
Zhou, H., Tsai, Y.-C., Huang, S., Chen, Y., Chou, F.-D., & Sahin, B. (2021). Single-Machine Scheduling with Fixed Periodic Preventive Maintenance to Minimize the Total Weighted Completion Times. Mathematical Problems in Engineering, 2021, 1-15. https://doi.org/10.1155/2021/8891322
Zhuge, H. (2002). A knowledge flow model for peer-to-peer team knowledge sharing and management. Expert Systems with Applications, 23(1), 23-30.
王亮傑 (2021)。以多準則決策法、技術探勘、主路徑分析、模糊背包問題及模糊能力集合擴展佈局半導體奈米線場效電晶體專利。國立臺灣師範大學,臺北。
吳濬志 (2016)。以學術引用文獻的主路徑分析探討資訊治理發展趨勢。銘傳大學,臺北。
李仲閔 (2021)。以專利引證和主路徑分析法預測關鍵技術趨勢-以燃料電池為例。中原大學,桃園縣。
李明益 (2021)。從學術文獻引用網絡的主路徑分析探討程式設計教育發展趨勢。銘傳大學,臺北。
李明彰 (2012)。以主路徑分析方法探討美國聯邦巡迴上訴法院判決書關鍵引用路徑之研究。國立雲林科技大學,雲林縣。
李建勳 (2016)。從學術引用文獻的主路徑分析探討遠距醫療發展趨勢。銘傳大學,臺北。
李雅琪 (2017)。醫療旅遊與電子旅遊文獻的知識擴散軌跡:主路徑分析法。元智大學,桃園縣。
李璟 (2016)。專利濫用理論之發展軌跡及趨勢:主路徑分析之觀點。國立臺灣科技大學,臺北。
周宛葶 (2019)。以主路徑分析方法探索入侵偵測與防禦系統之研究歷程。國防大學,桃園縣。
易尚潔 (2016)。衝動性購買行為研究發展趨勢:學術引用文獻的主路徑分析。銘傳大學,臺北。
林佳嫻 (2016)。關係資本在知識傳播扮演之角色-以情緒勞動研究為例。國立臺灣科技大學,臺北。
林鼎超 (2016)。從專利引證網路探討人造實境技術發展趨勢:主路徑分析法的應用。銘傳大學,臺北。
范氏梅花 (2019)。風力發電的研究軌跡:以主路徑分析為例。元智大學,桃園縣。
馬之駿 (2016)。由主路徑分析探討公司治理研究之演進。國立臺灣科技大學,臺北。
張家豪 (2020)。以主路徑分析方法探討廣告產業發展脈絡。國立臺灣科技大學,臺北。
張媛婷 (2016)。工作敬業:知識傳播軌跡與近年聚焦議題。國立臺灣科技大學,臺北。
張智珽 (2015)。回顧性論文在知識傳播中所扮演的角色:以電子旅遊文獻為例。國立臺灣科技大學,臺北。
許家瑜 (2022)。以主路徑分析法探討智慧交通系統之學術發展。國立臺北科技大學,臺北。
郭盈廷 (2021)。以專利探勘、主路徑分析、模糊背包問題與模糊能力集合擴展定義閘極全環場效電晶體之技術路徑圖。國立臺灣師範大學,臺北。
陳宇震 (2022)。專利之關鍵節點主路徑分析-以自動駕駛領域為例。國立臺灣科技大學,臺北。
陳有斌 (2013)。石墨烯光電應用研究之發展趨勢:學術論文之主路徑分析。國立臺灣科技大學,臺北。
陳紅玉 (2020)。生質能燃料電池學術研究軌跡-以主路徑分析為例。元智大學,桃園縣。
陳淑娟 (2021)。運用主路徑分析探討廣義的虛擬實境之演化。元智大學,桃園縣。
曾祐強 (2011)。磷酸鋰鐵電池發展趨勢—學術論文之主路徑分析。國立臺灣科技大學,臺北。
程意惟 (2018)。利用主路徑分析法探討新科技技術演變之管理意涵: 以石墨烯專利發展趨勢為例。國立臺灣科技大學,臺北。
黃偉棣 (2020)。以技術探勘、主路徑分析與多準則決策法分析次世代半導體製程與元件之鰭式場效電晶體專利。國立臺灣師範大學,臺北。
楊昌銓 (2022)。以主路徑分析方法探討數位支付之學術引文網絡發展趨勢。銘傳大學,臺北。
廖偲伃 (2021)。從專利主路徑分析觀察CAR-T技術在細胞基因治療的發展趨勢。國立臺灣科技大學,臺北。
廖章揚 (2021)。回顧儉樸創新研究:主路徑分析。國立臺灣科技大學,臺北。
劉顯仲 (2022年3月15號)。主路徑分析實務〔專題演講〕。於2022年臺灣科技大學,臺北市,台灣。
鄧皓容 (2012)。口碑發展趨勢-學術論文之主路徑分析。國立臺灣科技大學,臺北。
黎憶葶 (2022)。以主路徑分析法探討機器人的人機互動之發展趨勢。國立臺北科技大學,臺北。
蕭宇崴 (2016)。知識領空的繁星:以主路徑分析法探究手機設計專利之燦爛星海。國立臺灣科技大學,臺北。
蕭竣方 (2012)。負面口碑發展軌跡-學術論文之主路徑分析。國立臺灣科技大學,臺北。
賴長志 (2013)。染料敏化太陽能電池之主路徑分析。國立臺灣科技大學,臺北。
謝逸文 (2021)。使用主路徑分析探討停車場導航系統之技術演化-專利引用網路觀點。朝陽科技大學,臺中。
羅文瑜 (2021)。以主路徑分析觀點探索敏捷軟體開發學術研究之發展軌跡。國立臺灣科技大學,臺北。
羅文榮 (2021)。植基於主路徑與集群探討機器學習知識領域之研究。國防大學,桃園縣。
蘇威豪 (2022)。以主路徑分析來探討物聯網的發展軌跡與未來趨勢。國立臺北科技大學,臺北。

電子全文 電子全文(網際網路公開日期:20250725)
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊