1. Editorial

   • Ceyda Oğuz
   • Kirk Pruhs

   EditorialNotes 24 February 2009 Pages: 435 - 436

2. On truthfulness and approximation for scheduling selfish tasks

   • Eric Angel
   • Evripidis Bampis
   • Alex-Ariel Tchetgnia

   OriginalPaper 11 September 2009 Pages: 437 - 445

3. The resource-constrained activity insertion problem with minimum and maximum time lags

   • Christian Artigues
   • Cyril Briand

   OriginalPaper 29 August 2009 Pages: 447 - 460

4. Bounded-space online bin cover

   • Eyjolfur Ingi Asgeirsson
   • Cliff Stein

   OriginalPaper 11 September 2009 Pages: 461 - 474

5. Inverse scheduling with maximum lateness objective

   • Peter Brucker
   • Natalia V. Shakhlevich

   OriginalPaper 05 August 2009 Pages: 475 - 488

6. Power-aware scheduling for makespan and flow

   • David P. Bunde

   OriginalPaper 29 July 2009 Pages: 489 - 500

7. Algorithms for testing fault-tolerance of sequenced jobs

   • Marek Chrobak
   • Mathilde Hurand
   • Jiří Sgall

   OriginalPaper Open access 25 August 2009 Pages: 501 - 515

8. Optimal and online preemptive scheduling on uniformly related machines

   • Tomáš Ebenlendr
   • Jiří Sgall

   OriginalPaper 29 July 2009 Pages: 517 - 527

9. Exact and approximate algorithms for high-multiplicity parallel machine scheduling

   • Carlo Filippi
   • Giorgio Romanin-Jacur

   OriginalPaper 29 July 2009 Pages: 529 - 541

10. Conjugate problems in time-dependent scheduling

    • Stanisław Gawiejnowicz
    • Wiesław Kurc
    • Lidia Pankowska

    OriginalPaper 25 July 2009 Pages: 543 - 553

11. Non-approximability of just-in-time scheduling

    • Matthias Müller-Hannemann
    • Alexander Sonnikow

    OriginalPaper 18 July 2009 Pages: 555 - 562