Coupled task scheduling with convex resource consumption functions
From MaRDI portal
Publication:2659170
DOI10.1016/j.dam.2021.01.013zbMath1460.90090OpenAlexW3127955917MaRDI QIDQ2659170
Gur Mosheiov, Amir Salehipour, Daniel Oron
Publication date: 25 March 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.01.013
Cites Work
- Unnamed Item
- Coupled task scheduling with exact delays: literature review and models
- A survey of scheduling with controllable processing times
- Scheduling coupled tasks
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- On the complexity of coupled-task scheduling
This page was built for publication: Coupled task scheduling with convex resource consumption functions