Complexity results for flow shop problems with synchronous movement

DOI10.1016/J.EJOR.2014.09.053MaRDI QIDQ726218zbMATH OpenOpenAlexFDO

Authors Stefan Waldherr, Sigrid Knust

Publication date 8 July 2016

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

Full work available at URL https://doi.org/10.1016/j.ejor.2014.09.053

zbMATH Keywords

complexitydominating machinesflow shopsynchronous movement

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Solution algorithms for synchronous flow shop problems with two dominating machines
• Flow shop-sequencing problem with synchronous transfers and makespan minimization
• Complexity results for flow-shop problems with a single server
• Complexity of flow shop scheduling problems with transportation constraints
• scientific article; zbMATH DE number 3860868

Cites work

• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Assembly line balancing in a mixed-model sequencing environment with synchronous transfers.
• Flow shop-sequencing problem with synchronous transfers and makespan minimization
• Flowshop scheduling with dominant machines
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Minimizing Total Tardiness on One Machine is NP-Hard
• No-wait or no-idle permutation flowshop scheduling with dominating machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Some new results in flow shop scheduling

Cited in

(10)

• Flow shop scheduling with flexible processing times
• Open shop scheduling with synchronization
• Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Analysis of flow shop scheduling anomalies
• The evolution of schematic representations of flow shop scheduling problems
• Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines
• The assignment problem with nearly Monge arrays and incompatible partner indices
• Solution algorithms for synchronous flow shop problems with two dominating machines
• Synchronous flow shop scheduling with pliable jobs

This page was built for publication: Complexity results for flow shop problems with synchronous movement

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