Minimizing mean flowtime and makespan on master-slave systems

DOI10.1016/J.JPDC.2005.03.004zbMath1078.68013OpenAlexW2073065891MaRDI QIDQ557659

Hairong Zhao, Joseph Y.-T. Leung

Publication date: 30 June 2005

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2005.03.004

zbMATH Keywords

HeuristicsNP-hardSchedulingMakespanMaster-slave systemsMean flowtime

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Scheduling problems in master-slave model

This page was built for publication: Minimizing mean flowtime and makespan on master-slave systems