The open shop scheduling problem

DOI10.4230/LIPICS.STACS.2018.4zbMATH Open1487.68132OpenAlexW2789550889MaRDI QIDQ3304098FDOQ3304098

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/

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

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)

Cites Work

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

Cited In (16)

• Title not available (Why is that?)
• Time buffers in the open shop problem
• Title not available (Why is that?)
• Open shop problem with zero-one time operations and integer release date/deadline intervals
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Note On The Complexity Of Openshop Scheduling Problems
• Title not available (Why is that?)
• Scheduling ordered open shops
• 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)