An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop

DOI10.1016/j.ipl.2014.11.014zbMath1314.90036OpenAlexW2094247618MaRDI QIDQ2512819

An Zhang, Jianming Dong, Jueliang Hu, Yiwei Jiang, Hui Luo

Publication date: 30 January 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.11.014

zbMATH Keywords

schedulingapproximation algorithmworst-case analysistwo-stage proportionate flow shop

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Minimizing makespan in hybrid flowshops
• Heuristic algorithms for the two-stage hybrid flowshop problem
• Two-stage proportionate flexible flow shop to minimize the makespan
• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
• Scheduling multi-stage parallel-processor services to minimize average response time