{"publication_identifier":{"eisbn":["978-1-6654-9313-0"]},"status":"public","author":[{"first_name":"Niels","last_name":"Grüttemeier","full_name":"Grüttemeier, Niels"},{"orcid":"0000-0001-9203-5902","full_name":"Balzereit, Kaja","id":"255787","first_name":"Kaja","last_name":"Balzereit","orcid_put_code_url":"https://api.orcid.org/v2.0/0000-0001-9203-5902/work/179509731"},{"last_name":"Soni","first_name":"Nehal","full_name":"Soni, Nehal"},{"id":"227277","full_name":"Bünte, Andreas","first_name":"Andreas","last_name":"Bünte"}],"type":"conference","conference":{"start_date":"2023-07-18","location":"Lemgo, Germany","name":"2023 IEEE 21st International Conference on Industrial Informatics (INDIN)","end_date":"2023-07-20"},"date_updated":"2025-03-12T08:42:33Z","quality_controlled":"1","year":"2023","department":[{"_id":"103"}],"page":"1-6","publisher":"IEEE","publication":"2023 IEEE 21st International Conference on Industrial Informatics (INDIN)","citation":{"mla":"Grüttemeier, Niels, et al. “Efficient Production Scheduling by Exploiting Repetitive Product Configurations.” <i>2023 IEEE 21st International Conference on Industrial Informatics (INDIN)</i>, edited by IEEE, IEEE, 2023, pp. 1–6, doi:<a href=\"https://doi.org/10.1109/INDIN51400.2023.10218249\">10.1109/INDIN51400.2023.10218249</a>.","ieee":"N. Grüttemeier, K. Balzereit, N. Soni, and A. Bünte, “Efficient Production Scheduling by Exploiting Repetitive Product Configurations,” in <i>2023 IEEE 21st International Conference on Industrial Informatics (INDIN)</i>, Lemgo, Germany, 2023, pp. 1–6.","alphadin":"<span style=\"font-variant:small-caps;\">Grüttemeier, Niels</span> ; <span style=\"font-variant:small-caps;\">Balzereit, Kaja</span> ; <span style=\"font-variant:small-caps;\">Soni, Nehal</span> ; <span style=\"font-variant:small-caps;\">Bünte, Andreas</span>: Efficient Production Scheduling by Exploiting Repetitive Product Configurations. In: <span style=\"font-variant:small-caps;\">IEEE</span> (Hrsg.): <i>2023 IEEE 21st International Conference on Industrial Informatics (INDIN)</i> : IEEE, 2023, S. 1–6","apa":"Grüttemeier, N., Balzereit, K., Soni, N., &#38; Bünte, A. (2023). Efficient Production Scheduling by Exploiting Repetitive Product Configurations. In IEEE (Ed.), <i>2023 IEEE 21st International Conference on Industrial Informatics (INDIN)</i> (pp. 1–6). Lemgo, Germany: IEEE. <a href=\"https://doi.org/10.1109/INDIN51400.2023.10218249\">https://doi.org/10.1109/INDIN51400.2023.10218249</a>","ama":"Grüttemeier N, Balzereit K, Soni N, Bünte A. Efficient Production Scheduling by Exploiting Repetitive Product Configurations. In: IEEE, ed. <i>2023 IEEE 21st International Conference on Industrial Informatics (INDIN)</i>. IEEE; 2023:1-6. doi:<a href=\"https://doi.org/10.1109/INDIN51400.2023.10218249\">10.1109/INDIN51400.2023.10218249</a>","bibtex":"@inproceedings{Grüttemeier_Balzereit_Soni_Bünte_2023, title={Efficient Production Scheduling by Exploiting Repetitive Product Configurations}, DOI={<a href=\"https://doi.org/10.1109/INDIN51400.2023.10218249\">10.1109/INDIN51400.2023.10218249</a>}, booktitle={2023 IEEE 21st International Conference on Industrial Informatics (INDIN)}, publisher={IEEE}, author={Grüttemeier, Niels and Balzereit, Kaja and Soni, Nehal and Bünte, Andreas}, editor={IEEEEditor}, year={2023}, pages={1–6} }","short":"N. Grüttemeier, K. Balzereit, N. Soni, A. Bünte, in: IEEE (Ed.), 2023 IEEE 21st International Conference on Industrial Informatics (INDIN), IEEE, 2023, pp. 1–6.","chicago":"Grüttemeier, Niels, Kaja Balzereit, Nehal Soni, and Andreas Bünte. “Efficient Production Scheduling by Exploiting Repetitive Product Configurations.” In <i>2023 IEEE 21st International Conference on Industrial Informatics (INDIN)</i>, edited by IEEE, 1–6. IEEE, 2023. <a href=\"https://doi.org/10.1109/INDIN51400.2023.10218249\">https://doi.org/10.1109/INDIN51400.2023.10218249</a>."},"language":[{"iso":"eng"}],"title":"Efficient Production Scheduling by Exploiting Repetitive Product Configurations","abstract":[{"text":"We consider the problem of scheduling production jobs on a single machine with sequence dependent family setup times and individual job deadlines. Given a set of jobs, the goal is to minimize the total time to process all jobs while every job meets its deadline. We study algorithms that compute an exact solution to the problem. Motivated by one example use case, we exploit a natural structural observation that occurs in many production settings: the number of product configurations may be significantly smaller than the total number of jobs. We identify an algorithm that is efficient in this setting in terms of performance. We experimentally evaluate its running time and compare it with two other natural approaches of exact job scheduling.","lang":"eng"}],"_id":"5778","corporate_editor":["IEEE"],"date_created":"2025-03-03T13:10:21Z","doi":"10.1109/INDIN51400.2023.10218249","publication_status":"published","user_id":"220548"}