A two-stage hybrid flow shop with dedicated machines at the first stage
From MaRDI portal
Publication:336642
DOI10.1016/J.COR.2013.05.020zbMATH Open1348.90332OpenAlexW2049561666MaRDI QIDQ336642FDOQ336642
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.2013.05.020
Recommendations
- On the two-stage hybrid flow shop with dedicated machines
- Sequencing a hybrid two-stage flowshop with dedicated machines
- Two-stage hybrid flow shop with recirculation
- A heuristic method for two-stage hybrid flow shop with dedicated machines
- Exact resolution of the two-stage hybrid flow shop with dedicated machines
- Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
- Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage
- A two-stage hybrid flowshop with uniform machines and setup times
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups
- A note on the two-stage hybrid flow shop problem with dedicated machines
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- The hybrid flow shop scheduling problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Complexity of Flowshop and Jobshop Scheduling
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
- Minimizing makespan in hybrid flowshops
- 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 HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
- Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
- Branch and bound algorithm for the flow shop with multiple processors
Cited In (11)
- A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines
- On the two-stage hybrid flow shop with dedicated machines
- A two-stage flow shop scheduling problem with transportation considerations
- Flow-shops with a dominant machine
- Sequencing a hybrid two-stage flowshop with dedicated machines
- Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines
- Minimizing total completion time in 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
- Exact resolution of the two-stage hybrid flow shop with dedicated machines
- Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
- Minimizing makespan in hybrid flowshops
This page was built for publication: 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 Q336642)