Multiprofessor scheduling
From MaRDI portal
Publication:1686063
DOI10.1016/j.dam.2016.01.035zbMath1382.90033OpenAlexW4205527331MaRDI QIDQ1686063
Publication date: 20 December 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.01.035
Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An introduction to timetabling
- Scheduling with conflicts: Online and offline algorithms
- Online and semi-online scheduling of two machines under a grade of service provision
- Parallel machine scheduling with multiple unloading servers
- Online algorithms. The state of the art
- Scheduling with incompatible jobs
- Parallel machine scheduling with a common server
- Mixed integer programming formulations for the biomass truck scheduling problem
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Scheduling two parallel semiautomatic machines to minimize machine interference
- On-Line Load Balancing in a Hierarchical Server Topology
- On randomized online scheduling
- Algorithms for Scheduling Independent Tasks
- An Application of Bin-Packing to Multiprocessor Scheduling
- Better Bounds for Online Scheduling
- The Competitiveness of On-Line Assignments
- Reducibility among Combinatorial Problems
- Parallel machine scheduling with job assignment restrictions
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: Multiprofessor scheduling
