{"ddc":["040"],"file_date_updated":"2018-03-21T09:28:34Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"274","user_id":"15504","series_title":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"abstract":[{"text":"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.","lang":"eng"}],"editor":[{"last_name":"Dehne","full_name":"Dehne, Frank","first_name":"Frank"},{"full_name":"Sack, Jörg Rüdiger","last_name":"Sack","first_name":"Jörg Rüdiger"},{"full_name":"Stege, Ulrike","last_name":"Stege","first_name":"Ulrike"}],"file":[{"file_name":"274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf","file_id":"1473","access_level":"closed","file_size":215498,"creator":"florida","date_created":"2018-03-21T09:28:34Z","date_updated":"2018-03-21T09:28:34Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings","title":"Non-preemptive Scheduling on Machines with Setup Times","doi":"10.1007/978-3-319-21840-3_45","date_updated":"2022-01-06T06:57:39Z","date_created":"2017-10-17T12:41:45Z","author":[{"first_name":"Alexander","id":"13536","full_name":"Mäcker, Alexander","last_name":"Mäcker"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"year":"2015","citation":{"short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne, J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with Setup Times}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>}, booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015}, pages={542--553}, collection={Lecture Notes in Computer Science} }","mla":"Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne et al., 2015, pp. 542--553, doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, &#38; U. Stege (Eds.), <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i> (pp. 542--553). <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>. Lecture Notes in Computer Science. ; 2015:542--553. doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, 2015, pp. 542--553.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne, Jörg Rüdiger Sack, and Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>."},"page":"542--553","has_accepted_license":"1"}