Approximation algorithms for a two-stage hybrid flow shop

DOI10.3724/SP.J.1001.2012.00587MaRDI QIDQ4901397zbMATH OpenFDO

Authors Qi Wei, Yiwei Jiang

Publication date 24 January 2013

Published in Journal of Software (Search for Journal in Brave)

zbMATH Keywords

computational complexityapproximation algorithmflowshop schedulingworst-case ratio

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for two-stage flexible flow shop scheduling
• Improved approximation algorithms for two-stage flowshops scheduling problem
• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
• An improved algorithm for a hybrid flow-shop problem in graphics processing
• Approximation algorithms on multiple two-stage flowshops

Cited in

(11)

• An improved algorithm for a hybrid flow-shop problem in graphics processing
• A two-stage semi-hybrid flowshop problem in graphics processing
• Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
• Approximation algorithms on multiple two-stage flowshops
• An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
• Improved approximation algorithms for two-stage flexible flow shop scheduling
• Optimal scheduling of a two-stage hybrid flow shop
• A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
• Aggregate planning in hybrid flowshops
• A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs
• Approximation algorithms for two-stage flexible flow shop scheduling

This page was built for publication: Approximation algorithms for a two-stage hybrid flow shop

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