Journal: Computers & OR

Volume 38, Issue 9

1238 -- 1250Jonathan Gaudreault, Jean-Marc Frayret, Alain Rousseau, Sophie D Amours. Combined planning and scheduling in a divergent production system with co-production: A case study in the lumber industry
1251 -- 1258Yongma Moon, Tao Yao. A robust mean absolute deviation model for portfolio optimization
1259 -- 1266Antoine Jouglet, David Savourey. Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
1267 -- 1274Hua Gong, Lixin Tang. Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
1275 -- 1285Ada Che, Hongjian Hu, Michelle Chabrol, Michel Gourgand. A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
1286 -- 1293Roberto Fernandes Tavares Neto, Moacir Godinho Filho. An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed
1294 -- 1304Ruoxi Guan, Xiaobo Zhao. Pricing and inventory management in a system with multiple competing retailers under (r, Q) policies
1305 -- 1318Maria Elena Bruni, Patrizia Beraldi, Francesca Guerriero, Erika Pinto. A heuristic approach for resource constrained project scheduling with uncertain activity durations
1319 -- 1334Juan G. Villegas, Christian Prins, Caroline Prodhon, Andrés L. Medaglia, Nubia Velasco. A GRASP with evolutionary path relinking for the truck and trailer routing problem
1335 -- 1341Joe Naoum-Sawaya, Samir Elhedhli. An interior point cutting plane heuristic for mixed integer programming
1342 -- 1350Andrea Cassioli, Marco Locatelli. A heuristic approach for packing identical rectangles in convex regions
1351 -- 1360Wen-Min Lu, Shiu-Wan Hung. Exploring the efficiency and effectiveness in global e-retailing companies
1361 -- 1365M. Duran Toksari. A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs

Volume 38, Issue 8

1091 -- 1102Banu Soylu. A multi-criteria sorting procedure with Tchebycheff utility function
1103 -- 1108Sven Oliver Krumke, Alfred Taudes, Stephan Westphal. Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
1109 -- 1116Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte. A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
1117 -- 1130Brijesh Paul, Chandrasekharan Rajendran. Rationing mechanisms and inventory control-policy parameters for a divergent supply chain operating with lost sales and costs of review
1131 -- 1142Luis Cadarso, Ángel Marín. Robust rolling stock in rapid transit networks
1143 -- 1152Jennifer Pryor, John W. Chinneck. Faster integer-feasibility in mixed-integer linear programs by branching to force change
1153 -- 1163Jordi Pereira, Igor Averbakh. Exact and heuristic algorithms for the interval data robust assignment problem
1164 -- 1174Ali Mohammad Nezhad, Hashem Mahlooji. A revised particle swarm optimization based discrete Lagrange multipliers method for nonlinear programming problems
1175 -- 1187Yi-Kuei Lin, Cheng-Ta Yeh. Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget
1188 -- 1198Ilhem Boussaïd, Amitava Chatterjee, Patrick Siarry, Mohamed Ahmed-Nacer. Two-stage update biogeography-based optimization using differential evolution algorithm (DBBO)
1199 -- 1209Vinícius Amaral Armentano, A. L. Shiguemoto, Arne Løkketangen. Tabu search with path relinking for an integrated production-distribution problem
1210 -- 1218Xiaoyan Zhu, Qi Yuan, Alberto Garcia-Diaz, Liang Dong. Minimal-cost network flow problems with variable lower bounds on arc flows
1219 -- 1236Jérémie Dubois-Lacoste, Manuel López-Ibáñez, Thomas Stützle. A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems

Volume 38, Issue 7

985 -- 991Karin S. de Smidt-Destombes, Nicole P. van Elst, Ana Isabel Barros, Harm Mulder, Jan A. M. Hontelez. A spare parts model with cold-standby redundancy on system level
992 -- 1007James T. Lin, Cheng-Hung Wu, Tzu-Li Chen, Shin-Hui Shih. A stochastic programming model for strategic capacity planning in thin film transistor-liquid crystal display (TFT-LCD) industry
1008 -- 1013Chun-Feng Wang, San-yang Liu. A new linearization method for generalized linear multiplicative programming
1014 -- 1024Martino Luis, Saïd Salhi, Gábor Nagy. A guided reactive GRASP for the capacitated multi-source Weber problem
1025 -- 1034Chin-Chia Wu, Peng-Hsiang Hsu, Juei-Chao Chen, Nae-Sheng Wang. Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
1035 -- 1044Edmund K. Burke, Matthew R. Hyde, Graham Kendall. A squeaky wheel optimisation methodology for two-dimensional strip packing
1045 -- 1053Jaehwan Yang. Minimizing total completion time in two-stage hybrid flow shop with dedicated machines
1054 -- 1065Cristiano Arbex Valle, Leonardo Conegundes Martinez, Alexandre Salles da Cunha, Geraldo Robson Mateus. Heuristic and exact algorithms for a min-max selective vehicle routing problem
1066 -- 1075Una Benlic, Jin-Kao Hao. An effective multilevel tabu search approach for balanced graph partitioning
1076 -- 1085Davide Anghinolfi, Roberto Montemanni, Massimo Paolucci 0002, Luca Maria Gambardella. A hybrid particle swarm optimization approach for the sequential ordering problem
1086 -- 1090Sandro Lorini, Jean-Yves Potvin, Nicolas Zufferey. Online vehicle routing and scheduling with dynamic travel times

Volume 38, Issue 6

889 -- 900Rim Larbi, Gülgün Alpan, Pierre Baptiste, Bernard Penz. Scheduling cross docking operations under full, partial and no information on inbound arrivals
901 -- 916Y. K. Lin, Michele E. Pfund, John W. Fowler. Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
917 -- 930Andrew Lim, Hong Ma, Brian Rodrigues, Sun-Teck Tan, Fei Xiao. New concepts for activity float in resource-constrained project management
931 -- 941José-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo. A Branch-and-Cut method for the Capacitated Location-Routing Problem
942 -- 953Dong Tang, Udatta S. Palekar. Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
954 -- 966S. R. Balseiro, Irene Loiseau, J. Ramonet. An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows
967 -- 983Kerem Bülbül. A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem

Volume 38, Issue 5

809 -- 815Shih-Wei Lin, Zne-Jung Lee, Kuo-Ching Ying, Chung-Cheng Lu. Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
816 -- 823Edward Bernroider, Nikolaus Obwegeser, Volker Stix. Analysis of heuristic validity, efficiency and applicability of the profile distance method for implementation in decision support systems
824 -- 836Qian Tao, HuiYou Chang, Yang Yi, Chunqin Gu, Wen-Jie Li. A rotary chaotic PSO algorithm for trustworthy scheduling of a grid workflow
837 -- 853Rommel G. Regis. Stochastic radial basis function algorithms for large-scale optimization involving expensive black-box objective and constraint functions
854 -- 867Rui Zhang, Cheng Wu. A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective
868 -- 875John Larusic, Abraham P. Punnen. The balanced traveling salesmanproblem
876 -- 888Tatsushi Nishi, Yuichiro Hiranaka, Ignacio E. Grossmann. A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles

Volume 38, Issue 4

717 -- 722Yi Feng, Shaoxiang Chen, Arun Kumar, Bing Lin. Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in O(N log N) time
723 -- 739Christophe Duhamel, Philippe Lacomme, Caroline Prodhon. Efficient frameworks for greedy split and new depth first search split procedures for routing problems
740 -- 754J. MacGregor Smith. Properties and performance modelling of finite buffer M/G/1/K networks
755 -- 770Shan-Lin Yang, Ying Ma, Dong-Ling Xu, Jian-Bo Yang. Minimizing total completion time on a single machine with a flexible maintenance activity
771 -- 781M. Selim Akturk, Taylan Ilhan. Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
782 -- 796Tadeusz Sawik. Selection of a dynamic supply portfolio in make-to-order environment withrisks
797 -- 807Jiamin Liu, Yong Yue, Zongran Dong, Carsten Maple, Malcolm Keech. A novel hybrid tabu search approach to container loading

Volume 38, Issue 3

591 -- 604Ricardo García-Ródenas, Ángel Marín, Michael Patriksson. Column generation algorithms for nonlinear optimization, II: Numerical investigations
605 -- 616Line Blander Reinhardt, David Pisinger. Multi-objective and multi-constrained non-additive shortest path problems
617 -- 640Christophe Duhamel, Philippe Lacomme, Alain Quilliot, Hélène Toussaint. A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
641 -- 650Jianmai Shi, Guoqing Zhang, Jichang Sha. Optimal production planning for a multi-product closed loop system with uncertain demand and return
651 -- 659Peter Buchholz, Ingo Schulz. Numerical analysis of continuous time Markov decision processes over finite horizons
660 -- 665Baruch Mor, Gur Mosheiov. Total absolute deviation of job completion times on uniform and unrelated machines
666 -- 673June-Young Bang, Yeong-Dae Kim. Scheduling algorithms for a semiconductor probing facility
674 -- 682Jörg Kalcsics. The multi-facility median problem with Pos/Neg weights on general graphs
683 -- 693Frank Meisel, Christian Bierwirth. A unified approach for the evaluation of quay crane scheduling models and algorithms
694 -- 701Tammy Drezner, Zvi Drezner. The gravity multiple server location problem
702 -- 712Kyoung Seok Shin, Jong-Oh Park, Yeo Keun Kim. Multi-objective FMS process planning with various flexibilities using a symbiotic evolutionary algorithm
713 -- 716M. C. Janssen, R. J. D. Verbeek, A. Volgenant. On scheduling a single machine with resource dependent release times

Volume 38, Issue 2

409 -- 419Hui Li, Hojjat Adeli, Jie Sun, Jian-Guang Han. Hybridizing principles of TOPSIS with case-based reasoning for business failure prediction
420 -- 426André Berger, Alexander Grigoriev, Joyce van Loon. Price strategy implementation
427 -- 434Camelia Al-Najjar, Behnam Malakooti. Hybrid-LP: Finding advanced starting points for simplex, and pivoting LP methods
435 -- 449Stefan Gollowitzer, Ivana Ljubic. MIP models for connected facility location: A theoretical and computational study
450 -- 463Alper Murat, Vedat Verter, Gilbert Laporte. A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand
464 -- 473Luís Henrique Sacchi, Vinícius Amaral Armentano. A computational study of parametric tabu search for 0-1 mixed integer programs
474 -- 483Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte. A large neighbourhood search heuristic for ship routing and scheduling with split loads
484 -- 495Luis E. Agustín-Blas, Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Antonio Portilla-Figueras, Ángel M. Pérez-Bellido, Silvia Jiménez-Fernández. Team formation based on group technology: A hybrid grouping genetic algorithm approach
496 -- 504Jin-Xiao Chen, Mingrong Deng, Sylvain Gingras. A modified super-efficiency measure based on simultaneous input-output projection in data envelopment analysis
505 -- 513Claudia D Ambrosio, Silvano Martello. Heuristic algorithms for the general nonlinear separable knapsack problem
514 -- 516Federico Della Croce, Andrea Grosso. Computational experience with a core-based reduction procedure for the 2-knapsack problem
517 -- 524Amaia Lusa, Rafael Pastor. Planning working time accounts under demand uncertainty
525 -- 538Inmaculada Espejo, Antonio M. Rodríguez-Chía. Simultaneous location of a service facility and a rapid transit line
539 -- 549Daniele Catanzaro, Éric Gourdin, Martine Labbé, F. Aykut Özsoy. A branch-and-cut algorithm for the partitioning-hub location-routing problem
550 -- 558Luis Gouveia, Ana Paias, Stefan Voß. Models for a traveling purchaser problem with additional side-constraints
559 -- 570Justo Puerto, A. B. Ramos, Antonio M. Rodríguez-Chía. Single-allocation ordered median hub location problems
571 -- 581Pablo San Segundo, Diego Rodríguez-Losada, Agustín Jiménez. An exact bit-parallel algorithm for the maximum clique problem
582 -- 590Sung-Seok Ko, Jin-Young Choi, Dong Won Seo. Approximations of lead-time distributions in an assemble-to-order system under a base-stock policy

Volume 38, Issue 12

1647 -- 1655Prahalad Venkateshan, Kamlesh Mathur. An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
1667 -- 1677S. Kamal Chaharsooghi, Jafar Heydari, Isa Nakhai Kamalabadi. Simultaneous coordination of order quantity and reorder point in a two-stage supply chain
1678 -- 1695Yüce Çinar, Hande Yaman. The vendor location problem
1696 -- 1704Ismail Capar, Burak Eksioglu, Joseph Geunes. A decision rule for coordination of inventory and transportation in a two-stage supply chain with alternative supply sources
1705 -- 1718Marina A. Epelman, Archis Ghate, Robert L. Smith. Sampled fictitious play for approximate dynamic programming
1719 -- 1730Michael Schilde, Karl F. Doerner, Richard F. Hartl. Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
1731 -- 1746Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza. Analysis of the maximum level policy in a production-distribution system
1747 -- 1759Talal Al-Khamis, Rym M Hallah. A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity
1760 -- 1765T. C. Edwin Cheng, Chou-Jung Hsu, Yi-Chi Huang, Wen-Chiung Lee. Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
1766 -- 1774Marco Di Summa, Andrea Grosso, Marco Locatelli. Complexity of the critical node problem over trees
1775 -- 1783Hongtao Lei, Gilbert Laporte, Bo Guo. The capacitated vehicle routing problem with stochastic demands and time windows
1784 -- 1791Jin-Xiao Chen. Peer-estimation for multiple criteria ABC inventory classification
1792 -- 1804Wenxing Zhu, Geng Lin. A dynamic convexized method for nonconvex mixed integer nonlinear programming
1805 -- 1815D. Cherubini, A. Fanni, A. Mereu, Antonio Frangioni, C. Murgia, Maria Grazia Scutellà, P. Zuddas. Linear programming models for traffic engineering in 100 survivable networks under combined IS-IS/OSPF and MPLS-TE
1816 -- 1825Ross J. W. James, Bernardo Almada-Lobo. Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics
1826 -- 1835José A. González, Jordi Castro. A heuristic block coordinate descent approach for controlled tabular adjustment
1836 -- 1844Sven Oliver Krumke, Clemens Thielen, Stephan Westphal. Interval scheduling on related machines
1845 -- 1854Roberto Aringhieri, Daniele Catanzaro, Marco Di Summa. Optimal solutions for the balanced minimum evolution problem
1855 -- 1866Banu Soylu, Selda Kapan Ulusoy. A preference ordered classification for a multi-objective max-min redundancy allocation problem
1867 -- 1876Enrico Angelelli, Renata Mansini, Michele Vindigni. Look-ahead heuristics for the dynamic traveling purchaser problem
1877 -- 1896Saber M. Elsayed, Ruhul A. Sarker, Daryl Leslie Essam. Multi-operator based evolutionary algorithms for solving constrained optimization problems

Volume 38, Issue 11

1465 -- 1473Wei-Chang Yeh, Tsung-Jung Hsieh. Solving reliability redundancy allocation problems using an artificial bee colony algorithm
1474 -- 1482Teodor Gabriel Crainic, Guido Perboli, Walter Rei, Roberto Tadei. Efficient lower bounds and heuristics for the variable cost and size bin packing problem
1483 -- 1492Rosa M. V. Figueiredo, Martine Labbé, Cid C. de Souza. An exact approach to the problem of extracting an embedded network matrix
1493 -- 1500Oded Berman, Dmitry Krass, Jiamin Wang. The probabilistic gradual covering location problem on a network with discrete random demand weights
1501 -- 1512Cristina Corchero, F.-Javier Heredia. A stochastic programming model for the thermal optimal day-ahead bid problem with physical futures contracts
1513 -- 1520Xiaolan Liu, Shenghan Liu, Zhifeng Hao, Holger Mauch. Exact algorithm and heuristic for the Closest String Problem
1521 -- 1533Gerardo Minella, Rubén Ruiz, Michele Ciavotta. Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems
1534 -- 1542Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet. A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
1543 -- 1555Fabio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França. The open capacitated arc routing problem
1556 -- 1561Marnix Kammer, Marjan van den Akker, Han Hoogeveen. Identifying and exploiting commonalities for the job-shop scheduling problem
1562 -- 1571Oded Berman, Eduard Ianovsky, Dmitry Krass. Optimal search path for service in the presence of disruptions
1572 -- 1583Fabrizio Marinelli, Salvatore Nocella, Fabrizio Rossi, Stefano Smriglio. A Lagrangian heuristic for satellite range scheduling with resource constraints
1584 -- 1595Chan-Woo Park, Hyo-Seong Lee. A multi-class closed queueing maintenance network model with a parts inventory system
1596 -- 1609C. K. Y. Lin. A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
1610 -- 1619Daniele Catanzaro, Martine Labbé, Martha Salazar-Neumann. Reduction approaches for robust shortest path problems
1620 -- 1637Salvatore Greco, Milosz Kadzinski, Roman Slowinski. Selection of a representative value function in robust multiple criteria sorting
1638 -- 1645Stefano Moretti, Sirma Zeynep Alparslan Gök, Rodica Branzei, Stef Tijs. Connection situations under uncertainty and cost monotonic solutions

Volume 38, Issue 10

1367 -- 1376Tatjana Davidovic, Dusan Ramljak, Milica Selmic, Dusan Teodorovic. Bee colony optimization for the p-center problem
1377 -- 1399Pablo Adasme, Abdel Lisser, Ismael Soto. Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
1400 -- 1411Broos Maenhout, Mario Vanhoucke. An evolutionary approach for the nurse rerostering problem
1412 -- 1424Victor Boskamp, Alex Knoops, Flavius Frasincar, Adriana Gabor. Maximizing revenue with allocation of multiple advertisements on a Web banner
1425 -- 1434Bernt Olav Øvstebø, Lars Magnus Hvattum, Kjetil Fagerholt. Optimization of stowage plans for RoRo ships
1435 -- 1442Thierry Garaix, Christian Artigues, Dominique Feillet, Didier Josselin. Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
1443 -- 1451Christoforos Charalambous, Krzysztof Fleszar. A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
1452 -- 1463Sara Ceschia, Andrea Schaerf. Local search and lower bounds for the patient admission scheduling problem

Volume 38, Issue 1

1 -- 2Funda Sivrikaya-Serifoglu, Ümit Bilge. Guest editorial
3 -- 13Oumar Koné, Christian Artigues, Pierre Lopez, Marcel Mongeau. Event-based MILP models for resource-constrained project scheduling problems
14 -- 20Lucio Bianco, Massimiliano Caramia. A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
21 -- 32John E. Hebert, Richard F. Deckro. Combining contemporary and traditional project management tools to resolve a project scheduling problem
33 -- 43Agustín Barrios, Francisco Ballestín, Vicente Valls. A double genetic algorithm for the MRCPSP/max
44 -- 50Anurag Agarwal, Selcuk Colak, S. Selçuk Erengüç. A Neurogenetic approach for the resource-constrained project scheduling problem
51 -- 62Francisco Ballestín, Rosa Blanco. Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems
63 -- 74Filip Deblaere, Erik Demeulemeester, Willy Herroelen. Reactive scheduling in the multi-mode RCPSP
75 -- 89Ozan Çakir, George O. Wesolowsky. Planar expropriation problem with non-rigid rectangular facilities
90 -- 97Lenys Bello, Rafael Blanquero, Emilio Carrizosa. On minimax-regret Huff location models
98 -- 104Wen-Chiung Lee, Shiuan-Kang Chen, Cheng-Wei Chen, Chin-Chia Wu. A two-machine flowshop problem with two agents
105 -- 111Hasan Bal, H. Hasan Örkcü. A new mathematical programming approach to multi-group classification problems
112 -- 130B. Madhu Rao. A decision support model for warranty servicing of repairable items
131 -- 139Sebastián Lozano, Ester Gutiérrez. Slacks-based measure of efficiency of airports with airplanes delays as undesirable outputs
140 -- 151José Brandão. A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
152 -- 164Xiangyong Li, Md. Fazle Baki, Yash P. Aneja. Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic
165 -- 173Gilbert Laporte, Marta M. B. Pascoal. Minimum cost path problems with relays
174 -- 189Huy Nguyen Anh Pham, Evangelos Triantaphyllou. A meta-heuristic approach for improving the accuracy in some classification algorithms
190 -- 204R. Lewis, J. Thompson. On the application of graph colouring techniques in round-robin sports scheduling
205 -- 215Stephen C. H. Leung, XiYue Zhou, Defu Zhang, Jiemin Zheng. Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
216 -- 226Andreas T. Ernst, Elena O. Gavriliouk, Leorey Marquez. An efficient Lagrangean heuristic for rental vehicle scheduling
227 -- 233Kun He, Wenqi Huang. An efficient placement heuristic for three-dimensional rectangular packing
234 -- 245Luís Gouveia, Pedro Moura, Amaro de Sousa. Prize collecting Steiner trees with node degree dependent costs
246 -- 255Seyda Topaloglu, Irem Ozkarahan. A constraint programming-based solution approach for medical resident scheduling problems
256 -- 266Parag C. Pendharkar. A hybrid radial basis function and data envelopment analysis neural network for classification
267 -- 276Wei Li, Barrie R. Nault, Deyi Xue, Yiliu Tu. An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production
277 -- 286Ibrahim Akgün. New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll s tightened Miller-Tucker-Zemlin constraints
287 -- 300Abel Garcia-Najera, John A. Bullinaria. An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
301 -- 309Luis Fanjul-Peyro, Rubén Ruiz. Size-reduction heuristics for the unrelated parallel machines scheduling problem
310 -- 319Johann Hurink, A. L. Kok, Jacob Jan Paulus, J. M. J. Schutten. Time-constrained project scheduling with adjacent resources
320 -- 327Herminia I. Calvete, Carmen Galé, María-José Oliveros. Bilevel model for production-distribution planning solved by using ant colony optimization
328 -- 339Christian Blum, Cristóbal Miralles. On solving the assembly line worker assignment and balancing problem via beam search
340 -- 356Eugene Edison, Tal Shima. Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
357 -- 366Federico Liberatore, Maria Paola Scaparra, Mark S. Daskin. Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification
367 -- 378Fabrice Talla Nobibon, Roel Leus. Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
379 -- 386Stefano Benati. Heuristic methods for the optimal statistic median problem
387 -- 393Radhouan Bouabda, Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï. A branch and bound enhanced genetic algorithm for scheduling a flowline manufacturing cell with sequence dependent family setup times
394 -- 408Quan-ke Pan, Ponnuthurai N. Suganthan, Ling Wang, Liang Gao, Rammohan Mallipeddi. A differential evolution algorithm with self-adapting strategy and control parameters