Analysis of Genetic Algorithms for Job Shop Scheduling Problem with Set-up Time and Time Interval Due-date
碩士 === 元智大學 === 工業工程與管理學系 === 90 === Job shop scheduling problem (JSP) is an NP-hard problem that has been discussed by many researchers. Previous literature regarding JSP rarely concerns the constraints of machine set-up times and time interval due dates. The objective of this study is to develop s...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/57802230525042932163 |