The k-Track Assignment Problem on Partial Orders

Authors:
Paulo Barcia;J. Orestes Cerdeira
Affiliations:
Faculdade de Economia, Universidade Nova de Lisboa, Lisboa 1099-032;Instituto Superior de Agronomia, Tapada da Ajuda, Lisboa 1349-017
Venue:
Journal of Scheduling
Year:
2005

Citing 6
Cited 0

Scheduling jobs with fixed start and end times

Discrete Applied Mathematics
Note on scheduling intervals on-line

Discrete Applied Mathematics
Combinatorics in operations research

Handbook of combinatorics (vol. 2)
A greedy on-line algorithm for the k-track assignment problem

Journal of Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Node packings on cocomparability graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.