@inproceedings{274,
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.}},
author = {{Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}},
booktitle = {{Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}},
editor = {{Dehne, Frank and Sack, Jörg Rüdiger and Stege, Ulrike}},
pages = {{542----553}},
title = {{{Non-preemptive Scheduling on Machines with Setup Times}}},
doi = {{10.1007/978-3-319-21840-3_45}},
year = {{2015}},
}