The \(k\)-track assignment problem

DOI10.1007/BF02238071zbMath0822.90080OpenAlexW31274221MaRDI QIDQ1319043

Peter Brucker, L. Nordmann

Publication date: 12 April 1994

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238071

zbMATH Keywords

parallel machineslongest pathinterval scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Algorithmic analysis for ridesharing of personal vehicles ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Algorithmic Analysis for Ridesharing of Personal Vehicles ⋮ The \(k\)-Track assignment problem on partial orders ⋮ Interval scheduling maximizing minimum coverage ⋮ DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM ⋮ Note on scheduling intervals on-line ⋮ Interval scheduling with economies of scale

Cites Work

• Scheduling jobs with fixed start and end times
• The Complexity of Coloring Circular Arcs and Chords

This page was built for publication: The \(k\)-track assignment problem