| 525 | -- | 543 | Julius Hoffmann, Janis S. Neufeld, Udo Buscher. Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment |
| 545 | -- | 556 | Danny Hermelin, Matthias Mnich, Simon Omlor. Serial batching to minimize the weighted number of tardy jobs |
| 557 | -- | 564 | Vance Faber, Noah Streib. Network routing on regular digraphs and their line graphs |
| 565 | -- | 585 | Raphael Kühn, Christian Weiß, Heiner Ackermann, Sandy Heydrich. Scheduling a single machine with multiple due dates per job |
| 587 | -- | 606 | Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier. Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems |
| 607 | -- | 622 | Tobias Geibinger, Florian Mischek, Nysret Musliu. Investigating constraint programming and hybrid methods for real world industrial test laboratory scheduling |