Scheduling problems in master-slave model

DOI10.1007/s10479-007-0271-4zbMath1151.90421OpenAlexW2160288884MaRDI QIDQ940888

Hairong Zhao, Joseph Y.-T. Leung

Publication date: 3 September 2008

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-007-0271-4

zbMATH Keywords

makespanNP-hardapproximation algorithmstotal completion timemaster slave model

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing mean flowtime and makespan on master-slave systems
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• A state-of-the-art review of parallel-machine scheduling research
• Minimizing average completion time in the presence of release dates
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• Minimizing makespan in hybrid flowshops
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Scheduling two-stage hybrid flow shop with availability constraints
• The master-slave paradigm in parallel computer and industrial settings
• Approximation Techniques for Average Completion Time Scheduling
• Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling master-slave multiprocessor systems
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: Scheduling problems in master-slave model