Complexity of mixed shop scheduling problems: A survey
From MaRDI portal
Publication:1969835
DOI10.1016/S0377-2217(99)00161-7zbMath0949.90047WikidataQ57633958 ScholiaQ57633958MaRDI QIDQ1969835
Frank Werner, Natalia V. Shakhlevich, Yuri N. Sotskov
Publication date: 19 March 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ An effective heuristic algorithm for the partial shop scheduling problem ⋮ A new three-machine shop scheduling: complexity and approximation algorithm ⋮ The complexity of two-job shop problems with multi-purpose unrelated machines. ⋮ Job-shop scheduling with processing alternatives. ⋮ A complete 4-parametric complexity classification of short shop scheduling problems ⋮ Complexity of shop-scheduling problems with fixed number of jobs: a survey ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling ⋮ Machine scheduling in production: a content analysis ⋮ Complete Complexity Classification of Short Shop Scheduling ⋮ Fair optimization and networks: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The mixed shop scheduling problem
- An efficient algorithm for the job-shop problem with two jobs
- The complexity of shop-scheduling problems with two or three jobs
- Preemptive job-shop scheduling problems with a fixed number of jobs
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
- Scheduling two jobs with fixed and nonfixed routes
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- Shop scheduling problems under precedence constraints
- On the complexity of two machine job-shop scheduling with regular objective functions
- NP-hardness of shop-scheduling problems with three jobs
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- Optimal two- and three-stage production schedules with setup times included
- Solution of the Akers-Friedman Scheduling Problem
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- Scheduling the Open Shop to Minimize Mean Flow Time
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Two-Machine Super-Shop Scheduling Problem
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
- Open Shop Scheduling to Minimize Finish Time
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Complexity of Flowshop and Jobshop Scheduling
- Computational Complexity of Discrete Optimization Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
- A Non-Numerical Approach to Production Scheduling Problems
