--- res: bibo_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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Alexander foaf_name: Mäcker, Alexander foaf_surname: Mäcker foaf_workInfoHomepage: http://www.librecat.org/personId=13536 - foaf_Person: foaf_givenName: Manuel foaf_name: Malatyali, Manuel foaf_surname: Malatyali - foaf_Person: foaf_givenName: Friedhelm foaf_name: Meyer auf der Heide, Friedhelm foaf_surname: Meyer auf der Heide foaf_workInfoHomepage: http://www.librecat.org/personId=15523 - foaf_Person: foaf_givenName: Sören foaf_name: Riechers, Sören foaf_surname: Riechers bibo_doi: 10.1007/978-3-319-21840-3_45 dct_date: 2015^xs_gYear dct_title: Non-preemptive Scheduling on Machines with Setup Times@ ...