| 379 | -- | 391 | S. S. Panwalkar, Christos Koulamas. The evolution of schematic representations of flow shop scheduling problems |
| 393 | -- | 411 | Viswanath Nagarajan, Joel L. Wolf, Andrey Balmin, Kirsten Hildrum. Malleable scheduling for flows of jobs and applications to MapReduce |
| 413 | -- | 431 | Hui-Chih Hung, Bertrand M. T. Lin, Marc E. Posner, Jun-Min Wei. Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs |
| 433 | -- | 447 | Yumei Huo. Parallel machine makespan minimization subject to machine availability and total completion time constraints |
| 449 | -- | 463 | Yuan Gao, Jinjiang Yuan, Zhigang Wei. Unbounded parallel-batch scheduling with drop-line tasks |
| 465 | -- | 471 | Rachid Benmansour, Oliver Braun, Saïd Hanafi. The single-processor scheduling problem with time restrictions: complexity and related problems |
| 473 | -- | 485 | György Dósa, Leah Epstein. Quality of strong equilibria for selfish bin packing with uniform cost sharing |
| 487 | -- | 497 | János Balogh, Leah Epstein, Asaf Levin. Lower bounds for online bin covering-type problems |