A two-stage semi-hybrid flowshop problem in graphics processing

DOI10.1007/S11766-005-0016-6MaRDI QIDQ2501418zbMATH OpenOpenAlexWikidataFDO

Authors Qi Wei, Yong He

Publication date 11 September 2006

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

Full work available at URL https://doi.org/10.1007/s11766-005-0016-6

zbMATH Keywords

computational complexityapproximation algorithmflowshop schedulingworst-case ratio

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• An improved algorithm for a hybrid flow-shop problem in graphics processing
• Approximation algorithms for a two-stage hybrid flow shop
• Two-Stage, Hybrid Flowshop Scheduling Problem
• A HYBRID TWO-STAGE FLOWSHOP SCHEDULING PROBLEM
• scientific article; zbMATH DE number 1487904

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility
• Optimal two- and three-stage production schedules with set-up time included

Cited in

(3)

• An improved algorithm for a hybrid flow-shop problem in graphics processing
• A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs
• No-wait two-stage flowshop problem with multi-task flexibility of the first machine

This page was built for publication: A two-stage semi-hybrid flowshop problem in graphics processing

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