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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 47; no. 3; p. 34
Main Author:	Sun, Ruiqing
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.04.2024 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!