Notice of Retraction Estimation of distribution algorithms for no-wait flow shop problem
| Autor: | Mu-lin Wu, Juan Zou, Jinhua Zheng, Wen-pan Liu |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Mathematical optimization
Job shop scheduling Computational complexity theory business.industry Computer science Scheduling (production processes) Processor scheduling A* search algorithm Flow shop scheduling Evolutionary computation law.invention Reduction (complexity) Estimation of distribution algorithm law Genetic algorithm Local search (optimization) Algorithm design business |
| Zdroj: | 2011 Seventh International Conference on Natural Computation. |
| DOI: | 10.1109/icnc.2011.6022405 |
| Popis: | No-wait flow shop scheduling (NWFS) problem is an important area in production scheduling, we applied estimation of distribution algorithms, to solve the NWFS problem. To compute the makespan fast, we prove a characteristic of NWFS, then proposed a algorithm with a O(n) computation complexity depend on the characteristic. A modified insert move local search method which can weaken the negative effect generated by greedy is combined with estimation of distribution algorithms to gain a reduction of the makespan, which accelerate the search close to good solution. The effectiveness of the algorithm is proved by the experiment. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|