Scheduling multi-operation jobs for minimizing the sum of maximum earliness and tardiness on a single machine
碩士 === 中原大學 === 工業與系統工程研究所 === 97 === We consider the single machine multi-operation jobs scheduling problem. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches. A job completes when all of its operation...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48671448411187518361 |