Performance evaluation of a parallel tabu search task scheduling algorithm
From MaRDI portal
Recommendations
- Design and evaluation of tabu search algorithms for multiprocessor scheduling
- scientific article; zbMATH DE number 2148766
- Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints
- Parallel flowshop scheduling using Tabu search
- Performance of critical path type algorithms for scheduling on parallel processors
- A tabu search algorithm for parallel machine total tardiness problem
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
- Parallel Tabu Search
Cited in
(8)- Design and evaluation of tabu search algorithms for multiprocessor scheduling
- Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints
- Multiprocessor scheduling under precedence constraints: polyhedral results
- scientific article; zbMATH DE number 1729263 (Why is no real title available?)
- scientific article; zbMATH DE number 2148766 (Why is no real title available?)
- scientific article; zbMATH DE number 2158088 (Why is no real title available?)
- Extended tabu search-based scheduling to improve profitability in heterogeneous parallel systems
- Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search
This page was built for publication: Performance evaluation of a parallel tabu search task scheduling algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606891)
