| 617 | -- | 618 | Jacek Blazewicz, Benjamin Moseley, Erwin Pesch, Denis Trystram, Guochuan Zhang. New challenges in scheduling theory |
| 619 | -- | 625 | Eric Angel, Evripidis Bampis, Vincent Chau, Dimitrios Letsios. Throughput maximization for speed scaling with agreeable deadlines |
| 627 | -- | 640 | Guillaume Aupy, Manu Shantharam, Anne Benoit, Yves Robert, Padma Raghavan. Co-scheduling algorithms for high-throughput workload execution |
| 641 | -- | 658 | Anne Benoit, Mathias Coqblin, Jean-Marc Nicod, Veronika Rehn-Sonigo. Optimizing memory allocation for multistage scheduling including setup times |
| 659 | -- | 685 | Peter Brucker, Natalia V. Shakhlevich. Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines |
| 687 | -- | 699 | Mihai Burcea, Wing-Kai Hon, Hsiang Hsuan Liu, Prudence W. H. Wong, David K. Y. Yau. Scheduling for electricity cost in a smart grid |
| 701 | -- | 728 | Bo Chen, Ed Coffman, Dariusz Dereniowski, Wieslaw Kubiak. Normal-form preemption sequences for an open problem in scheduling theory |
| 729 | -- | 736 | Xin Chen, Malgorzata Sterna, Xin Han, Jacek Blazewicz. Scheduling on parallel identical machines with late work criterion: Offline and online cases |
| 737 | -- | 757 | Florian Jaehn, Helmut Sedding. Scheduling with time-dependent discrepancy times |
| 759 | -- | 767 | Yingchao Zhao, Xiangtong Qi, Minming Li. On scheduling with non-increasing time slot cost to minimize total weighted completion time |