Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time

•Bicriteria scheduling problems on identical parallel machines.•Simultaneous optimization of the two objectives: the makespan and the total completion time.•Developing approximation algorithms relative to each objective’s optimal value.•A tradeoff curve of the approximation ratio.•Lower bound of the...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 305; číslo 2; s. 594 - 607
Hlavní autori:	Jiang, Xiaojuan, Lee, Kangbok, Pinedo, Michael L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.03.2023
Predmet:	Approximation algorithm Inapproximability Makespan Scheduling Total completion time Scheduling Makespan Approximation algorithm Total completion time Inapproximability
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!