- 期刊
A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption
延伸閱讀
- Hsu, H. C. (2012). Parallel Machine Scheduling with Machine Availability,Eligibility and Job Incompatible Constraints [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-1903201314443181
- 沈偉綸（2019）。A study of multitasking scheduling problem with two agents on a single-machine environment〔碩士論文，逢甲大學〕。華藝線上圖書館。https://doi.org/10.6341/fcu.M0705918
- 林淑雁（2016）。A Branch-and-Bound Algorithm to Minimize Total Completion Time on Identical Parallel Machines for Scheduling Preemptive jobs With Release Dates〔碩士論文，朝陽科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0078-1108201714020302
- 何嘉展（2016）。A Branch-and-Bound Algorithm for Scheduling Preemptive Identical Parallel Machines to MinimizeTotal Tardiness Problems〔碩士論文，朝陽科技大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0078-1108201714032650
- Su, L. H. (2002). Scheduling for Parallel Machines Systems. 中原學報, 30(3), 339-347. https://doi.org/10.6358/JCYU.200209.0339