Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results

Yves Crama, Frits C. R. Spieksma. Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results. In Egon Balas, Jens Clausen, editors, Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings. Volume 920 of Lecture Notes in Computer Science, pages 277-291, Springer, 1995.

@inproceedings{CramaS95,
  title = {Scheduling Jobs of Equal Length: Complexity, Facets and Computational Results},
  author = {Yves Crama and Frits C. R. Spieksma},
  year = {1995},
  tags = {C++},
  researchr = {https://researchr.org/publication/CramaS95},
  cites = {0},
  citedby = {0},
  pages = {277-291},
  booktitle = {Integer Programming and Combinatorial Optimization, 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
  editor = {Egon Balas and Jens Clausen},
  volume = {920},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-59408-6},
}