Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

DOI10.1007/S11766-013-3146-2MaRDI QIDQ2248262zbMATH OpenOpenAlexFDO

Authors Jianming Dong, Jueliang Hu, Yong Chen

Publication date 30 June 2014

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-013-3146-2

zbMATH Keywords

heuristic algorithmhybrid flow shopopen shop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Two-stage flow-open shop scheduling problem to minimize makespan
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
• Minimizing makespan in hybrid flowshops
• Optimal scheduling of a two-stage hybrid flow shop
• Scheduling a two-stage flowshop under makespan constraint
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops
• scientific article; zbMATH DE number 1437089
• Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments

Cites work

• scientific article; zbMATH DE number 1500536 (Why is no real title available?)
• A comparison of sequencing rules in static and dynamic hybrid flow systems
• A note on makespan minimization in two-stage flexible flow shops with uniform machines
• A note on scheduling hybrid flow systems
• A two-stage hybrid flowshop with uniform machines and setup times
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Flowshop scheduling with identical jobs and uniform parallel machines
• Minimizing makespan in hybrid flowshops
• Open Shop Scheduling to Minimize Finish Time
• Optimal two- and three-stage production schedules with set-up time included
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• The hybrid flow shop scheduling problem

Cited in

(7)

• A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
• Two-stage hybrid flow shop with recirculation
• Two-stage flow-open shop scheduling problem to minimize makespan
• Hybrid flow-shop with adjustment
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
• Two-machine open shop scheduling with secondary criteria

This page was built for publication: Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage

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