Improved approximation algorithms for two-stage flexible flow shop scheduling

DOI10.1007/S10878-020-00657-2zbMath1468.90055OpenAlexW3094176667MaRDI QIDQ2025092

Anzhen Peng, Longcheng Liu, Weifeng Lin

Publication date: 11 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00657-2

zbMATH Keywords

schedulingapproximation algorithmoptimal algorithmtwo-stage flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing makespan in hybrid flowshops
• Heuristics for hybrid flow shops with controllable processing times and assignable due dates
• Two-stage proportionate flexible flow shop to minimize the makespan
• Approximation algorithms for two-stage flexible flow shop scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Improved approximation algorithms for two-stage flexible flow shop scheduling