Scheduling multi-stage parallel-processor services to minimize average response time
From MaRDI portal
Publication:3369255
DOI10.1057/PALGRAVE.JORS.2601987zbMath1121.90050OpenAlexW2063893403MaRDI QIDQ3369255
Fawaz S. Al-Anzi, Ali Allahverdi
Publication date: 13 February 2006
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601987
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective ⋮ The hybrid flow shop scheduling problem ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
This page was built for publication: Scheduling multi-stage parallel-processor services to minimize average response time
