The 2-valued case of makespan minimization with assignment constraints
Abstract
We consider the following special case of minimizing makespan. A set of jobs J and a set of machines M are given. Each job j ∈ J can be scheduled on a machine from a subset Mj of M. The processing time of j is the same on all machines in Mj. The jobs are of two sizes, namely b (big) and s (small). We present a polynomial-time algorithm that approximates the value of the optimal makespan within a factor of 1.883 and some further improvements when every job can be scheduled on at most two machines.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.