The k-track assignment problem on partial orders

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


The k-track assignment problem is a scheduling problem in which a collection of jobs, represented by intervals, are to be processed by k machines. Two different jobs can be processed by the same machine only if the corresponding intervals do not overlap. We give a compact formulation of the problem and state some polyhedral results for the associated polytope, working in the more general context where job compatibility stems not necessarily from intervals but rather from an arbitrary strict partial order.
Original languageEnglish
Pages (from-to)135-143
JournalJournal Of Scheduling
Issue number2
Publication statusPublished - 1 Jan 2005


  • k-track assignment
  • partial orders
  • compact formulations
  • polytopes


Dive into the research topics of 'The k-track assignment problem on partial orders'. Together they form a unique fingerprint.

Cite this