Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
From MaRDI portal
Publication:1631647
DOI10.1007/S10878-017-0199-9zbMath1412.90091OpenAlexW2768745700MaRDI QIDQ1631647
Publication date: 6 December 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-017-0199-9
Related Items (4)
Inductive linearization for binary quadratic programs with linear constraints ⋮ Pilot pattern design scheme with branch and bound in PSA-OFDM system ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems ⋮ Inductive linearization for binary quadratic programs with linear constraints: a computational study
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiprocessor scheduling with communication delays
- UET scheduling with unit interprocessor communication delays
- On the quadratic assignment problem
- List scheduling with and without communication delays
- A two-pass scheduling algorithm for parallel programs
- A heuristic for scheduling task graphs with communication delays onto multiprocessors
- Compact linearization for binary quadratic problems
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- Compact Layered Drawings of General Directed Graphs
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- L’algebre de Boole et ses applications en recherche operationnelle
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with communication delays: Using infeasible solutions for approximation
- New MIP model for multiprocessor scheduling problem with communication delays
This page was built for publication: Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays
