The open shop scheduling problem

DOI10.4230/LIPICS.STACS.2018.4MaRDI QIDQ3304098zbMATH OpenOpenAlexFDO

Authors 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

algorithmscomplexityapproximationscheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1820024
• scientific article; zbMATH DE number 2156264
• A Note On The Complexity Of Openshop Scheduling Problems
• Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
• Scheduling ordered open shops

Cites work

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

Cited in

(16)

• scientific article; zbMATH DE number 2156264 (Why is no real title available?)
• Time buffers in the open shop problem
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• scientific article; zbMATH DE number 4170627 (Why is no real title available?)
• scientific article; zbMATH DE number 4068593 (Why is no real title available?)
• scientific article; zbMATH DE number 4108473 (Why is no real title available?)
• A Note On The Complexity Of Openshop Scheduling Problems
• Scheduling ordered open shops
• scientific article; zbMATH DE number 1820024 (Why is no real title available?)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• A contribution and new heuristics for open shop scheduling
• Open shop scheduling with delays
• Four-parametric complexity analysis for an open shop problem
• Open shop scheduling with makespan and total completion time criteria
• Openshop scheduling under linear resources constraints
• Scheduling Periodic Jobs Compactly Within A Fixed Time Period In Open Shops

This page was built for publication: The open shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304098)