The \(k\)-Track assignment problem on partial orders
From MaRDI portal
Publication:2464438
DOI10.1007/s10951-005-6363-6zbMath1154.90409OpenAlexW2082429278MaRDI QIDQ2464438
Paulo Barcia, Jorge Orestes Cerdeira
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-005-6363-6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling jobs with fixed start and end times
- Using separation algorithms to generate mixed integer model reformulations
- The \(k\)-track assignment problem
- Node packings on cocomparability graphs
- Note on scheduling intervals on-line
- A Greedy On-Line Algorithm for thek-Track Assignment Problem
- On the facial structure of set packing polyhedra
This page was built for publication: The \(k\)-Track assignment problem on partial orders