The k-Track assignment problem on partial orders

DOI10.1007/S10951-005-6363-6MaRDI QIDQ2464438zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

partial orderspolytopescompact formulations\(k\)-track assignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The k-track assignment problem
• Order preserving assignments without contiguity
• A Greedy On-Line Algorithm for thek-Track Assignment Problem
• Interval scheduling on identical machines
• scientific article; zbMATH DE number 512916

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 863504 (Why is no real title available?)
• A Greedy On-Line Algorithm for thek-Track Assignment Problem
• Node packings on cocomparability graphs
• Note on scheduling intervals on-line
• On the facial structure of set packing polyhedra
• Scheduling jobs with fixed start and end times
• The k-track assignment problem
• Using separation algorithms to generate mixed integer model reformulations

Cited in

(3)

• On the online track assignment problem
• Solvability of \(k\)-track assignment problem: a graph approach
• Decomposition algorithms for the interval scheduling problem

This page was built for publication: The \(k\)-Track assignment problem on partial orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464438)