Single-machine Scheduling with Step-deteriorating Processing Times
碩士 === 國立暨南國際大學 === 資訊管理學系 === 91 === In this thesis, we study two single-machine scheduling problems. The processing time of a job is a non-linear step function of its starting time and due date. In the first problem, different due dates are assigned to the jobs and our goal is to minimi...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/64770633206108402984 |