| 319 | -- | 328 | Alok Baveja, Xiaoran Qu, Aravind Srinivasan. Approximating weighted completion time via stronger negative correlation |
| 329 | -- | 340 | Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov. An exact solution with an improved running time for the routing flow shop problem with two machines |
| 341 | -- | 361 | Michael Römer. Block-based state-expanded network models for multi-activity shift scheduling |
| 363 | -- | 373 | Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna. Sequential solutions in machine scheduling games |
| 375 | -- | 392 | Seyma Güven-Koçak, Aliza Heching, Pinar Keskinocak, Alejandro Toriello. Continuity of care in home health care scheduling: a rolling horizon approach |
| 393 | -- | 407 | Michele Barbato, Alberto Ceselli, Giovanni Righini. A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses |