| 499 | -- | 515 | Bahram Alidaee, Haibo Wang 0001, Bryan Kethley, Frank G. Landram. A unified view of parallel machine scheduling with interdependent processing rates |
| 517 | -- | 541 | Amelie Eilken. A decomposition-based approach to the scheduling of identical automated yard cranes at container terminals |
| 543 | -- | 565 | Kerem Bülbül, Safia Kedad-Sidhoum, Halil Sen. Single-machine common due date total earliness/tardiness scheduling with machine unavailability |
| 567 | -- | 580 | Adam Kasperski, Pawel Zielinski 0001. Risk-averse single machine scheduling: complexity and approximation |
| 581 | -- | 593 | Rubing Chen, Jinjiang Yuan, Yuan Gao. The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs |
| 595 | -- | 601 | Rubing Chen, Jinjiang Yuan. Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines |
| 603 | -- | 606 | Mikhail Y. Kovalyov, Dmitrij Sesok. Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity |