The 2-valued case of makespan minimization with assignment constraints
Data Structures and Algorithms
2012-12-10 v1
Abstract
We consider the following special case of minimizing makespan. A set of jobs and a set of machines are given. Each job can be scheduled on a machine from a subset of . The processing time of is the same on all machines in The jobs are of two sizes, namely (big) and (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.
Keywords
Cite
@article{arxiv.1212.1609,
title = {The 2-valued case of makespan minimization with assignment constraints},
author = {Stavros G. Kolliopoulos and Yannis Moysoglou},
journal= {arXiv preprint arXiv:1212.1609},
year = {2012}
}
Comments
8 pages, 1 figure, to appear in Information Processing Letters