Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines

In this paper, we discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The objective is to minimize the weighted makespan of jobs, i.e., the maximum weighted completion time of jobs. This scheduling problem is a generalization of minimiz...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of combinatorial optimization Ročník 47; číslo 3; s. 34
Hlavný autor: Sun, Ruiqing
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer US 01.04.2024
Springer Nature B.V
Predmet:
Algorithms
Approximation
Combinatorics
Completion time
Convex and Discrete Geometry
Linear programming
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Polynomials
Scheduling
Theory of Computation
Fully polynomial time approximation scheme
Scheduling
Approximation algorithm
Weighted makespan
Efficient polynomial time approximation scheme
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!
Popis
Shrnutí:In this paper, we discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The objective is to minimize the weighted makespan of jobs, i.e., the maximum weighted completion time of jobs. This scheduling problem is a generalization of minimizing the makespan on parallel machine scheduling problem. We present a ( 2 - 1 m )-approximation algorithm and a randomized efficient polynomial time approximation scheme (EPTAS) for the problem. We also design a randomized fully polynomial time approximation scheme (FPTAS) for the special case when the number of machines is fixed.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1382-6905
1573-2886
DOI:10.1007/s10878-024-01118-w