Scheduling multi-stage parallel-processor services to minimize average response time

DOI10.1057/PALGRAVE.JORS.2601987zbMATH Open1121.90050OpenAlexW2063893403MaRDI QIDQ3369255FDOQ3369255

Authors: Ali Allahverdi, Fawaz S. Al-Anzi 

Publication date: 13 February 2006

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601987

Recommendations

• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Dynamic on-line task scheduling on parallel processors
• Flexible flow shop scheduling with uniform parallel machines
• Minimizing makespan in parallel flowshops
• A nonidentical parallel processor scheduling problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (5)

• The hybrid flow shop scheduling problem
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
• An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
• Metaheuristic algorithms for the hybrid flowshop scheduling problem

This page was built for publication: Scheduling multi-stage parallel-processor services to minimize average response time

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