Job-Shop Scheduling Problem with Minimum and Maximum Time Lags
碩士 === 國立中央大學 === 工業管理研究所 === 100 === We consider the job shop scheduling problem with minimum and maximum time lags while minimizing the makespan. This problem is common in a manufacturing environment where the next job has to be carried out within a specific time range after the completion of the...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/74095521690716606496 |