New MIP model for multiprocessor scheduling problem with communication delays
From MaRDI portal
Publication:5915741
DOI10.1007/s11590-014-0802-2zbMath1382.90058OpenAlexW2064723168MaRDI QIDQ5915741
Saïd Hanafi, Rabie Ben Atitallah, Abdessamad Ait El Cadi, Nenad Mladenović, Abdelhakim Artiba
Publication date: 10 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0802-2
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems
- A survey of variants and extensions of the resource-constrained project scheduling problem
- UET scheduling with unit interprocessor communication delays
- A time indexed formulation of non-preemptive single machine scheduling problems
- A heuristic for scheduling task graphs with communication delays onto multiprocessors
- Variable neighborhood search
- Scheduling rooted forests with communication delays
- An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
- A hybrid heuristic to solve a task allocation problem
- A comparison of multiprocessor task scheduling algorithms with communication costs
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- Note. Optimal Balancing of U-Shaped Assembly Lines
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS
