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

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!