A hybrid immune simulated annealing algorithm for the job shop scheduling problem

Adams, 1988, The shifting bottleneck procedure for job shop scheduling, Management Science, 34, 391, 10.1287/mnsc.34.3.391 Baptiste, 2001 El-Bouri, 1910, A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling, European Journal of Operational Research, 177, 1894, 10.1016/j.ejor.2005.12.013 Essa, 2008, A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem, Computers & Operations Research, 35, 2599, 10.1016/j.cor.2006.12.019 Fox, 2007, Industrial applications of the ant colony optimization algorithm, International Journal of Advanced Manufacturing Technology, 31, 805 Gao, 2007, A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems, Computers & Industrial Engineering, 53, 149, 10.1016/j.cie.2007.04.010 Gao, 2008, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, Computers & Operations Research, 35, 2892, 10.1016/j.cor.2007.01.001 Haq, 2007, A scatter search approach for general flowshop scheduling problem, International Journal of Advanced Manufacturing Technology, 31, 731 Hart, 2008, Application areas of AIS: the past, the present and the future, Applied Soft Computing, 8, 191, 10.1016/j.asoc.2006.12.004 He, 2008, Research of production scheduling algorithm based on bottleneck analysis Huang, 2008, Ant colony optimization combined with taboo search for the job shop scheduling problem, Computers & Operations Research, 35, 1030, 10.1016/j.cor.2006.07.003 Jain, 1999, Deterministic job-shop scheduling: past, present and future, European Journal of Operational Research, 113, 390, 10.1016/S0377-2217(98)00113-1 Jang, 1997 Jiao, 2000, A novel genetic algorithm based on immunity, IEEE Transactions on Systems, Man and Cybernetics, Part A, 30, 552, 10.1109/3468.867862 Kolonko, 1999, Some new results on simulated annealing applied to the job shop scheduling problem, European Journal of Operational Research, 113, 123, 10.1016/S0377-2217(97)00420-7 Lee, 2002, An immunity-based ant colony optimization algorithm for solving weapon–target assignment problem, Applied Soft Computing, 2, 39, 10.1016/S1568-4946(02)00027-3 Lei, 2008, Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems, International Journal of Advanced Manufacturing Technology, 37, 157, 10.1007/s00170-007-0945-8 Lenstra, 1977, Complexity of machine scheduling problems, Annals of Discrete Mathematics, 7, 343, 10.1016/S0167-5060(08)70743-X Möonch, 2007, Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops, European Journal of Operational Research, 177, 2100, 10.1016/j.ejor.2005.12.020 Nowicki, 2005, An advanced tabu search algorithm for the job shop problem, Journal of Scheduling, 8, 145, 10.1007/s10951-005-6364-5 Park, 1998, A systematic procedure for setting parameters in simulated annealing algorithms, Computers & Operations Research, 25, 207, 10.1016/S0305-0548(97)00054-3 Pelikan, 2002, A survey of optimization by building and using probabilistic models, Computational Optimization and Applications, 21, 5, 10.1023/A:1013500812258 Phan-Huy, 2000 Ponnambalam, 1999, A simulated annealing algorithm for job shop scheduling, Production Planning & Control, 10, 767, 10.1080/095372899232597 Rahimi-Vahed, 2008, A multi-objective scatter search for a bi-criteria no-wait flow shop scheduling problem, Engineering Optimization, 40, 331, 10.1080/03052150701732509 Sha, 2006, A hybrid particle swarm optimization for job shop scheduling problem, Computers & Industrial Engineering, 51, 791, 10.1016/j.cie.2006.09.002 Suresh, 2006, Pareto archived simulated annealing for job shop scheduling with multiple objectives, The International Journal of Advanced Manufacturing Technology, 29, 184, 10.1007/s00170-004-2492-x Tanev, 2004, Hybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: application service provider approach, Applied Soft Computing, 5, 87, 10.1016/j.asoc.2004.03.013 Tsutsui, 2002, Solving flow shop scheduling problems with probabilistic model-building genetic algorithms using edge histograms Varela, 2003, A knowledge-based evolutionary strategy for scheduling problems with bottlenecks, European Journal of Operational Research, 145, 57, 10.1016/S0377-2217(02)00205-9 Wolpert, 1997, No free lunch theorems for optimization, IEEE Transactions on Evolutionary Computation, 1, 67, 10.1109/4235.585893 Xia, 2006, A hybrid particle swarm optimization approach for the job-shop scheduling problem, International Journal of Advanced Manufacturing Technology, 29, 360, 10.1007/s00170-005-2513-4 Zhang, 2008, A very fast TS/SA algorithm for the job shop scheduling problem, Computers & Operations Research, 35, 282, 10.1016/j.cor.2006.02.024 Zuo, 2007, Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck, Journal of Systems, Engineering and Electronics, 18, 556, 10.1016/S1004-4132(07)60129-7