| 611 | -- | 620 | Y. Massim, Farouk Yalaoui, Lionel Amodeo, E. Chatelet, A. Zeblah. Efficient combined immune-decomposition algorithm for optimal buffer allocation in production lines for throughput and profit maximization |
| 621 | -- | 629 | Yaodong Cui, Dao-yun Xu. Strips minimization in two-dimensional cutting stock of circular items |
| 630 | -- | 639 | Ana F. Carazo, Trinidad Gómez, Julián Molina Luque, Alfredo García Hernández-Díaz, Flor M. Guerrero, Rafael Caballero. Solving a comprehensive model for multiobjective project portfolio selection |
| 640 | -- | 648 | Daniel Tuyttens, A. Vandaele. Using a greedy random adaptative search procedure to solve the cover printing problem |
| 649 | -- | 655 | Öncü Hazir, Mohamed Haouari, Erdal Erel. Discrete time/cost trade-off problem: A decomposition-based solution algorithm for the budget version |
| 656 | -- | 667 | Xinyu Li, Liang Gao, Xinyu Shao, Chaoyong Zhang, Cuiyu Wang. Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling |
| 668 | -- | 683 | Feng Pan, Rakesh Nagi. Robust supply chain design under uncertain demand in agile manufacturing |
| 684 | -- | 691 | Deisemara Ferreira, Reinaldo Morabito, Socorro Rangel. Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants |
| 692 | -- | 699 | Luís Gouveia, Maria Cåndida Mourão, Leonor Santiago Pinto. Lower bounds for the mixed capacitated arc routing problem |
| 700 | -- | 711 | José Rui Figueira, Gabriel Tavares, Margaret M. Wiecek. Labeling algorithms for multiple objective integer knapsack problems |
| 712 | -- | 723 | Emmanouil E. Zachariadis, Chris T. Kiranoudis. An open vehicle routing problem metaheuristic for examining wide solution neighborhoods |
| 724 | -- | 737 | Yuichi Nagata, Olli Bräysy, Wout Dullaert. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows |
| 738 | -- | 753 | Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez. On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming |
| 754 | -- | 768 | B. Naderi, Rubén Ruiz. The distributed permutation flowshop scheduling problem |
| 769 | -- | 778 | Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. A search space cartography for guiding graph coloring heuristics |
| 779 | -- | 789 | Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan. Bicriteria robotic operation allocation in a flexible manufacturing cell |
| 790 | -- | 805 | Jun Woo Kim, Sang-Chan Park. Outsourcing strategy in two-stage call centers |