An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints
In this paper, we consider the classical scheduling problem on parallel machines with capacity constraints. We are given m identical machines, where each machine k can process up to $$c_k$$ jobs. The goal is to assign the $$n\le \sum _{k=1}^{m}c_k$$ independent jobs on the machines subject to the ca...
Saved in:
Published in | Combinatorial Optimization and Applications Vol. 10043; pp. 608 - 623 |
---|---|
Main Authors | , , , |
Format | Book Chapter |
Language | English |
Published |
Switzerland
Springer International Publishing AG
2016
Springer International Publishing |
Series | Lecture Notes in Computer Science |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!