Bicriteria scheduling of equal length jobs on uniform parallel machines

We study the bicriteria scheduling of equal length jobs on uniform parallel machines. By introducing a new scheduling model, called single-machine scheduling with generated completion times (shortly, GCT-scheduling), we show that the scheduling of equal length jobs on uniform parallel machines can b...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of combinatorial optimization Ročník 39; číslo 3; s. 637 - 661
Hlavní autori:	Zhao, Qiulan, Yuan, Jinjiang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2020 Springer Nature B.V
Predmet:	Combinatorics Completion time Convex and Discrete Geometry Job shops Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Production scheduling Sarin Scheduling Theory of Computation Uniform parallel machines NP-hardness Generated completion times Bicriteria scheduling Polynomial time algorithm
ISSN:	1382-6905, 1573-2886
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!