Branch-and-bound task allocation with task clustering-based pruning

DOI10.1016/J.JPDC.2004.08.002zbMATH Open1073.68535OpenAlexW2088030327MaRDI QIDQ705569FDOQ705569

Authors: Yung-Cheng Ma, Tien-Fu Chen, Chung-Ping Chung 

Publication date: 31 January 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.2004.08.002

Recommendations

• On multiprocessor task scheduling using efficient state space search approaches
• An efficient algorithm for a task allocation problem
• Simple approaches to parallel branch and bound
• Bounds and algorithms for a practical task allocation model (extended abstract)
• Reducing the solution space of optimal task scheduling

zbMATH Keywords

Branch-and-boundDominance relationPruning ruleState-space searchingTask allocation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Branch-and-bound task allocation with task clustering-based pruning

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