Ten notes on equal-processing-time scheduling

At the frontiers of solvability in polynomial time
  • Philippe BaptisteEmail author
  • Peter Brucker
  • Sigrid Knust
  • Vadim G. Timkovsky


Equal-processing-time scheduling problems whose complexity status has been unknown are shown to be solved in polynomial time by well-known and relatively new techniques. Single-machine, parallel-machine, parallel-batch, open-shop, flow-shop and job-shop environments are touched upon.


Scheduling computational complexity polynomial time 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2004

Authors and Affiliations

  • Philippe Baptiste
    • 1
    • 2
    Email author
  • Peter Brucker
    • 3
  • Sigrid Knust
    • 3
  • Vadim G. Timkovsky
    • 4
    • 5
  1. 1.UMR CNRS, HenDiaSyCUniversité de TechnologieCompiégne CXFrance
  2. 2.École PolytechniqueFrance
  3. 3.FB Mathematik/InformatikUniversität OsnabrückOsnabrückGermany
  4. 4.CGI Group Inc.TorontoCanada
  5. 5.McMaster UniversityCanada

Personalised recommendations