A hybrid particle swarm optimization for parallel machine total tardiness scheduling
暂无分享,去创建一个
Ling Wang | Qun Niu | Taijin Zhou | Ling Wang | Qun Niu | Taijin Zhou
[1] Balasubramaniam Natarajan,et al. Multi-objective and constrained optimization for DS-CDMA code design based on the clonal selection principle , 2008, Appl. Soft Comput..
[2] Salah E. Elmaghraby,et al. On the Scheduling of Jobs on a Number of Identical Machines. , 1972 .
[3] H. Igarashi,et al. A clonal selection algorithm for optimization in electromagnetics , 2005, IEEE Transactions on Magnetics.
[4] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[5] Chengbin Chu,et al. Parallel machine scheduling to minimize total tardiness , 2002 .
[6] Hyun Joon Shin,et al. Scheduling jobs on parallel machines: a restricted tabu search approach , 2003 .
[7] M. Azizoglu,et al. Tardiness minimization on parallel machines , 1998 .
[8] Shunji Tanaka,et al. A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines , 2008 .
[9] Marshall L. Fisher,et al. A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..
[10] Andrew Wirth,et al. Heuristic methods for the identical parallel machine flowtime problem with set-up times , 2005, Comput. Oper. Res..
[11] A. Doğramaci. Production scheduling of independent jobs on parallel identical processors , 1984 .
[12] Gisbert Schneider,et al. Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training , 2006, BMC Bioinformatics.
[13] Manoj Kumar Tiwari,et al. Interactive Particle Swarm: A Pareto-Adaptive Metaheuristic to Multiobjective Optimization , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.
[14] James G. Root. Scheduling with Deadlines and Loss Functions on k Parallel Machines , 1965 .
[15] E. Biscaia,et al. The use of particle swarm optimization for dynamical analysis in chemical processes , 2002 .
[16] J. J. Brennan,et al. An Improved Algorithm for Scheduling Jobs on Identical Machines , 1977 .
[17] Julius Surkis,et al. Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors , 1979 .
[18] Funda Sivrikaya-Serifoglu,et al. Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..
[19] Mehmet Fatih Tasgetiren,et al. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..
[20] Christos Koulamas. Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem , 1997 .
[21] J. D. Irwin,et al. An Improved Method for Scheduling Independent Tasks , 1971 .
[22] Manoj Kumar Tiwari,et al. Psycho-Clonal algorithm based approach to solve continuous flow shop scheduling problem , 2006, Expert Syst. Appl..
[23] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[24] V. Selladurai,et al. Workflow balancing in parallel machines through genetic algorithm , 2007 .
[25] Patrizia Beraldi,et al. Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs , 2008, Comput. Oper. Res..
[26] Fernando José Von Zuben,et al. Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..
[27] Ali Husseinzadeh Kashan,et al. A discrete particle swarm optimization algorithm for scheduling parallel machines , 2009, Computers & industrial engineering.
[28] Pin Luarn,et al. A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..
[29] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[30] Yih-Long Chang,et al. Heuristics for minimizing mean tardiness form parallel machines , 1991 .
[31] Zheng Tang,et al. A Novel Clonal Selection Algorithm and its Application , 2007, 2008 International Conference on Apperceiving Computing and Intelligence Analysis.
[32] Ling Wang,et al. An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..
[33] James Kennedy,et al. Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.
[34] Yanchun Liang,et al. Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems , 2008 .
[35] Thakshila Wimalajeewa,et al. Optimal Power Scheduling for Correlated Data Fusion in Wireless Sensor Networks via Constrained PSO , 2008, IEEE Transactions on Wireless Communications.
[36] Massimo Paolucci,et al. Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach , 2007, Comput. Oper. Res..
[37] Furkan Kiraç,et al. A tabu search algorithm for parallel machine total tardiness problem , 2004, Comput. Oper. Res..
[38] Paul R. Drake,et al. Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms , 2009 .
[39] Peter Chen,et al. A simulated annealing approach to makespan minimization on identical parallel machines , 2006 .
[40] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .