The Open Shop Scheduling Problem

DOI10.4230/LIPIcs.STACS.2018.4zbMath1487.68132OpenAlexW2789550889MaRDI QIDQ3304098

Gerhard J. Woeginger

Publication date: 5 August 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8537/pdf/LIPIcs-STACS-2018-4.pdf/

zbMATH Keywords

complexityalgorithmsschedulingapproximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Value of the Steinitz constant
• Makespan minimization in open shops: A polynomial time approximation scheme
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• On some geometric methods in scheduling theory: A survey
• The two-machine open shop problem: To fit or not to fit, that is the question
• The Steinitz constant of the plane.
• Complexity of Scheduling Shops with No Wait in Process
• Preemptive Scheduling of Uniform Processor Systems
• Approximation Algorithms for Three-Machine Open Shop Scheduling
• Short Shop Schedules
• An Algorithm for the Open-Shop Problem
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• How good is a dense shop schedule?

This page was built for publication: The Open Shop Scheduling Problem