university website Publications by Year
  • sign in
  • Combinatorial Optimization and Algorithmics /
  • Annals of Discrete Mathematics /
  • Article
  • Search

J.K. Lenstra (Jan Karel), A.H.G. Rinnooy Kan and P. Brucker

1977

Complexity of machine scheduling problems

Publication

Publication

Annals of Discrete Mathematics , Volume 1 p. 343- 362

Additional Metadata
Journal Annals of Discrete Mathematics
Organisation Combinatorial Optimization and Algorithmics
Citation
APA Style
  • AAA Style
  • APA Style
  • Cell Style
  • Chicago Style
  • Harvard Style
  • IEEE Style
  • MLA Style
  • Nature Style
  • Vancouver Style
  • American-Institute-of-Physics Style
  • Council-of-Science-Editors Style
  • BibTex Format
  • Endnote Format
  • RIS Format
  • CSL Format
  • DOIs only Format
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343–362.
Free Full Text ( Final Version , 1mb ) cover

university website
  • Address

    • Centrum Wiskunde & Informatica
    • Science Park 123 | 1098 XG Amsterdam | the Netherlands
  • CWI researchers

    • Register Your Work
  • Questions or comments?

    • repository@cwi.nl
artudis website

Workflow

Workflow

Add Content


User Publication Person Organisation Collection
Close