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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical methods of operations research (Heidelberg, Germany) Vol. 101; no. 3; pp. 507 - 528
Main Authors:	Fu, Bin, Huo, Yumei, Zhao, Hairong
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2025 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!