| 1305 | -- | 1314 | Ahmed El-Bouri. A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop |
| 1315 | -- | 1324 | Zhicong Zhang, Li Zheng, Na Li, Weiping Wang, Shouyan Zhong, Kaishun Hu. Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning |
| 1325 | -- | 1332 | R. Sakiani, S. M. T. Fatemi Ghomi, M. Zandieh. Multi-objective supply planning for two-level assembly systems with stochastic lead times |
| 1333 | -- | 1344 | Haitao Li, Dali Jiang. New model and heuristics for safety stock placement in general acyclic supply chain networks |
| 1345 | -- | 1354 | Hannan Sadjady, Hamid Davoudpour. Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs |
| 1355 | -- | 1363 | Kun He, Wenqi Huang, Yan Jin. An efficient deterministic heuristic for two-dimensional rectangular packing |
| 1364 | -- | 1381 | Deniz Aksen, Necati Aras. A bilevel fixed charge location model for facilities under imminent attack |
| 1382 | -- | 1393 | A. Cossari, Johnny C. Ho, Giuseppe Paletta, Alex J. Ruiz-Torres. A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria |
| 1394 | -- | 1401 | Kilhwan Kim. T-preemptive priority queue and its application to the analysis of an opportunistic spectrum access in cognitive radio networks |
| 1402 | -- | 1410 | Joseph G. Szmerekovsky, Prahalad Venkateshan. An integer programming formulation for the project scheduling problem with irregular time-cost tradeoffs |
| 1411 | -- | 1418 | Subhash C. Sarin, Lixin Wang, Ming Cheng. A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times |
| 1419 | -- | 1431 | Yiyong Xiao, Qiuhong Zhao, Ikou Kaku, Yuchun Xu. Development of a fuel consumption optimization model for the capacitated vehicle routing problem |
| 1432 | -- | 1440 | M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte. Synchronized arc routing for snow plowing operations |
| 1441 | -- | 1449 | Vladimir Marianov, Horst A. Eiselt. Transmitter location for maximum coverage and constructive-destructive interference management |
| 1450 | -- | 1457 | Shih-Hsin Chen, Pei-Chann Chang, T. C. E. Cheng, Qingfu Zhang. A Self-guided Genetic Algorithm for permutation flowshop scheduling problems |
| 1458 | -- | 1464 | Dar-Li Yang, T. C. E. Cheng, Suh-Jenq Yang, Chou-Jung Hsu. Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities |
| 1465 | -- | 1476 | S. M. H. Manzour-al-Ajdad, S. A. Torabi, K. Eshghi. Single-Source Capacitated Multi-Facility Weber Problem - An iterative two phase heuristic algorithm |
| 1477 | -- | 1486 | Leyla Demir, Semra Tunali, Deniz Türsel Eliiyi. An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines |
| 1487 | -- | 1505 | Cláudio Alves, Pedro Brás, José M. Valério de Carvalho, Telmo Pinto. New constructive algorithms for leather nesting in the automotive industry |
| 1506 | -- | 1520 | Gokhan Kirlik, Ceyda Oguz. A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine |
| 1521 | -- | 1529 | Mark H. McElreath, Maria E. Mayorga. A dynamic programming approach to solving the assortment planning problem with multiple quality levels |
| 1530 | -- | 1539 | Evren Güney, Necati Aras, I. Kuban Altinel, Cem Ersoy. Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks |
| 1540 | -- | 1554 | Lucie Galand, Olivier Spanjaard. Exact algorithms for OWA-optimization in multiobjective spanning tree problems |
| 1555 | -- | 1565 | Grigoris S. Piperagkas, I. Konstantaras, K. Skouri, Konstantinos E. Parsopoulos. Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics |
| 1566 | -- | 1576 | Alejandro Rodríguez, Rubén Ruiz. The effect of the asymmetry of road transportation networks on the traveling salesman problem |
| 1577 | -- | 1581 | Geraldo R. Mauri, Luiz Antonio Nogueira Lorena. Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem |
| 1582 | -- | 1592 | Fabien Tricoire, Alexandra Graf, Walter J. Gutjahr. The bi-objective stochastic covering tour problem |
| 1593 | -- | 1600 | Qinghua Wu, Jin-Kao Hao. An effective heuristic algorithm for sum coloring of graphs |
| 1601 | -- | 1604 | Gur Mosheiov, Daniel Oron. Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times |
| 1605 | -- | 1614 | Abbas Ebadi, Ghasem Moslehi. Mathematical models for preemptive shop scheduling problems |
| 1615 | -- | 1624 | Sara Ceschia, Luca Di Gaspero, Andrea Schaerf. Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem |
| 1625 | -- | 1632 | Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev. An aggregation heuristic for large scale p-median problem |
| 1633 | -- | 1643 | Elise Miller-Hooks, Xiaodong Zhang, Reza Faturechi. Measuring and maximizing resilience of freight transportation networks |
| 1644 | -- | 1651 | Der-Chiang Li, Peng-Hsiang Hsu. Solving a two-agent single-machine scheduling problem considering learning effect |
| 1652 | -- | 1660 | Mohammad Ranjbar, Morteza Davari, Roel Leus. Two branch-and-bound algorithms for the robust parallel machine scheduling problem |
| 1661 | -- | 1672 | Jason Chao-Hsien Pan, Ming-Hung Wu. Throughput analysis for order picking system with multiple pickers and aisle congestion considerations |
| 1673 | -- | 1681 | Mariano Luque, Kaisa Miettinen, Ana Belen Ruiz, Francisco Ruiz. A two-slope achievement scalarizing function for interactive multiobjective optimization |
| 1682 | -- | 1691 | Chung-Cheng Lu, Shih-Wei Lin, Kuo-Ching Ying. Robust scheduling on a single machine to minimize total flow time |
| 1692 | -- | 1700 | Lishun Zeng, Shinji Mizuno. On the separation in 2-period double round robin tournaments with minimum breaks |
| 1701 | -- | 1712 | Frank S. Yao, Mei Zhao, Hui Zhang. Two-stage hybrid flow shop scheduling with dynamic job arrivals |
| 1713 | -- | 1723 | Qiao Zhang, Hervé Manier, Marie-Ange Manier. A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times |
| 1724 | -- | 1733 | Pablo San Segundo. A new DSATUR-based algorithm for exact vertex coloring |
| 1734 | -- | 1744 | Kevin R. Gue, Hyun-Ho Kim. Predicting departure times in multi-stage queueing systems |
| 1745 | -- | 1753 | Luis Fanjul-Peyro, Rubén Ruiz. Scheduling unrelated parallel machines with optional machines and jobs selection |
| 1754 | -- | 1762 | Dilip Datta, José Rui Figueira. Some convergence-based M-ary cardinal metrics for comparing performances of multi-objective optimizers |
| 1763 | -- | 1770 | Xiaolin Huang, Jun Xu 0008, Xiaomu Mu, Shuning Wang. The hill detouring method for minimizing hinging hyperplanes functions |
| 1771 | -- | 1778 | Hamid S. Mirmohammadi, Kourosh Eshghi. A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale |
| 1779 | -- | 1789 | Chunhua Men, H. Edwin Romeijn, Anneyuko Saito, James F. Dempsey. An efficient approach to incorporating interfraction motion in IMRT treatment planning |