Complexity Results for Scheduling Tasks with Discrete Starting Times

@article{Nakajima1982ComplexityRF,
  title={Complexity Results for Scheduling Tasks with Discrete Starting Times},
  author={Kazuo Nakajima and S. Louis Hakimi},
  journal={J. Algorithms},
  year={1982},
  volume={3},
  pages={344-361}
}

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

Similar Papers

Loading similar papers…