Parallel-machine scheduling of deteriorating jobs with potential machine disruptions

We consider parallel-machine scheduling of deteriorating jobs in a disruptive environment in which some of the machines will become unavailable due to potential disruptions. This means that a disruption to some of the machines may occur at a particular time, which will last for a period of time with...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Omega (Oxford) Ročník 69; s. 17 - 28
Hlavní autoři: Yin, Yunqiang, Wang, Yan, Cheng, T.C.E., Liu, Wenqi, Li, Jinhai
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.06.2017
Témata:
Deteriorating jobs
Disruptive environment
Fully polynomial-time approximation scheme
Scheduling
Fully polynomial-time approximation scheme
Scheduling
Disruptive environment
Deteriorating jobs
ISSN:0305-0483, 1873-5274
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider parallel-machine scheduling of deteriorating jobs in a disruptive environment in which some of the machines will become unavailable due to potential disruptions. This means that a disruption to some of the machines may occur at a particular time, which will last for a period of time with a certain probability. If a job is disrupted during processing by a disrupted machine and it does not need (needs) to re-start after the machine becomes available again, it is called the resumable (non-resumable) case. By deteriorating jobs, we mean that the actual processing time of a job grows when it is scheduled for processing later because the machine efficiency deteriorates over time due to machine usage and aging. However, a repaired machine will return to its original state of efficiency. We consider two cases, namely performing maintenance immediately on the disrupted machine when a disruption occurs and not performing machine maintenance. In each case, the objective is to determine the optimal schedule to minimize the expected total completion time of the jobs in both non-resumable and resumable cases. We determine the computational complexity status of various cases of the problem, and provide pseudo-polynomial-time solution algorithms and fully polynomial-time approximation schemes for them, if viable. •We study parallel-machine scheduling of deteriorating jobs with disruptions.•A disruption to some of the machines may occur at a given time with a possibility.•The disruption duration will last for a period of time with a certain probability.•The objective is to minimize the expected total completion time.•Computational complexity status and efficient solution algorithms are provided.
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2016.07.006