| 629 | -- | 630 | Alessandro Agnetis, Stanislaw Gawiejnowicz, Bertrand Miao-Tsong Lin, Gur Mosheiov. Editorial: Dynamic Scheduling Problems |
| 631 | -- | 641 | Baruch Mor, Gur Mosheiov, Dana Shapira. Flowshop scheduling with learning effect and job rejection |
| 643 | -- | 648 | Nir Halman. A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times |
| 649 | -- | 664 | Shaojun Lu, Jun Pei, Xinbao Liu, Xiaofei Qian, Nenad Mladenovic, Panos M. Pardalos. Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing |
| 665 | -- | 680 | Alan J. Soper, Vitaly A. Strusevich. Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects |
| 681 | -- | 691 | Joanna Berlinska. Scheduling in data gathering networks with background communications |
| 693 | -- | 709 | Alexander V. Kononov, Yulia V. Kovalenko. Approximation algorithms for energy-efficient scheduling of parallel jobs |
| 711 | -- | 731 | Farzaneh Karami, Wim Vancroonenburg, Greet Vanden Berghe. A periodic optimization approach to dynamic pickup and delivery problems with time windows |
| 733 | -- | 744 | Stanislaw Gawiejnowicz, Wieslaw Kurc. New results for an open time-dependent scheduling problem |
| 745 | -- | 749 | Yakov M. Shafransky, Viktor Shinkarevich. On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty |
| 751 | -- | 768 | Helmut A. Sedding. Scheduling jobs with a V-shaped time-dependent processing time |