Total completion time minimization on multiple machines subject to machine availability and makespan constraints

•We study bi-criteria scheduling with limited machine availability.•Our goal is to minimize ∑Cj subject to the condition that Cmax  ≤ T.•We show the problem, Pm(t)|m(t + Δ) ≥ m(t) − 1, r − a, prmt|∑Cj/Cmax  ≤ T, 0 ≤ Δ < ce: paraid = "para0005" > is in P. This paper studies preemptive...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 243; číslo 2; s. 547 - 554
Hlavní autori: Huo, Yumei, Zhao, Hairong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.06.2015
Elsevier Sequoia S.A
Predmet:
Bi-criteria
Limited machine availability
Operations research
Optimization algorithms
Parallel machine
Polynomial time algorithm
Polynomials
Production scheduling
Scheduling
Studies
Parallel machine
Limited machine availability
Scheduling
Bi-criteria
Polynomial time algorithm
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•We study bi-criteria scheduling with limited machine availability.•Our goal is to minimize ∑Cj subject to the condition that Cmax  ≤ T.•We show the problem, Pm(t)|m(t + Δ) ≥ m(t) − 1, r − a, prmt|∑Cj/Cmax  ≤ T, 0 ≤ Δ < ce: paraid = "para0005" > is in P. This paper studies preemptive bi-criteria scheduling on m parallel machines with machine unavailable intervals. The goal is to minimize the total completion time subject to the constraint that the makespan is at most a constant T. We study the unavailability model such that the number of available machines cannot go down by 2 within any period of pmax  where pmax  is the maximum processing time among all jobs. We show that there is an optimal polynomial time algorithm.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2014.12.012