Scheduling of non-resumable deteriorating jobs on single machine with multiple maintenance periods
碩士 === 國立交通大學 === 工業工程與管理學系 === 100 === We consider a scheduling problem of non-resumable deteriorating jobs on a single machine with multiple maintenance periods. Our objective is to minimize the makespan. We show that the problem with two maintenance periods is NP-hard by reducing it to a double...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/22305673621159068701 |