Complexity of mixed shop scheduling problems: A survey

DOI10.1016/S0377-2217(99)00161-7MaRDI QIDQ1969835zbMATH OpenWikidataFDO

Authors Frank Werner, N. V. Shakhlevich, Yuriĭ Nazarovich Sotskov

Publication date 19 March 2000

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(99)00161-7

zbMATH Keywords

mixture of job and open shopsNP-hard problemoptimal schedulingpolynomial algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• scientific article; zbMATH DE number 3860868
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Complete Complexity Classification of Short Shop Scheduling
• scientific article; zbMATH DE number 764421

Cites work

• A Geometric Model and a Graphical Algorithm for a Sequencing Problem
• A Non-Numerical Approach to Production Scheduling Problems
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• An efficient algorithm for the job-shop problem with two jobs
• Computational Complexity of Discrete Optimization Problems
• Flowshop and Jobshop Schedules: Complexity and Approximation
• scientific article; zbMATH DE number 3972609 (Why is no real title available?)
• scientific article; zbMATH DE number 4020835 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3471786 (Why is no real title available?)
• scientific article; zbMATH DE number 764421 (Why is no real title available?)
• scientific article; zbMATH DE number 830382 (Why is no real title available?)
• scientific article; zbMATH DE number 894722 (Why is no real title available?)
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• NP-hardness of shop-scheduling problems with three jobs
• On the complexity of two machine job-shop scheduling with regular objective functions
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive job-shop scheduling problems with a fixed number of jobs
• 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
• Scheduling two jobs with fixed and nonfixed routes
• Shop scheduling problems under precedence constraints
• Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
• Solution of the Akers-Friedman Scheduling Problem
• The Complexity of Flowshop and Jobshop Scheduling
• The complexity of shop-scheduling problems with two or three jobs
• The mixed shop scheduling problem
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• Two-Machine Super-Shop Scheduling Problem

Cited in

(20)

• The mixed shop scheduling problem
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• Job-shop scheduling with processing alternatives.
• On scheduling cycle shops: Classification, complexity and approximation
• An effective heuristic algorithm for the partial 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
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Approximation algorithms for the three-machine proportionate mixed shop scheduling
• Machine scheduling in production: a content analysis
• Fair optimization and networks: a survey
• A complete 4-parametric complexity classification of short shop scheduling problems
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• 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
• scientific article; zbMATH DE number 3860868 (Why is no real title available?)
• Complete Complexity Classification of Short Shop Scheduling
• A new three-machine shop scheduling: complexity and approximation algorithm
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
• A multivariate complexity analysis of the material consumption scheduling problem
• Metamodel-guided Lévy optimization for stochastic hybrid shop scheduling with semi-finished product and due date constraints

This page was built for publication: Complexity of mixed shop scheduling problems: A survey

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