Operations Research Transactions >
2015 , Vol. 19 >Issue 3: 116 - 122
DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2015.03.014
Supply chain scheduling problem with multiple unavailability intervals on a single machine
Received date: 2015-05-25
Online published: 2015-09-15
We study a single-machine supply chain scheduling problem with multiple unavailability intervals of equal length. The machine processes jobs in availability intervals and the length of each availability interval is no more than a given constant. The completed jobs are delivered in batches to a customer by one vehicle without capacity restriction. Our objective is to minimize the sum of total delivery time and total delivery cost by scheduling the production and delivery of every job as well as the unavailability intervals. If the interrupted job is resumable, we obtain the optimal schedule in the polynomial time O(n^2). If the interrupted job is non-resumable, we prove that the problem is strongly NP-hard and present a 2-approximation algorithm.
FAN Jing, ZHANG Feng . Supply chain scheduling problem with multiple unavailability intervals on a single machine[J]. Operations Research Transactions, 2015 , 19(3) : 116 -122 . DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.014
/
| 〈 |
|
〉 |