Thek-track assignment problem

@article{Brucker1994ThektrackAP,
  title={Thek-track assignment problem},
  author={Peter Brucker and L. Nordmann},
  journal={Computing},
  year={1994},
  volume={52},
  pages={97-122}
}
Thek-track assignment problem is a scheduling problem withn jobs andk machines. Each machinej has a certain operational period (track) which starts at timea j and ends at timeb j . Each jobi has a specific start times i and a specific finish timet i . A schedule is an assignment of certain jobs to machines such that the intervals [s i ,t i [assigned to the same machinej do not overlap and fit into track [a j ,b j [. We are interested in a schedule which maximizes the number of assigned jobs. AO… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-5 of 5 references

A linear time algorithm for the two-track assignment problem

  • Hsu, M.-L, Tsai, K.-H
  • Proc. 27th Allerton Conference on Communication…
  • 1989
Highly Influential
3 Excerpts

Greedy k-coverings of interval orders

  • U. Faigle, W. M. Nawijn
  • Working paper, Twente University
  • 1991

Interval scheduling

  • A.W.J. Kolen, J. K. Lenstra
  • Technical Report No. 925, Cornel University…
  • 1990

Similar Papers

Loading similar papers…