Tabu search for Jumping No-Wait Flowshop scheduling problem to minimize makespan
碩士 === 國立交通大學 === 工業工程與管理學系 === 101 === Our study investigates the scheduling problem for the environment of Jumping No-Wait flowshop (JNWF), where jobs are not allowed to wait for machines during the production processes. In the production processes, all jobs are ordered visit a sequence of m mach...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65674159276119020862 |