A Genetic Local Search Algorithm for Flowshop Scheduling Problems
博士 === 國立中興大學 === 資訊科學與工程學系 === 97 === The flowshop scheduling problem (FSSP) is a very well-known scheduling problem. Over the past years, the researches on FSSP were aiming at the criterion of makespan minimization. Recently, the FSSP to total flowtime minimization has drawn more researchers’ atte...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/26168249249337274725 |