2026-08-18T00:49:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8537 2024-03-06T10:42:15Z ddc:004 open_access

The Open Shop Scheduling Problem Woeginger, Gerhard J. Algorithms Complexity Scheduling Approximation We discuss the computational complexity, the approximability, the algorithmics and the combinatorics of the open shop scheduling problem. We summarize the most important results from the literature and explain their main ideas, we sketch the most beautiful proofs, and we also list a number of open problems. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Gerhard J. Woeginger 2018 Is Part Of LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2018.4 urn:nbn:de:0030-drops-85375 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.4 eng https://creativecommons.org/licenses/by/3.0/legalcode