[1] |
Pinedo M. Scheduling: theory, algorithms, and systems. Berlin Heidelberg: Springer, 2012. |
[2] |
Allahverdi A. Two-machine proportionate flowshop scheduling with breakdowns maximum lateness. Computers & Operations Research, 1996, 23(10): 909-916 |
[3] |
Lan X J, Su D D. Research of a mold job shop scheduling optimization based on particle swarm optimization algorithm. Applied Mechanics & Materials, 2015, 757(2): 201-207 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=10.4028/www.scientific.net/AMM.757.201 |
[4] |
Sang H Y, Duan P Y, Li J Q. An effective invasive weed optimization algorithm for scheduling semiconductor final testing problem. Swarm & Evolutionary Computation, 2018, 38: 42-53 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=f24ee1e67ed4add61940b0e69b5f0a53 |
[5] |
Hu H, Ng KKH, Qin Y C. Robust parallel machine scheduling problem with uncertainties and sequence-dependent setup time. Scientific Programming, 2016: 1-13 |
[6] |
Li C L, Cheng T C E. The parallel machine min-max weighted absolute lateness scheduling problem. Naval Research Logistics, 1994, 41(1): 33-46 doi: 10.1002/1520-6750(199402)41:1<33::AID-NAV3220410104>3.0.CO;2-S |
[7] |
Ranjbar M, Davari M, Leus R. Two branch-and-bound algorithms for the robust parallel machine scheduling problem. Computers & Operations Research, 2012, 39(7): 1652-1660 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=58dbb13e91377bee19b577c7d4561726 |
[8] |
Lee W C, Wang J Y, Lin M C. A branch-and-bound algorithm for minimizing the total weighted completion time on parallel identical machines with two competing agents. Knowledge-Based Systems, 2016, 105(C): 68-82 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=90998daca3d98ce1fbd2b119fbae1b4a |
[9] |
Wu L, Wang S. Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks. International Journal of Production Economics, 2018, 201: 26-40 doi: 10.1016/j.ijpe.2018.04.013 |
[10] |
Chen Z L, Powell W B. A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. European Journal of Operational Research, 1999, 116(1): 220-232 doi: 10.1016/S0377-2217(98)00136-2 |
[11] |
Yin Y, Ye D, Zhang G. Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval. Information Sciences, 2014, 274(8): 310-322 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=057211486faaa3fa789b3f4b9a751866 |
[12] |
Li D W, Lu X W. Two-agent parallel-machine scheduling with rejection. Theoretical Computer Science, 2017, 703: 66-75 doi: 10.1016/j.tcs.2017.09.004 |
[13] |
Yin Y, Cheng S R, Cheng T C E, et al. Just-in-time scheduling with two competing agents on unrelated parallel machines. Omega, 2016, 63: 41-47 doi: 10.1016/j.omega.2015.09.010 |
[14] |
Woo Y B, Jung S, Kim B S. 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: 179-190 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=f0a6c39ef977f0f9c653802880bf2420 |
[15] |
Avalos-Rosales O, Angel-Bello F, Alvarez A. Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. International Journal of Advanced Manufacturing Technology, 2015, 76(9-12): 1705-1718 doi: 10.1007/s00170-014-6390-6 |
[16] |
张嘉琦, 曹政才, 刘民.融合代理模型和差分进化算法的并行机动态调度方法.计算机集成制造系统, 2017, 23(1): 75-81 http://d.old.wanfangdata.com.cn/Periodical/jsjjczzxt201701009
Zhang Jia-Qi, Cao Zheng-Cai, Liu Min. Integrated differential evolution algorithm with surrogate model for dynamic parallel machine scheduling. Computer Integrated Manufacturing Systems, 2017, 23(1): 75-81 http://d.old.wanfangdata.com.cn/Periodical/jsjjczzxt201701009 |
[17] |
Chen C L. Iterated hybrid metaheuristic algorithms for unrelated parallel machines problem with unequal ready times and sequence-dependent setup times. International Journal of Advanced Manufacturing Technology, 2012, 60(5-8): 693-705 doi: 10.1007/s00170-011-3623-9 |
[18] |
Damodaran P, Diyadawagamage D A, Ghrayeb O. A particle swarm optimization algorithm for minimizing makespan of nonidentical parallel batch processing machines. International Journal of Advanced Manufacturing Technology, 2012, 58(9-12): 1131-1140 doi: 10.1007/s00170-011-3442-z |
[19] |
Diana R O M. An immune-inspired algorithm for an unrelated parallel machines$'$ scheduling problem with sequence and machine dependent setup-times for makespan minimisation. Neurocomputing, 2015, 163(C): 94-105 |
[20] |
Sels V, Coelho J, Dias A M, et al. Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. Computers & Operations Research, 2015, 53: 107-117 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=a7d0c31a9a95e9f1ce534a14dda1cdb2 |
[21] |
Bitar A, Yugma C, Roussel R. A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing. Journal of Scheduling, 2016, 19(4): 367-376 doi: 10.1007/s10951-014-0397-6 |
[22] |
Joo C M, Kim B S. Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability. Computers & Industrial Engineering, 2015, 85(C): 102-109 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=fcb17bbd465d8682d2400ec1e2f8025a |
[23] |
罗家祥, 唐立新.带释放时间的并行机调度.问题的ILS & SS算法.自动化学报, 2005, 31(6): 917-924 http://www.aas.net.cn/article/id/15921
Luo Jia-Xiang, Tang Li-Xin. A new ILS & SS algorithm for parallel-machine scheduling problem. Acta Automatica Sinica, 2005, 31(6): 917-924 http://www.aas.net.cn/article/id/15921 |
[24] |
Lin S W, Ying K C. ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. Computers & Operations Research, 2014, 51(3): 172-181 http://www.wanfangdata.com.cn/details/detail.do?_type=perio&id=5b16d15a9448bceeb8e453a1f542ce32 |
[25] |
Rao R V, Savsani V J. and Vakharia D P. Teaching- learning-based optimization: a novel method for constrained mechanical design optimization problems. Computer-Aided Design, 2011, 43(3): 303-315 doi: 10.1016/j.cad.2010.12.015 |
[26] |
Waghmare, G. Comments on "a note on teaching-learning-based optimization algorithm". Information Sciences, 2013, 229: 159-169 doi: 10.1016/j.ins.2012.11.009 |
[27] |
Shao S W, Pi D C, Shao Z. An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Applied Soft Computing, 2017, 61: 193-210 doi: 10.1016/j.asoc.2017.08.020 |
[28] |
Xu Y, Wang L, Wang S Y, et al. An effective teaching--learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time. Neurocomputing, 2015, 148: 260-268 doi: 10.1016/j.neucom.2013.10.042 |
[29] |
Shao S W, Pi D C, Shao Z. A hybrid discrete optimization algorithm based on teaching-probabilistic learning mechanism for no-wait flow shop scheduling. Knowledge-Based Systems, 2016, 107: 219-234 doi: 10.1016/j.knosys.2016.06.011 |
[30] |
Li J Q, Pan Q K, Mao K. A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems. Engineering Applications of Artificial Intelligence, 2015, 37: 279-292 doi: 10.1016/j.engappai.2014.09.015 |
[31] |
马永杰, 云文霞.遗传算法研究进展.计算机应用研究, 2012, 29(4): 1201-1206 doi: 10.3969/j.issn.1001-3695.2012.04.001
Ma Yong-Jie, Yun Wen-Xia. Research progress of genetic algorithm. Application Rehash of Computers, 2012, 29(4): 1201-1206 doi: 10.3969/j.issn.1001-3695.2012.04.001 |
[32] |
Abdoun O, Abouchabaka J. A comparative study of adaptive crossover operators for genetic algorithms to resolve the traveling salesman problem. Computer Science, 2011, 31(11): 49-57 |
[33] |
王凌, 钱斌.混合差分进化与调度算法.北京:清华大学出版社, 2012.
Wang Ling, Qian Bin. Hybrid differential evolution and scheduling algorithms. Beijing: Tsinghua University Press, 2012. |
[34] |
潘全科, 王凌, 赵保华.解决零空闲流水线调度问题的离散粒子群算法.控制与决策, 2008, 23(2): 191-194 doi: 10.3321/j.issn:1001-0920.2008.02.014
Pan Quan-Ke, Wang Ling, Zhao Bao-Hua. Discrete particle swarm optimization for no-idle flow shop problem. Control and Decision, 2008, 23(2): 191-194 doi: 10.3321/j.issn:1001-0920.2008.02.014 |