Non-Preemptive Scheduling on Machines with Setup Times
Data Structures and Algorithms
2015-04-28 v1
Abstract
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n, m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.
Cite
@article{arxiv.1504.07066,
title = {Non-Preemptive Scheduling on Machines with Setup Times},
author = {Alexander Mäcker and Manuel Malatyali and Friedhelm Meyer auf der Heide and Sören Riechers},
journal= {arXiv preprint arXiv:1504.07066},
year = {2015}
}
Comments
A conference version of this paper has been accepted for publication in the proceedings of the 14th Algorithms and Data Structures Symposium (WADS)