External Links

    Journal: Computers & OR

    Volume 37, Issue 9

    1515 -- 1536Henrik Andersson, Arild Hoff, Marielle Christiansen, Geir Hasle, Arne Løkketangen. Industrial aspects and literature survey: Combined inventory management and routing
    1537 -- 1543Zhixin Liu. Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
    1544 -- 1556Daniel T. Wojtaszek, John W. Chinneck. Faster MIP solutions via new node selection rules
    1557 -- 1569Francesca Guerriero, L. Talarico. A solution approach to find the critical path in a time-constrained activity network
    1570 -- 1583Manuel López-Ibáñez, Christian Blum. Beam-ACO for the travelling salesman problem with time windows
    1584 -- 1596A. Berrichi, Farouk Yalaoui, Lionel Amodeo, M. Mezghiche. Bi-Objective Ant Colony Optimization approach to optimize production and maintenance scheduling
    1597 -- 1609Fernando García, Francisco Guijarro, Ismael Moya. A goal programming approach to estimating performance weights for ranking firms
    1610 -- 1614Ismael Regis de Farias Jr., Hongxia Zhao, Ming Zhao. A family of inequalities valid for the robust single machine scheduling polyhedron
    1615 -- 1623Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen. The dynamic multi-period vehicle routing problem
    1624 -- 1640Xianpeng Wang, Lixin Tang. A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
    1641 -- 1647Andreas Bley, Natashia Boland, Christopher Fricke, Gary Froyland. A strengthened formulation and cutting planes for the open pit mine production scheduling problem
    1648 -- 1661Burcu B. Keskin, Sharif H. Melouk, Ivan L. Meyer. A simulation-optimization approach for integrated sourcing and inventory decisions
    1662 -- 1673Luc Muyldermans, Gu Pang. A guided local search procedure for the multi-compartment capacitated arc routing problem

    Volume 37, Issue 8

    1359 -- 1360Enza Messina, Marcello Sanguineti. Guest editorial
    1361 -- 1368Marco Antoniotti, Marco Carreras, Antonella Farinaccio, Giancarlo Mauri, Daniele Merico, Italo Zoppis. An application of kernel methods to gene cluster temporal meta-analysis
    1369 -- 1380Ujjwal Maulik, Anirban Mukhopadhyay. Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data
    1381 -- 1388Mariá Cristina Vasconcelos Nascimento, Franklina Maria Bragion Toledo, André Carlos Ponce de Leon Ferreira de Carvalho. Investigation of a new GRASP-based clustering algorithm applied to biological data
    1389 -- 1394Domenico Conforti, Rosita Guido. Kernel based support vector machine via semidefinite programming: Application to medical diagnosis
    1395 -- 1405Francesco Archetti, Ilaria Giordani, Leonardo Vanneschi. Genetic programming for anticancer therapeutic response prediction using the NCI-60 dataset
    1406 -- 1412Roberto Lucchetti, Stefano Moretti, Fioravante Patrone, Paola Radrizzani. The Shapley and Banzhaf values in microarray games
    1413 -- 1418Stefano Moretti. Statistical analysis of the Shapley value for microarray games
    1419 -- 1426Paola Bertolazzi, Giovanni Felici, Paola Festa. Logic based methods for SNPs tagging and reconstruction
    1427 -- 1438Julio Vera, Carlos González-Alcón, Alberto Marín-Sanguino, Néstor V. Torres. Optimization of biochemical systems through mathematical programming: Methods and applications
    1439 -- 1454Imma Ribas, Rainer Leisten, Jose M. Framiñan. Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
    1455 -- 1463Oded Berman, Jiamin Wang. The network p-median problem with discrete probabilistic demand weights
    1464 -- 1471Safia Kedad-Sidhoum, Francis Sourd. Fast neighborhood search for the single machine earliness-tardiness scheduling problem
    1472 -- 1487R. Andriansyah, Tom Van Woensel, Frederico R. B. Cruz, Luiz Duczmal. Performance optimization of open zero-buffer multi-server queueing networks
    1488 -- 1499Csaba Raduly-Baka, Timo Knuutila, Mika Johnsson, Olli Nevalainen. Construction of component tapes for radial placement machines
    1500 -- 1509Leon S. Lasdon, Abraham Duarte, Fred Glover, Manuel Laguna, Rafael Martí. Adaptive memory programming for constrained global optimization
    1510 -- 1514Suh-Jenq Yang, Dar-Li Yang, T. C. Edwin Cheng. Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance

    Volume 37, Issue 7

    1157 -- 0Antonis Economou. Algorithmic and computational methods in retrial queues
    1158 -- 1166Jesus R. Artalejo, Maria Jesus Lopez-Herrero. Cellular mobile networks with repeated calls operating in random environment
    1167 -- 1173Ivan Atencia, I. Fortes, S. Nishimura, S. Sánchez. A discrete-time retrial queueing system with recurrent customers
    1174 -- 1180Konstantin Avrachenkov, Uri Yechiali. On tandem blocking queues with a common retrial queue
    1181 -- 1190Ioannis Dimitriou, Christos Langaris. A repairable queueing model with two-phase service, start-up times and retrial customers
    1191 -- 1198Tien Van Do. An efficient solution to a retrial queue for the performability evaluation of DHCP
    1199 -- 1211Antonio Gómez-Corral. On the applicability of the number of collisions in p-persistent CSMA/CD protocols
    1212 -- 1219Jeongsim Kim, Bara Kim, Jerim Kim. Moments of the queue size distribution in the MAP/G/1 retrial queue
    1220 -- 1227Bara Kim, Jeongsim Kim. Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue
    1228 -- 1237Che Soong Kim, Valentina I. Klimenok, Vilena Mushko, Alexander N. Dudin. The BMAP/PH/N retrial queueing system operating in Markovian random environment
    1238 -- 1246Che Soong Kim, Valentina I. Klimenok, Olga Taramin. A tandem retrial queueing system with two Markovian flows and reservation of channels
    1247 -- 1255B. Krishna Kumar, G. Vijayalakshmi, A. Krishnamoorthy, S. Sadiq Basha. A single server feedback retrial queue with collisions
    1256 -- 1261Maria Jesus Lopez-Herrero. Waiting time and other first-passage time measures in an (s, S) inventory system with repeated attempts and finite retrial group
    1262 -- 1270Yang Woo Shin, Dug Hee Moon. Approximations of retrial queue with limited number of retrials
    1271 -- 1284Pavithra Harsha, Cynthia Barnhart, David C. Parkes, Haoqi Zhang. Strong activity rules for iterative combinatorial auctions
    1285 -- 1297K. P. Anagnostopoulos, G. Mamanis. A portfolio optimization model with three objectives and discrete variables
    1298 -- 1307Ada Barlatt, Amy Mainville Cohn, Oleg Yu. Gusikhin. A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
    1308 -- 1317Johan Oppen, Arne Løkketangen, Jacques Desrosiers. Solving a rich vehicle routing and inventory problem using column generation
    1318 -- 1327Ernesto G. Birgin, Jan M. Gentil. New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
    1328 -- 1347H. M. Soroush. Solving a stochastic single machine problem with initial idle time and quadratic objective
    1348 -- 1358Pedro Martins. Extended and discretized formulations for the maximum clique problem

    Volume 37, Issue 6

    991 -- 1001Rita Macedo, Cláudio Alves, José M. Valério de Carvalho. Arc-flow model for the two-dimensional guillotine cutting stock problem
    1002 -- 1013Sinan Gürel, Ersin Körpeoglu, M. Selim Aktürk. An anticipative scheduling approach with controllable processing times
    1014 -- 1026Niklaus Eggenberg, Matteo Salani, Michel Bierlaire. Constraint-specific recovery network for solving airline recovery problems
    1027 -- 1032Yong Xia. An efficient continuation method for quadratic assignment problems
    1033 -- 1044Arnaud Liefooghe, Laetitia Jourdan, El-Ghazali Talbi. Metaheuristics and cooperative approaches for the Bi-objective Ring Star Problem
    1045 -- 1054André Rossi, Alok Singh, Marc Sevaux. A metaheuristic for the fixed job scheduling problem under spread time constraints
    1055 -- 1067Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic, Dragan Urosevic. Variable neighbourhood decomposition search for 0-1 mixed integer programs
    1068 -- 1074Duanbing Chen, Jingfa Liu, Yan Fu, Mingsheng Shang. An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
    1075 -- 1086Catia M. S. Machado, Sergio F. Mayerle, Vilmar Trevisan. A linear model for compound multicommodity network flow problems
    1087 -- 1090Sarah M. Estelle, Andy L. Johnson, John Ruggiero. Three-stage DEA models for incorporating exogenous inputs
    1091 -- 1099Daiki Min, Yuehwern Yih. An elective surgery scheduling problem considering patient priority
    1100 -- 1112Mir Saman Pishvaee, Reza Zanjirani Farahani, Wout Dullaert. A memetic algorithm for bi-objective integrated forward/reverse logistics network design
    1113 -- 1122Maristela Oliveira Santos, Sadao Massago, Bernardo Almada-Lobo. Infeasibility handling in genetic algorithm using nested domains for production planning
    1123 -- 1128T. C. Edwin Cheng, Xiuli Wang. Machine scheduling with job class setup and delivery considerations
    1129 -- 1138Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl. Variable neighborhood search for the dial-a-ride problem
    1139 -- 1147Yusin Lee, Yen-Ju Lee. A heuristic for retrieving containers from a yard
    1148 -- 1156Saadettin Erhan Kesen, Sanchoy K. Das, Zülal Güngör. A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs)

    Volume 37, Issue 5

    807 -- 808Jens Clausen, Allan Larsen, Jesper Larsen. Foreword
    809 -- 821Jens Clausen, Allan Larsen, Jesper Larsen, Natalia J. Rezanova. Disruption management in the airline industry - Concepts, models and methods
    822 -- 832Edmund K. Burke, Patrick De Causmaecker, Geert De Maere, Jeroen Mulder, Marc Paelinck, Greet Vanden Berghe. A multi-objective approach for robust airline scheduling
    833 -- 844Oliver Weide, David Ryan, Matthias Ehrgott. An iterative approach to robust and integrated aircraft routing and crew scheduling
    845 -- 856Natalia J. Rezanova, David M. Ryan. The train driver recovery problem - A set partitioning based model and solution method
    857 -- 868Christian Liebchen, Michael Schachtebeck, Anita Schöbel, Sebastian Stiller, André Prigge. Computing delay resistant railway timetables
    869 -- 879Satish V. Ukkusuri, Gitakrishnan Ramadurai, Gopal Patil. A robust transportation signal control problem accounting for traffic dynamics
    880 -- 889El Houssaine Aghezzaf, Carles Sitompul, Najib M. Najid. Models for robust tactical planning in multi-stage production systems with uncertain demands
    890 -- 898Mohamed Ali Aloulou, Christian Artigues. Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
    899 -- 908Singa Wang Chiu. Robust planning in optimization for production system subject to random machine breakdown and failure in rework
    909 -- 915A. Volgenant, C. W. Duin. Improved polynomial algorithms for robust bottleneck problems with interval data
    916 -- 926Cameron G. Walker, Michael J. O Sullivan. Core-Edge design of storage area networks - A Single-edge formulation with problem-specific cuts
    927 -- 937Jinwei Gu, Manzhan Gu, Cuiwen Cao, Xingsheng Gu. A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
    938 -- 949Mateus Rocha de Paula, Geraldo Robson Mateus, Martín Gómez Ravetti. A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
    950 -- 959Ran Liu, Zhibin Jiang, Richard Y. K. Fung, Feng Chen, Xiao Liu. Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
    960 -- 969Hua Gong, Lixin Tang, C. W. Duin. A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
    970 -- 980Jean-François Cordeau, Mauro Dell Amico, Manuel Iori. Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
    981 -- 990Kaj Holmberg. Heuristics for the rural postman problem

    Volume 37, Issue 4

    611 -- 620Y. 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 -- 629Yaodong Cui, Dao-yun Xu. Strips minimization in two-dimensional cutting stock of circular items
    630 -- 639Ana 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 -- 648Daniel 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 -- 667Xinyu Li, Liang Gao, Xinyu Shao, Chaoyong Zhang, Cuiyu Wang. Mathematical modeling and evolutionary algorithm-based approach for integrated process planning and scheduling
    668 -- 683Feng Pan, Rakesh Nagi. Robust supply chain design under uncertain demand in agile manufacturing
    684 -- 691Deisemara 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 -- 699Luís Gouveia, Maria Cåndida Mourão, Leonor Santiago Pinto. Lower bounds for the mixed capacitated arc routing problem
    700 -- 711José Rui Figueira, Gabriel Tavares, Margaret M. Wiecek. Labeling algorithms for multiple objective integer knapsack problems
    712 -- 723Emmanouil E. Zachariadis, Chris T. Kiranoudis. An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
    724 -- 737Yuichi Nagata, Olli Bräysy, Wout Dullaert. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
    738 -- 753Laureano 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 -- 768B. Naderi, Rubén Ruiz. The distributed permutation flowshop scheduling problem
    769 -- 778Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. A search space cartography for guiding graph coloring heuristics
    779 -- 789Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan. Bicriteria robotic operation allocation in a flexible manufacturing cell
    790 -- 805Jun Woo Kim, Sang-Chan Park. Outsourcing strategy in two-stage call centers

    Volume 37, Issue 3

    430 -- 431Christian Blum. Hybrid Metaheuristics
    432 -- 442Yannis Marinakis, Magdalene Marinaki. A Hybrid Multi-Swarm Particle Swarm Optimization algorithm for the Probabilistic Traveling Salesman Problem
    443 -- 455Panagiotis P. Repoussis, Christos D. Tarantilis, Olli Bräysy, George Ioannou. A hybrid evolution strategy for the open vehicle routing problem
    456 -- 469Antoniya Georgieva, Ivan Jordanov. A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points
    470 -- 480Luis V. Santana-Quintero, Alfredo García Hernández-Díaz, Julián Molina Luque, Carlos A. Coello Coello, Rafael Caballero. DEMORS: A hybrid multi-objective optimization algorithm using differential evolution and rough set theory for constrained problems
    481 -- 497Manuel Lozano, Carlos García-Martínez. Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: Overview and progress report
    498 -- 508Mauricio G. C. Resende, Rafael Martí, Micael Gallego, Abraham Duarte. GRASP and path relinking for the max-min diversity problem
    509 -- 520Ling Wang, Quan-ke Pan, Ponnuthurai N. Suganthan, Wen-Hong Wang, Ya-min Wang. A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
    521 -- 533Thibaut Lust, Andrzej Jaszkiewicz. Speed-up techniques for solving large-scale biobjective TSP
    534 -- 542Roberto Battiti, Franco Mascia. Reactive and dynamic local search for max-clique: Engineering effective building blocks
    543 -- 551Roberto Montemanni, Derek H. Smith. Heuristic manipulation, tabu search and frequency assignment
    552 -- 558Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena. Clustering search algorithm for the capacitated centered clustering problem
    559 -- 574Verena Schmid, Karl F. Doerner, Richard F. Hartl, Juan José Salazar González. Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
    575 -- 581Inmaculada Rodríguez Martín, Juan José Salazar González. A local branching heuristic for the capacitated fixed-charge network design problem
    582 -- 597Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová. Decomposition, reformulation, and diving in university course timetabling
    598 -- 609Matthew R. Gibson, Jeffrey W. Ohlmann, Michael J. Fry. An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition

    Volume 37, Issue 2

    223 -- 235Mohamed Ouzineb, Mustapha Nourelfath, Michel Gendreau. An efficient heuristic for reliability design optimization problems
    236 -- 246B. Naderi, Rubén Ruiz, M. Zandieh. Algorithms for a realistic variant of flowshop scheduling
    247 -- 255Sameh Al-Shihabi, Sigurdur Ólafsson. A hybrid of Nested Partition, Binary Ant System, and Linear Programming for the multidimensional knapsack problem
    256 -- 264Marcel T. Kalsch, Zvi Drezner. Solving scheduling and location problems in the plane simultaneously
    265 -- 272Beatriz Abdul-Jalbar, Anders Segerstedt, Joaquin Sicilia, Andreas Nilsson. A new heuristic to solve the one-warehouse N-retailer problem
    273 -- 281Thomas Begin, Bruno Baynat, Francis Sourd, Alexandre Brandwajn. A DFO technique to calibrate queueing models
    282 -- 291Alex J. Ruiz-Torres, José H. Ablanedo-Rosas, Johnny C. Ho. Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
    292 -- 301Antonio J. Lozano, Juan A. Mesa, Frank Plastria. Finding an Euclidean anti-k-centrum location of a set of points
    302 -- 314Seong-in Kim, Junghee Han, Youngho Lee, Eunkyung Park. Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
    315 -- 324Jose A. Egea, Rafael Martí, Julio R. Banga. An evolutionary method for complex-process optimization
    325 -- 333Shinji Imahori, Mutsunori Yagiura. The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
    334 -- 340A. Volgenant, C. W. Duin. On a pair of job-machine assignment problems with two stages
    341 -- 350Zhaolin Li, Feng Tao. On determining optimal fleet size and vehicle transfer policy for a car rental company
    351 -- 367Fabien Tricoire, Martin Romauch, Karl F. Doerner, Richard F. Hartl. Heuristics for the multi-period orienteering problem with multiple time windows
    368 -- 375Lixin Tang, Huizhi Ren. Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
    376 -- 389Hsiao-Fan Wang, Hsin-Wei Hsu. A closed-loop logistic model with a spanning-tree based genetic algorithm
    390 -- 395Eduardo Fernandez, Edy Lopez, Sergio Bernal, Carlos A. Coello Coello, Jorge Navarro. Evolutionary multiobjective optimization using an outranking-based dominance generalization
    396 -- 405Yongjun Xiao, Kevin Taaffe. Satisfying market demands with delivery obligations or delivery charges
    406 -- 416Gudrun P. Kiesmüller, R. A. C. M. Broekmeulen. The benefit of VMI strategies in a stochastic multi-product serial two echelon system
    417 -- 425Wen-Chih Chen, Andrew L. Johnson. A unified model for detecting efficient and inefficient outliers in data envelopment analysis
    426 -- 427Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen. Erratum to An algorithm for ranking assignments using reoptimization [Computers & Operations Research 35 (2008) 3714-3726]

    Volume 37, Issue 12

    2041 -- 2061Arild Hoff, Henrik Andersson, Marielle Christiansen, Geir Hasle, Arne Løkketangen. Industrial aspects and literature survey: Fleet composition and routing
    2062 -- 2070Imma Ribas, Ramón Companys, Xavier Tort-Martorell. Comparing three-step heuristics for the permutation flow shop problem
    2071 -- 2081Xiangyong Li, M. F. Baki, Yash P. Aneja. An ant colony optimization metaheuristic for machine-part cell formation problems
    2082 -- 2088Anis Gharbi, Mohamed Labidi. Jackson s semi-preemptive scheduling on a single machine
    2089 -- 2105Emmanouil E. Zachariadis, Chris T. Kiranoudis. A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem
    2106 -- 2120Majid Salari, Paolo Toth, Andrea Tramontani. An ILP improvement procedure for the Open Vehicle Routing Problem
    2121 -- 2130Rudolf Vetschera. A general branch-and-bound algorithm for fair division problems
    2131 -- 2140Evelina Klerides, Eleni Hadjiconstantinou. A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations
    2141 -- 2151Bernat Gacias, Christian Artigues, Pierre Lopez. Parallel machine scheduling with precedence constraints and setup times
    2152 -- 2163Ayed A. Salman, Imtiaz Ahmad, Mahamed G. H. Omran, Mohammad Gh. Mohammad. Frequency assignment problem in satellite communications using differential evolution
    2164 -- 2172Geraldo R. Mauri, Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lorena. A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
    2173 -- 2181Bacel Maddah, Muhammad El-Taha, Roy Abou Tayeh. Optimal allocation of servers and processing time in a load balancing system
    2182 -- 2191Burcu Baris Keskin, Halit Üster, Sila Çetinkaya. Integration of strategic and tactical decisions for vendor selection under capacity constraints
    2192 -- 2201Abir Ben Hmida, Mohamed Haouari, Marie-José Huguet, Pierre Lopez. Discrepancy search for the flexible job shop scheduling problem
    2202 -- 2217Jonathan F. Bard, Narameth Nananukul. A branch-and-price algorithm for an integrated production and inventory routing problem
    2218 -- 2228Dvir Shabtay, Yisrael Itskovich, Liron Yedidsion, Daniel Oron. Optimal due date assignment and resource allocation in a group technology scheduling environment
    2229 -- 2238Yi-Kuei Lin, Cheng-Ta Yeh. Optimal resource assignment to maximize multistate network reliability for a computer network
    2239 -- 2247Paula Sarabando, Luis C. Dias. Simple procedures of choice in multicriteria problems without precise information about the alternatives values
    2248 -- 2256Zhirong Liang, Yanzhi Li, Andrew Lim, Songshan Guo. Load balancing in project assignment
    2257 -- 2269Tsung-Che Chiang, Hsueh-Chien Cheng, Li-Chen Fu. A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
    2270 -- 2280A. M. Benjamin, J. E. Beasley. Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities

    Volume 37, Issue 11

    1833 -- 1834Christian Prins, Nacima Labadi, Caroline Prodhon, Roberto Wolfler Calvo. Metaheuristics for logistics and vehicle routing
    1835 -- 1843Faicel Hnaien, Xavier Delorme, Alexandre Dolgui. Multi-objective optimization for inventory control in two-level assembly systems under uncertainty of lead times
    1844 -- 1852Boris Bontoux, Christian Artigues, Dominique Feillet. A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem
    1853 -- 1859Wouter Souffriau, Pieter Vansteenwegen, Greet Vanden Berghe, Dirk Van Oudheusden. A Path Relinking approach for the Team Orienteering Problem
    1860 -- 1869Claudia Archetti, Dominique Feillet, Alain Hertz, Maria Grazia Speranza. The undirected capacitated arc routing problem with profits
    1870 -- 1876Pieter Vansteenwegen, Wouter Souffriau, Kenneth Sörensen. Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows
    1877 -- 1885Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo. An effective memetic algorithm for the cumulative capacitated vehicle routing problem
    1886 -- 1898Jorge E. Mendoza, Bruno Castanier, Christelle Guéret, Andrés L. Medaglia, Nubia Velasco. A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
    1899 -- 1911Anand Subramanian, Lúcia Maria de A. Drummond, Cristiana Bentes, Luiz Satoru Ochi, Ricardo C. Farias. A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
    1912 -- 1923Christophe Duhamel, Philippe Lacomme, Christian Prins, Caroline Prodhon. A GRASP×ELS approach for the capacitated location-routing problem
    1924 -- 1938Kailiang Xu, Zuren Feng, Keliang Jun. A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
    1939 -- 1951Prasanna Balaprakash, Mauro Birattari, Thomas Stützle, Marco Dorigo. Estimation-based metaheuristics for the probabilistic traveling salesman problem
    1952 -- 1964Zahra Naji Azimi, Majid Salari, Bruce L. Golden, S. Raghavan, Paolo Toth. Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
    1965 -- 1967Gur Mosheiov, Assaf Sarig, Jeffrey B. Sidney. The Browne-Yechiali single-machine sequence is optimal for flow-shops
    1968 -- 1976Ana de Almeida, Marisa B. Figueiredo. A particular approach for the Three-dimensional Packing Problem with additional constraints
    1977 -- 1986Francisco Gortázar, Abraham Duarte, Manuel Laguna, Rafael Martí. Black box scatter search for general classes of binary optimization problems
    1987 -- 1998Yingtao Ren, Maged M. Dessouky, Fernando Ordóñez. The multi-shift vehicle routing problem with overtime
    1999 -- 2006Rasmus Resen Amossen, David Pisinger. Multi-dimensional bin packing problems with guillotine constraints
    2007 -- 2016Huizhen Zhang, Cesar Beltran-Royo, Miguel Constantino. Effective formulation reductions for the quadratic assignment problem
    2017 -- 2026Enrico Angelelli, Renata Mansini, Maria Grazia Speranza. Kernel search: A general heuristic for the multi-dimensional knapsack problem
    2027 -- 2039Anita Petrick, Jochen Gönsch, Claudius Steinhardt, Robert Klein. Dynamic control mechanisms for revenue management with flexible products

    Volume 37, Issue 10

    1675 -- 1687Oded Berman, Zvi Drezner, Dmitry Krass. Generalized coverage: New developments in covering location models
    1688 -- 1696Arnaud Fréville, Saïd Hanafi, Frédéric Semet, Nicola Yanev. A tabu search with an oscillation strategy for the discriminant analysis problem
    1697 -- 1707Yan Chen, Shingo Mabu, Kotaro Hirasawa. A model of portfolio optimization using time adapting genetic network programming
    1708 -- 1719Srinivas Peeta, F. Sibel Salman, Dilek Gunnec, Kannan Viswanath. Pre-disaster investment decisions for strengthening a highway network
    1720 -- 1730N. Rafiee Parsa, Behrooz Karimi, Ali Husseinzadeh Kashan. A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
    1731 -- 1739Zhe Liang, Wanpracha Art Chaovalitwongse, Meeyoung Cha, Sue B. Moon. Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms
    1740 -- 1748Paz Perez-Gonzalez, Jose M. Framiñan. Setting a common due date in a constrained flowshop: A variable neighbourhood search approach
    1749 -- 1761Luke Schenk, Diego Klabjan. Intra market optimization for express package carriers with station to station travel and proportional sorting
    1762 -- 1773Temel Öncan, Abraham P. Punnen. The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm
    1774 -- 1779Leizer Lima Pinto, Marta M. B. Pascoal. On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
    1780 -- 1796Lixin Tang, Yang Yang, Jiyin Liu. An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
    1797 -- 1804Mark H. McElreath, Maria E. Mayorga, Mary E. Kurz. Metaheuristics for assortment problems with multiple quality levels
    1805 -- 1813Ivairton M. Santos, Carlos A. J. Martinhon, Luiz Satoru Ochi. Near-optimal solutions for the generalized max-controlled set problem
    1814 -- 1821Yan Zhang, Zhili Zhou, Jiyin Liu. The production scheduling problem in a multi-page invoice printing system
    1822 -- 1832Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz. An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring

    Volume 37, Issue 1

    1 -- 19Graham Kendall, Sigrid Knust, Celso C. Ribeiro, Sebastián Urrutia. Scheduling in sports: An annotated bibliography
    20 -- 31Brian Q. Rieksts, Jose A. Ventura. Two-stage inventory models with a bi-modal transportation cost
    32 -- 41Nils Boysen. Truck scheduling at zero-inventory cross docking terminals
    42 -- 49Russell D. Meller, Zeynep Kirkizoglu, Weiping Chen. A new optimization model to support a bottom-up approach to facility design
    50 -- 61Jiaquan Gao, Jun Wang. WBMOAIS: A novel artificial immune system for multiobjective optimization
    62 -- 71B. Srirangacharyulu, G. Srinivasan. Completion time variance minimization in single machine and multi-machine systems
    72 -- 82Ibrahim Akgün, Barbaros Ç. Tansel. Min-degree constrained minimum spanning tree problem: New formulation via Miller-Tucker-Zemlin constraints
    83 -- 90C. T. Ng, Ji-Bo Wang, T. C. Edwin Cheng, L. L. Liu. A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
    91 -- 98Vincent Raymond, François Soumis, Dominique Orban. A new version of the Improved Primal Simplex for degenerate linear programs
    99 -- 107Hasan Bal, H. Hasan Örkcü, Salih Çelebioglu. Improving the discrimination power and weights dispersion in the data envelopment analysis
    108 -- 114Charles Bordenave, Michel Gendreau, Gilbert Laporte. Heuristics for the mixed swapping problem
    115 -- 122Anita Schöbel, Daniel Scholz. The big cube small cube solution method for multidimensional facility location problems
    123 -- 136Alper Murat, Vedat Verter, Gilbert Laporte. A continuous analysis framework for the solution of location-allocation problems with dense demand
    137 -- 151Hui Li, Jie Sun. Business failure prediction using hybrid:::2::: case-based reasoning (H:::2:::CBR)
    152 -- 162Fardin Ahmadizar, Mehdi Ghazanfari, Seyyed M. T. Fatemi Ghomi. Group shops scheduling with makespan criterion subject to random release dates and processing times
    163 -- 171Shimon Abravaya, Michael Segal. Maximizing the number of obnoxious facilities to locate within a bounded region
    172 -- 181Bing Han, Jimmy Leblet, Gwendal Simon. Hard multidimensional multiple choice knapsack problems, an empirical study
    182 -- 188Nadjib Brahimi, Stéphane Dauzère-Pérès, Laurence A. Wolsey. Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
    189 -- 198Tatsushi Nishi, Yuichiro Hiranaka, Masahiro Inuiguchi. Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness
    199 -- 212Nasser Salmasi, Rasaratnam Logendran, Mohammad Reza Skandari. Total flow time minimization in a flowshop sequence-dependent group scheduling problem
    213 -- 221B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri, M. Zandieh. A contribution and new heuristics for open shop scheduling
    runs on