haku: @indexterm Algorithms / yhteensä: 403
viite: 20 / 403
| Tekijä: | Sun, X. Morizawa, K. Nagasawa, H. |
| Otsikko: | Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling |
| Lehti: | European Journal of Operational Research
2003 : MAY, VOL. 146:3, p. 498-516 |
| Asiasana: | Operational research Heuristic methods Algorithms |
| Vapaa asiasana: | Parallel machines Makespan Flowshop scheduling |
| Kieli: | eng |
| Tiivistelmä: | The paper proposes a series of heuristic algorithms based on the basic idea of Johnson's algorithm. Gupta's idea, the theorem newly provided in this paper, and worst/difficult case analyses. Numerical experiments show that the proposed heuristic algorithms can solve all of the worst cases which cannot be solved by the existing heuristic algorithms, and can solve all of the 90 000 instances generated randomly, meaning that the proposed algorithms are powerful enough to solve the fixed, 3-machine, AFS problem. |
SCIMA