[1]
|
R. F. Abdel-Kader, An improved PSO algorithm with genetic and neighborhood-based diversity operators for the job shop scheduling problem, Applied Artificial Intelligence, 32 (2018), 433-462.
doi: 10.1080/08839514.2018.1481903.
|
[2]
|
M. Amirghasemi and R. Zamani, An effective asexual genetic algorithm for solving the job shop scheduling problem, Computers & Industrial Engineering, 83 (2015), 123-138.
doi: 10.1016/j.cie.2015.02.011.
|
[3]
|
A. Elmi, M. Solimanpurb, S. Topaloglua and A. Elmic, A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant parts, Computers & Industrial Engineering, 61 (2011), 171-178.
doi: 10.1016/j.cie.2011.03.007.
|
[4]
|
J. E. Beasley, Or-library: Distributing test problems by electronic mail, J. of the Operational Research Society, 41 (1990), 1069-1072.
doi: 10.2307/2582903.
|
[5]
|
E. Cuevas, M. A. Díaz Cortés and D. A. O. Navarro, Advances of Evolutionary Computation: Methods and Operators, Studies in Computational Intelligence, 629, Springer, 2016, 9–33.
doi: 10.1007/978-3-319-28503-0.
|
[6]
|
E. Cuevas, M. Cienfuegos, R. Rojas and A. Padilla, Computational Intelligence Applications in Modeling and Control, Studies in Computational Intelligence, 575, Springer, 2015, 123–146.
doi: 10.1007/978-3-319-11017-2.
|
[7]
|
E. Cuevas, M. Cienfuegos, D. Zaldivar and M. Perez-Cisneros, A swarm optimization algorithm inspired in the behavior of the social-spider, Expert Systems with Applications, 40 (2013), 6374-6384.
doi: 10.1016/j.eswa.2013.05.041.
|
[8]
|
E. Cuevas, V. Osuna and D. Oliva, Evolutionary Computation Techniques: A Comparative Perspective, Studies in Computational Intelligence, 686 (2017), 65–93.
doi: 10.1007/978-3-319-51109-2.
|
[9]
|
T. K. Dao, T. S. Pan and J. S. Pan, Parallel bat algorithm for optimizing makespan in job shop scheduling problems, J. of Intelligent Manufacturing, 29 (2018), 451-462.
doi: 10.1007/s10845-015-1121-x.
|
[10]
|
N. Fiǧlali, C. Özkale, O. Engin A. and Fi ǧlali, Investigation of Ant System parameter interactions by using design of experiments for job-shop scheduling problems, Computers & Industrial Engineering, 56 (2009), 538-559.
doi: 10.1016/j.cie.2007.06.001.
|
[11]
|
H. Fisher and G. L. Thompson, Probabilistic learning combinations of local job-shop scheduling rules, in Industrial Scheduling, Prentice Hall, 1963, 225–251.
|
[12]
|
L. Gao, X. Li, X. Wen, C. Lu and F. Wen, A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem, Computers & Industrial Engineering, 88 (2015), 417-429.
doi: 10.1016/j.cie.2015.08.002.
|
[13]
|
A. S. Jain and S. Meeran, Deterministic job-shop scheduling: Past, present and future, European J. of Operational Research, 113 (1999), 390-434.
doi: 10.1016/S0377-2217(98)00113-1.
|
[14]
|
S. Kavitha, P. Venkumar, N. Rajini and P. Pitchipoo, An efficient social spider optimization for flexible job shop scheduling problem, J. of Advanced Manufacturing Systems, 17 (2018), 181-196.
doi: 10.1142/S0219686718500117.
|
[15]
|
M. Kurdi, A new hybrid island model genetic algorithm for job shop scheduling problem, Computers & Industrial Engineering, 88 (2015), 273-283.
doi: 10.1016/j.cie.2015.07.015.
|
[16]
|
M. Kurdi, A Social Spider Optimization Algorithm for Hybrid Flow Shop Scheduling with Multiprocessor Task, 12th International NCM Conference: Challenges in Industrial Engineering & Operation Management, 2018.
|
[17]
|
M. Kurdi, An effective genetic algorithm with a critical-path-guided Giffler and Thompson crossover operator for job shop scheduling problem, International J. of Intelligent Systems and Applications in Engineering, 7 (2019), 13-18.
doi: 10.18201/ijisae.2019751247.
|
[18]
|
M. Kurdi, An effective new island model genetic algorithm for job shop scheduling problem, Comput. Oper. Res., 67 (2016), 132-142.
doi: 10.1016/j.cor.2015.10.005.
|
[19]
|
M. Kurdi, An improved island model memetic algorithm with a new cooperation phase for multi-objective job shop scheduling problem, Computers & Industrial Engineering, 111 (2017), 183-201.
doi: 10.1016/j.cie.2017.07.021.
|
[20]
|
T.-L. Lin, S.-J. Horng, T.-W. Kao, Y-.H. Chen, R.-S. Run, R.-J. Chen, J.-L. Lai and I.-H. Kuo, An efficient job-shop scheduling algorithm based on particle swarm optimization, Expert Systems with Applications, 37 (2010), 2629-2636.
doi: 10.1016/j.eswa.2009.08.015.
|
[21]
|
M. Liu, Z.-J. Sun, J.-W. Yan and J.-S. Kang, An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem, Expert Systems with Applications, 38 (2011), 9248-9255.
doi: 10.1016/j.eswa.2011.01.136.
|
[22]
|
S. Lu, C. Sun and Z. Lu, An improved quantum-behaved particle swarm optimization method for short-term combined economic emission hydrothermal scheduling, Energy Conversion and Management, 51 (2010), 561-571.
doi: 10.1016/j.enconman.2009.10.024.
|
[23]
|
T. B. Lubin, The Evolution of Sociality in Spiders, Advances in the Study of Behavior, 37 (2007), 83-145.
doi: 10.1016/S0065-3454(07)37003-4.
|
[24]
|
A. Muthiah and R. Rajkumar, A novel algorithm for solving job-shop scheduling problem, Mechanika, 23 (2017), 610-617.
doi: 10.5755/j01.mech.23.4.14055.
|
[25]
|
B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri and M. Zandieh, Scheduling open shops with parallel machines to minimize total completion time, J. Comput. Appl. Math., 5 (2011), 1275-1287.
doi: 10.1016/j.cam.2010.08.013.
|
[26]
|
Y. Nagata and I. Ono, A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem, Comput. Oper. Res., 90 (2018), 60-71.
doi: 10.1016/j.cor.2017.09.017.
|
[27]
|
S. Ouadfel and A. Taleb-Ahmed, Social spiders optimization and flower pollination algorithm for multilevel image thresholding: A performance study, Expert Syst. with Applications, 55 (2016), 566-584.
doi: 10.1016/j.eswa.2016.02.024.
|
[28]
|
B. Peng, Z. Lü and T. C. E. Cheng, A tabu search/path relinking algorithm to solve the job shop scheduling problem, Comput. Oper. Res., 53 (2015), 154-164.
doi: 10.1016/j.cor.2014.08.006.
|
[29]
|
P. Pongchairerks, A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem, Complexity, 1 (2019), 1-11.
doi: 10.1155/2019/8683472.
|
[30]
|
A. Ponsich and C. A. Coello Coello, A hybrid Differential Evolution-Tabu Search algorithm for the solution of Job-Shop Scheduling Problems, Applied Soft Computing, 13 (2013), 462-474.
doi: 10.1016/j.asoc.2012.07.034.
|
[31]
|
R. Qing-dao-er-ji and Y. Wang, A new hybrid genetic algorithm for job shop scheduling problem, Comput. Oper. Res., 39 (2012), 2291-2299.
doi: 10.1016/j.cor.2011.12.005.
|
[32]
|
K. Rameshkumar and C. Rajendran, A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan, IOP Conference Series: Materials Science and Engineering, 310 (2018), 21-43.
doi: 10.1088/1757-899X/310/1/012143.
|
[33]
|
F. Ramezani and S. Lotfi, Social-Based Algorithm (SBA), Applied Soft Computing, 13 (2013), 2837-2856.
doi: 10.1016/j.asoc.2012.05.018.
|
[34]
|
R. Storn and K. Price, Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces, J. Global Optim., 11 (1997), 341-359.
doi: 10.1023/A:1008202821328.
|
[35]
|
C. J. Tan, S. C. Neoh, C. P. Lim, S. Hanoun, W. P. Wong, C. K. Loo and S. Nahavandi, Application of an evolutionary algorithm-based ensemble model to job-shop scheduling, J. of Intelligent Manufacturing, 30 (2019), 879-890.
doi: 10.1007/s10845-016-1291-1.
|
[36]
|
R. F. Tavares Neto and M. Godinho Filho, Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research, Engineering Applications of Artificial Intelligence, 26 (2013), 150-161.
doi: 10.1016/j.engappai.2012.03.011.
|
[37]
|
W. Teekeng and A. Thammano, Modified genetic algorithm for flexible job-shop scheduling problems, Procedia Computer Science, 12 (2012), 122-128.
doi: 10.1016/j.procs.2012.09.041.
|
[38]
|
C. M. Xiang, Observation on the flying habits of social spiders, Chinese J. of Zoology, 3 (1986), 11-11.
|
[39]
|
L.-N. Xing, Y.-W. Chen, P. Wang, Q.-S. Zhao and J. Xiong, A knowledge-based ant colony optimization for flexible job shop scheduling problems, Applied Soft Computing, 10 (2010), 888-896.
doi: 10.1016/j.asoc.2009.10.006.
|
[40]
|
R. Yusof, M. Khalid, G. T. Hui and S. M. Yusof, Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm, Applied Soft Computing, 11 (2011), 5782-5792.
doi: 10.1016/j.asoc.2011.01.046.
|
[41]
|
R. Zhang and C. Wu, A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective, Comput. Oper. Res., 38 (2011), 854-867.
doi: 10.1016/j.cor.2010.09.014.
|
[42]
|
G. Zobolas, C. D. Tarantilis and G. loannou, A hybrid evolutionary algorithm for the job shop scheduling problem, J. of the Oper. Res. Society, 60 (2009), 221-235.
doi: 10.1057/palgrave.jors.2602534.
|
[43]
|
G. I. Zobolas, C. D. Tarantilis and G. Ioannou, Exact, heuristic and meta-heuristic algorithms for solving job shop scheduling problems, in Metaheuristics for Scheduling in Industrial and Manufacturing Applications, Studies in Computational Intelligence, 2, Springer, Berlin, 2008, 19–40.
doi: 10.1007/978-3-540-78985-7_1.
|