Scheduling problems in master-slave model

DOI10.1007/S10479-007-0271-4MaRDI QIDQ940888zbMATH OpenOpenAlexFDO

Authors Joseph Y.-T. Leung, Hairong Zhao

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

approximation algorithmsmakespanmaster slave modelNP-hardtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing mean flowtime and makespan on master-slave systems
• Scheduling master-slave multiprocessor systems
• Complexity of master-slave tasking on heterogeneous trees
• The master-slave paradigm in parallel computer and industrial settings
• Two-machine flow-shop scheduling problems with minimizing the total completion times

Cites work

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

Cited in

(3)

• The master-slave paradigm in parallel computer and industrial settings
• Scheduling master-slave multiprocessor systems
• Minimizing mean flowtime and makespan on master-slave systems

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

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