Hybrid Particle Swarm Optimization for Stochastic Flow Shop Scheduling With No-wait Constraint
暂无分享,去创建一个
[1] F. Hamprecht. Introduction to Statistics , 2022 .
[2] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[3] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[4] T. Yang *,et al. Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors — a case study , 2004 .
[5] Peter B. Luh,et al. An effective approach for job-shop scheduling with uncertain processing requirements , 1999, IEEE Trans. Robotics Autom..
[6] Jacques Carlier,et al. Ordonnancements à contraintes disjonctives , 1978 .
[7] George L. Vairaktarakis,et al. Robust scheduling of a two-machine flow shop with uncertain processing times , 2000 .
[8] Chandrasekharan Rajendran,et al. A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .
[9] Hans Röck,et al. The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.
[10] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[11] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[12] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[13] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.