Search techniques for a nonlinear multiprocessor scheduling problem

DOI10.1002/nav.3800290204zbMath0535.68016OpenAlexW2009480555MaRDI QIDQ3319771

Camille C. Price, Udo W. Pooch

Publication date: 1982

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800290204

zbMATH Keywords

branch-and-bound algorithmmultiprocessor schedulingzero-one quadratic programmingdistributed computer networkbackward shortest path labelling algorithmdirected acyclic search graph

Mathematics Subject Classification ID

Quadratic programming (90C20) Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Task allocation model for distributed systems ⋮ An algorithm for the multiprocessor assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• The art and theory of dynamic programming
• Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters

This page was built for publication: Search techniques for a nonlinear multiprocessor scheduling problem