Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage

DOI10.1016/J.COR.2014.11.012zbMATH Open1348.90333OpenAlexW1982868996MaRDI QIDQ337499FDOQ337499

Authors: Jaehwan Yang 

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

Recommendations

• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
• A two-stage hybrid flow shop with dedicated machines at the first stage
• A heuristic method for two-stage hybrid flow shop with dedicated machines
• A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
• Méthode heuristique pour le problème de flow shop hybride avec machines dédiées

zbMATH Keywords

computational complexityheuristictwo-stage hybrid flow shopworst case bound on relative error

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• The hybrid flow shop scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
• 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
• A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
• A two-stage hybrid flow shop with dedicated machines at the first stage
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
• Flowshop and Jobshop Schedules: Complexity and Approximation
• Branch and bound algorithm for the flow shop with multiple processors

Cited In (6)

• A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
• Sequencing a hybrid two-stage flowshop with dedicated machines
• Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
• A two-stage hybrid flow shop with dedicated machines at the first stage
• Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
• A note on the two-stage hybrid flow shop problem with dedicated machines

This page was built for publication: Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage

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