| 435 | -- | 436 | Ceyda Oguz, Kirk Pruhs. Editorial |
| 437 | -- | 445 | Eric Angel, Evripidis Bampis, Fanny Pascual, Alex-Ariel Tchetgnia. On truthfulness and approximation for scheduling selfish tasks |
| 447 | -- | 460 | Christian Artigues, Cyril Briand. The resource-constrained activity insertion problem with minimum and maximum time lags |
| 461 | -- | 474 | Eyjolfur Ingi Asgeirsson, Cliff Stein. Bounded-space online bin cover |
| 475 | -- | 488 | Peter Brucker, Natalia V. Shakhlevich. Inverse scheduling with maximum lateness objective |
| 489 | -- | 500 | David P. Bunde. Power-aware scheduling for makespan and flow |
| 501 | -- | 515 | Marek Chrobak, Mathilde Hurand, Jiri Sgall. Algorithms for testing fault-tolerance of sequenced jobs |
| 517 | -- | 527 | Tomás Ebenlendr, Jiri Sgall. Optimal and online preemptive scheduling on uniformly related machines |
| 529 | -- | 541 | Carlo Filippi, Giorgio Romanin Jacur. Exact and approximate algorithms for high-multiplicity parallel machine scheduling |
| 543 | -- | 553 | Stanislaw Gawiejnowicz, Wieslaw Kurc, Lidia Pankowska. Conjugate problems in time-dependent scheduling |
| 555 | -- | 562 | Matthias Müller-Hannemann, Alexander Sonnikow. Non-approximability of just-in-time scheduling |