On multi-objective job shop scheduling problem with time window – Dynamic time window selection ant colony optimization
碩士 === 輔仁大學 === 管理學研究所 === 97 === Job shop scheduling problem (JSP) is the most complex situation among all, and JSP is also the most common situation in practical situation. Generally, JSP can be solved by integer programming (IP) for optimal solution, but the time consumed rises rapidly as the pr...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/51566062731613459510 |