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ženo v:
Podrobná bibliografie
Vydáno v:Mathematical methods of operations research (Heidelberg, Germany) Ročník 101; číslo 3; s. 507 - 528
Hlavní autoři: Fu, Bin, Huo, Yumei, Zhao, Hairong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2025
Springer Nature B.V
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 times of all jobs differ by no more than a constant factor c . We develop the first sublinear time approximation scheme for this problem when the number of machines m is at most . We then extend our algorithm to the more general problem where the largest jobs have processing times that differ by no more than c factor for some constant , . When , our algorithm is a randomized -approximation scheme that runs in sublinear time. We further generalize our algorithms to the scheduling problems with precedence constraints where the precedence graph has a bounded depth h . Our work not only provides an algorithmic solution to the studied scheduling problem under big data environment, but also gives a methodological framework for designing sublinear time approximation algorithms for other scheduling problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-2994
1432-5217
DOI:10.1007/s00186-025-00898-z