Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage
DOI10.1016/j.cor.2014.11.012zbMath1348.90333OpenAlexW1982868996MaRDI QIDQ337499
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.11.012
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- A two-stage hybrid flow shop with dedicated machines at the first stage
- Branch and bound algorithm for the flow shop with multiple processors
- The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- Two-stage flowshop scheduling with a common second-stage machine
- The hybrid flow shop scheduling problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage
