Theory and practice of shift scheduling (invited paper)

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publicationWorkshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems
Publisher.
Pages35-35
Publication statusPublished - 2000

Treatment code (Nähere Zuordnung)

  • Application
  • Theoretical
  • Experimental

Cite this

Slany, W. (2000). Theory and practice of shift scheduling (invited paper). In Workshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems (pp. 35-35). ..

Theory and practice of shift scheduling (invited paper). / Slany, Wolfgang.

Workshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems. ., 2000. p. 35-35.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Slany, W 2000, Theory and practice of shift scheduling (invited paper). in Workshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems. ., pp. 35-35.
Slany W. Theory and practice of shift scheduling (invited paper). In Workshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems. . 2000. p. 35-35
Slany, Wolfgang. / Theory and practice of shift scheduling (invited paper). Workshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems. ., 2000. pp. 35-35
@inproceedings{a3fb0a5db95e4300b86fe82d78c0472a,
title = "Theory and practice of shift scheduling (invited paper)",
author = "Wolfgang Slany",
year = "2000",
language = "English",
pages = "35--35",
booktitle = "Workshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems",
publisher = ".",

}

TY - GEN

T1 - Theory and practice of shift scheduling (invited paper)

AU - Slany, Wolfgang

PY - 2000

Y1 - 2000

M3 - Conference contribution

SP - 35

EP - 35

BT - Workshop on Algorithm Engineering as a New Paradigm: A Challenge to Hard Computation Problems

PB - .

ER -