Sublinear time approximation schemes for makespan minimization on parallel machines

We study sublinear time algorithms for the classical makespan minimization problem of scheduling n jobs on m parallel machines. Under uniform random sampling setting, we consider the problem with constrained processing times, which remains NP-hard. We first consider the problem where the processing...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Mathematical methods of operations research (Heidelberg, Germany) Ročník 101; číslo 3; s. 507 - 528
Hlavní autori:	Fu, Bin, Huo, Yumei, Zhao, Hairong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2025 Springer Nature B.V
Predmet:	Algorithms Approximation Business and Management Calculus of Variations and Optimal Control; Optimization Manufacturers Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Original Article Precedence constraints Random sampling Scheduling Parallel machine Sublinear time algorithms Precedence constraints Makespan minimization Uniform sampling
ISSN:	1432-2994, 1432-5217
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!