Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints

DOI10.1007/BF00127078zbMath0853.68064MaRDI QIDQ1922637

Stella C. S. Porto, Celso Carneiro Ribeiro

Publication date: 12 December 1996

Published in: Journal of Heuristics (Search for Journal in Brave)

zbMATH Keywords

tabu search algorithmtask scheduling problemthe master-slave model

Mathematics Subject Classification ID

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

Related Items (2)

PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS ⋮ Multiprocessor scheduling under precedence constraints: polyhedral results

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parallel tabu search algorithm for large traveling salesman problems
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
• A user's guide to tabu search
• Massively parallel tabu search for the quadratic assignment problem
• Mean-Value Analysis of Closed Multichain Queuing Networks
• Tabu Search—Part I
• Tabu Search—Part II

This page was built for publication: Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints