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

Full description

Saved in:
Bibliographic Details
Published inCombinatorial Optimization and Applications Vol. 10043; pp. 608 - 623
Main Authors Chen, Lin, Jansen, Klaus, Luo, Wenchang, Zhang, Guochuan
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2016
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text

Cover

Loading…