Computers & Operations Research, Volume 36

Volume 36, Number 1, January 2009

• Kweku-Muata Osei-Bryson, Anito Joseph:
  Operations research approaches for disaster recovery planning. 1
  
• Emmett J. Lodree Jr., Selda Taskin:
  Supply chain planning for hurricane response with wind speed information updates. 2-15
  
• Timothy C. Matisziw, Alan T. Murray:
  Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure. 16-26
  
• Chih-Chin Liang, Chia-Hung Wang, Hsing Luh, Ping-Yu Hsu:
  Disaster avoidance mechanism for content-delivering service. 27-39
  
• Antonio Galvão Naclério Novaes, José E. Souza de Cursi, Arinei C. L. da Silva, João C. Souza:
  Solving continuous location-districting problems with Voronoi diagrams. 40-59
  
• Celso S. Sakuraba, Débora P. Ronconi, Francis Sourd:
  Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date. 60-72
  
• Shyong Jian Shyu, Chun-Yuan Tsai:
  Finding the longest common subsequence for multiple biological sequences by ant colony optimization. 73-91
  
• Jorge José de Magalhães Mendes, José Fernando Gonçalves, Mauricio G. C. Resende:
  A random key based genetic algorithm for the resource constrained project scheduling problem. 92-109
  
• L. L. Liu, C. T. Ng, T. C. Edwin Cheng:
  Bicriterion scheduling with equal processing times on a batch processing machine. 110-118
  
• Na Li, Li Zheng, Quan-Lin Li:
  Performance analysis of two-loop closed production systems. 119-134
  
• Tammy Drezner, Zvi Drezner, Carlton H. Scott:
  Location of a facility minimizing nuisance to or from a planar network. 135-148
  
• Shouxi Yang, Alberto Maria Segre, Bruno Codenotti:
  An optimal multiprocessor combinatorial auction solver. 149-166
  
• Sung-Pil Hong, Yong-Hyuk Kim:
  A genetic algorithm for joint replenishment based on the exact inventory cost. 167-175
  
• Nikolaos Papadakos:
  Integrated airline scheduling. 176-195
  
• Ali Haydar Özer, Can Özturan:
  A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction. 196-208
  
• Bin Qian, Ling Wang, Dexian Huang, Wan-liang Wang, Xiong Wang:
  An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. 209-233
  
• Pekka J. Korhonen, Pyry-Antti Siitari:
  A dimensional decomposition approach to identifying efficient units in large-scale DEA models. 234-244
  
• Xiao-Bing Hu, Ezequiel A. Di Paolo:
  An efficient genetic algorithm with uniform crossover for air traffic control. 245-259
  
• Cristina Bazgan, Hadrien Hugot, Daniel Vanderpooten:
  Solving efficiently the 0-1 multi-objective knapsack problem. 260-279
  
• Vicente Valls Verdejo, M. Angeles Pérez Alarcó, M. Pilar Lino Sorlí:
  Scheduling in a continuous galvanizing line. 280-296
  
• Gholam R. Amin:
  Erratum to "A polynomial-time algorithm for finding epsilon in DEA models": [Computers & Operations Research 31 (2004) 803-805]. 297
  

Volume 36, Number 2, February 2009

• Gerd Finke, Vitaly A. Strusevich, Frank Werner:
  Guest Editorial. 299-300
  
• Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris Potts, Jonathan Whitehead:
  Scheduling of coupled tasks and one-machine no-wait robotic cells. 301-307
  
• T. C. Edwin Cheng, A. A. Lazarev, E. R. Gafarov:
  A hybrid algorithm for the single-machine total tardiness problem. 308-315
  
• M. V. Devyaterikova, A. A. Kolokolov, A. P. Kolosov:
  L-class enumeration algorithms for a discrete production planning problem with interval resource quantities. 316-324
  
• Valery Gordon, Alexander Tarasevich:
  A note: Common due date assignment for a single machine scheduling with the rate-modifying activity. 325-328
  
• Hakan Gultekin, Oya Ekin Karasan, M. Selim Akturk:
  Pure cycles in flexible robotic cells. 329-343
  
• Olga Guschinskaya, Alexandre Dolgui, Nikolai Guschinsky, Genrikh Levin:
  Minimizing makespan for multi-spindle head machines with a mobile table. 344-357
  
• Jitti Jungwattanakit, Manop Reodecha, Paveena Chaovalitwongse, Frank Werner:
  A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. 358-378
  
• Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich:
  Approximation results for flow shop scheduling problems with machine availability constraints. 379-390
  
• A. Oulamara, G. Finke, A. Kamgaing Kuiteing:
  Flowshop scheduling problem with a batching machine and task compatibilities. 391-401
  
• Reza Tavakkoli-Moghaddam, Nima Safaei, Farrokh Sassani:
  A memetic algorithm for the flexible flow line scheduling problem with processor blocking. 402-414
  
• Taofeng Ye:
  Queueing network analysis on dynamic lot streaming. 415-424
  
• Wenqi Huang, Kun He:
  A new heuristic algorithm for cuboids packing with no orientation constraints. 425-432
  
• Sebastian Sitarz:
  Ant algorithms and simulated annealing for multicriteria dynamic programming. 433-441
  
• Daniela Ambrosino, Anna Sciomachen, Maria Grazia Scutellà:
  A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem. 442-460
  
• Ling-Huey Su:
  Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system. 461-471
  
• Jaehwan Yang:
  Two machine flow shop scheduling problem with weighted WIP costs. 472-486
  
• Manuel Laguna, Abraham Duarte, Rafael Martí:
  Hybridizing the cross-entropy method: An application to the max-cut problem. 487-498
  
• Daniel De Ladurantaye, Michel Gendreau, Jean-Yves Potvin:
  Optimizing profits from hydroelectricity production. 499-529
  
• M. Caserta, E. Quiñonez Rico:
  A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. 530-548
  
• Sebastián Lozano, Gabriel Villa:
  Multiobjective target setting in data envelopment analysis using AHP. 549-564
  
• Wen-Hua Yang:
  Scheduling jobs on a single machine to maximize the total revenue of jobs. 565-583
  
• Kevin R. Hutson, Douglas R. Shier:
  Extended dominance and a stochastic shortest path problem. 584-596
  
• Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
  The capacity and distance constrained plant location problem. 597-611
  
• Yaodong Cui, Yiping Lu:
  Heuristic algorithm for a cutting stock problem in the steel bridge construction. 612-622
  
• Brandon Y. H. Wong, Mariano Luque, Jian-Bo Yang:
  Using interactive multiobjective methods to solve DEA problems with value judgements. 623-636
  

Volume 36, Number 3, March 2009

• Temel Öncan, I. Kuban Altinel, Gilbert Laporte:
  A comparative analysis of several asymmetric traveling salesman problem formulations. 637-654
  
• Guenther Fuellerer, Karl F. Doerner, Richard F. Hartl, Manuel Iori:
  Ant colony optimization for the two-dimensional loading vehicle routing problem. 655-673
  
• Che Soong Kim, Alexander N. Dudin, Valentina I. Klimenok, Valentina Khramova:
  Erlang loss queueing system with batch arrivals operating in a random environment. 674-697
  
• Eun-Seok Kim, Chang-Sup Sung, Ik-Sun Lee:
  Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints. 698-710
  
• Alberto A. Aguilar-Lasserre, Marco A. Bautista Bautista, Antonin Ponsich, Magno A. González Huerta:
  An AHP-based decision-making tool for the solution of multiproduct batch plant design problem under imprecise demand. 711-736
  
• Avijit Sarkar, Rajan Batta, Rakesh Nagi:
  Finding rectilinear least cost paths in the presence of convex polygonal congested regions. 737-754
  
• Roger Z. Ríos-Mercado, Elena Fernández:
  A reactive GRASP for a commercial territory design problem with multiple balancing requirements. 755-776
  
• M. Aramoon Bajestani, M. Rabbani, A. R. Rahimi-Vahed, G. Baharian Khoshkhou:
  A multi-objective scatter search for a dynamic cell formation problem. 777-794
  
• Giulia M. G. H. Wake, Natashia Boland, Les S. Jennings:
  Mixed integer programming approaches to exact minimization of total treatment time in cancer radiotherapy using multileaf collimators. 795-810
  
• M. Caserta, A. Márquez Uribe:
  Tabu search-based metaheuristic algorithm for software system reliability problems. 811-822
  
• Juliang Zhang, Yong Shi, Peng Zhang:
  Several multi-criteria programming methods for classification. 823-836
  
• Dirk Briskorn, Andreas Drexl:
  IP models for round robin tournaments. 837-852
  
• Yeo Keun Kim, Won Seop Song, Jun Hyuk Kim:
  A mathematical model and a genetic algorithm for two-sided assembly line balancing. 853-865
  
• Y. F. Lee, Z. B. Jiang, H. R. Liu:
  Multiple-objective scheduling and real-time dispatching for the semiconductor manufacturing system. 866-884
  
• Jie Sun, Hui Li:
  Financial distress early warning based on group decision making. 885-906
  
• Xianpeng Wang, Lixin Tang:
  A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers. 907-918
  
• Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud:
  The petrol station replenishment problem with time windows. 919-935
  
• Hüseyin Pehlivan, Vasif V. Nabiyev:
  Score calculation from final tournament tables. 936-950
  
• Alberto García-Villoria, Rafael Pastor:
  Introducing dynamic diversity into a discrete particle swarm optimization. 951-966
  
• Joaquín A. Pacheco, Ada Álvarez, Silvia Casado, José Luis González Velarde:
  A tabu search approach to an urban transport problem in northern Spain. 967-979
  

Volume 36, Number 4, April 2009

• Hishammuddin Asmuni, Edmund K. Burke, Jonathan M. Garibaldi, Barry McCollum, Andrew J. Parkes:
  An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. 981-1001
  
• Michael R. Wagner, Joy Bhadury, Steve Peng:
  Risk management in uncapacitated facility location models with random demands. 1002-1011
  
• Fuh-Hwa Franklin Liu, Hao Hsuan Peng:
  A systematic procedure to obtain a preferable and robust ranking of units. 1012-1025
  
• Jens Egeblad, David Pisinger:
  Heuristic approaches for the two- and three-dimensional knapsack packing problem. 1026-1049
  
• Yi-Kuei Lin:
  Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths. 1050-1063
  
• Natashia Boland, Irina Dumitrescu, Gary Froyland, Ambros M. Gleixner:
  LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity. 1064-1089
  
• Dries R. Goossens, Frits C. R. Spieksma:
  Exact algorithms for the matrix bid auction. 1090-1109
  
• Shih-Wei Lin, Kuo-Ching Ying, Zne-Jung Lee:
  Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times. 1110-1121
  
• Patrik Flisberg, Bertil Lidén, Mikael Rönnqvist:
  A hybrid method based on linear programming and tabu search for routing of logging trucks. 1122-1144
  
• Anders Dohn, Esben Kolind, Jens Clausen:
  The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach. 1145-1157
  
• Feng-Cheng Lin, Jen-Shin Hong, Bertrand M. T. Lin:
  A two-machine flowshop problem with processing time-dependent buffer constraints - An application in multimedia presentations. 1158-1175
  
• Konstantinos Paparrizos, Nikolaos Samaras, Angelo Sifaleras:
  An exterior simplex type algorithm for the Minimum Cost Network Flow Problem. 1176-1190
  
• Giovanni Righini, Matteo Salani:
  Decremental state space relaxation strategies and initialization heuristics for solving the Orienteering Problem with Time Windows with dynamic programming. 1191-1203
  
• José H. Dulá, Francisco J. López:
  Preprocessing DEA. 1204-1220
  
• Hai Wang, Shouhong Wang:
  Towards optimal use of incomplete classification data. 1221-1230
  
• Ann Melissa Campbell, Barrett W. Thomas:
  Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. 1231-1248
  
• G. I. Zobolas, Christos D. Tarantilis, George Ioannou:
  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. 1249-1267
  
• Rubén Ruiz, Ali Allahverdi:
  Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. 1268-1283
  
• Shervin AhmadBeygi, Amy Cohn, Marshall Weir:
  An integer programming approach to generating airline crew pairings. 1284-1298
  
• Andrea Raith, Matthias Ehrgott:
  A comparison of solution strategies for biobjective shortest path problems. 1299-1331
  

Volume 36, Number 5, May 2009

• Juan A. Mesa, Blas Pelegrín, Justo Puerto:
  Selected papers presented at the tenth International Symposium on Locational Decisions (ISOLDE X). 1333-1334
  
• Bernard Gendron, Frédéric Semet:
  Formulations and relaxations for a multi-echelon capacitated location-distribution problem. 1335-1355
  
• Maria Albareda-Sambola, Elena Fernández, Yolanda Hinojosa, Justo Puerto:
  The multi-period incremental service facility location problem. 1356-1375
  
• Martin Bischoff, Tina Fleischmann, Kathrin Klamroth:
  The multi-facility location-allocation problem with polyhedral barriers. 1376-1392
  
• Boglárka Tóth, José Fernández, Blas Pelegrín, Frank Plastria:
  Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models. 1393-1405
  
• Vladimir Marianov, Michelle Mizumori, Charles S. Revelle:
  The heuristic concentration-integer and its application to a class of location problems. 1406-1422
  
• Alessandro Agnetis, Enrico Grande, Pitu B. Mirchandani, Andrea Pacifici:
  Covering a line segment with variable radius discs. 1423-1436
  
• José Santiváñez, Emanuel Melachrinoudis, Mary E. Helander:
  Network location of a reliable center using the most reliable route policy. 1437-1460
  
• Ángel Marín, Ricardo García-Ródenas:
  Location of infrastructure in urban railway networks. 1461-1477
  
• Arshia Ahi, Mir-Bahador Aryanezhad, Behzad Ashtiani, Ahmad Makui:
  A novel approach to determine cell formation, intracellular machine layout and cell layout in the CMS problem based on TOPSIS method. 1478-1496
  
• Jeffery K. Cochran, Kevin T. Roche:
  A multi-class queuing network analysis methodology for improving hospital emergency department performance. 1497-1512
  
• Hakim Akeb, Mhand Hifi, Rym M'Hallah:
  A beam search algorithm for the circular packing problem. 1513-1528
  
• Lele Zhang, Andrew Wirth:
  On-line scheduling of two parallel machines with a single server. 1529-1553
  
• Yao Chen, Greg N. Gregoriou, Fabrice Douglas Rouah:
  Efficiency persistence of bank and thrift CEOs using data envelopment analysis. 1554-1561
  
• Amir Azaron, Cahit Perkgoz, Hideki Katagiri, Kosuke Kato, Masatoshi Sakawa:
  Multi-objective reliability optimization for dissimilar-unit cold-standby systems using a genetic algorithm. 1562-1571
  
• Andrea Abrardo, Alessandro Alessio, Paolo Detti, Marco Moretti:
  Radio resource allocation problems for OFDMA cellular systems. 1572-1581
  
• Changzheng Liu, Yueyue Fan, Fernando Ordóñez:
  A two-stage stochastic programming model for transportation network protection. 1582-1590
  
• A. S. Camanho, M. C. Portela, C. B. Vaz:
  Efficiency analysis accounting for internal and external non-discretionary factors. 1591-1601
  
• Krzysztof Fleszar, Khalil S. Hindi:
  Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem. 1602-1607
  
• Lijun Wei, Defu Zhang, Qingshan Chen:
  A least wasted first heuristic algorithm for the rectangular packing problem. 1608-1614
  
• Ali Amiri:
  An efficient link allocation algorithm for survivable ATM-based personal communication networks. 1615-1621
  
• Sanjay Sharma, Narayan Agrawal:
  Selection of a pull production control policy under different demand situations for a manufacturing system by AHP-algorithm. 1622-1632
  
• Jun-Yeon Lee:
  An incentive contract for leadtime reduction in an (S-1, S) inventory system. 1633-1638
  
• Hipólito Hernández-Pérez, Inmaculada Rodríguez Martín, Juan José Salazar González:
  A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. 1639-1645
  
• Doron Chen, Reuven Chen:
  New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems. 1646-1655
  
• S. G. Li, Y. L. Rong:
  The reliable design of one-piece flow production system using fuzzy ant colony optimization. 1656-1663
  
• Xingye Dong, Houkuan Huang, Ping Chen:
  An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion. 1664-1669
  
• Teresa Gomes, José M. F. Craveirinha, Luísa Jorge:
  An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs. 1670-1682
  
• Shih-Wei Lin, Vincent F. Yu, Shuo-Yan Chou:
  Solving the truck and trailer routing problem based on a simulated annealing heuristic. 1683-1692
  
• The Jin Ai, Voratas Kachitvichyanukul:
  A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. 1693-1702
  
• Ek Peng Chew, Loo Hay Lee, Suyan Teng, Choon Hwee Koh:
  Differentiated service inventory optimization using nested partitions and MOCBA. 1703-1710
  
• Matthew E. H. Petering, Katta G. Murty:
  Effect of block length and yard crane deployment systems on overall performance at a seaport container transshipment terminal. 1711-1725
  
• Javier Castro, Daniel Gómez, Juan Tejada:
  Polynomial calculation of the Shapley value based on sampling. 1726-1730
  

Volume 36, Number 6, June 2009

• Tom Van Woensel, Frederico R. B. Cruz:
  A stochastic approach to traffic congestion costs. 1731-1739
  
• Jörn Schönberger, Herbert Kopfer:
  Online decision making and automatic decision model adaptation. 1740-1750
  
• Ravindra Patankar, Roger Xu, Hongda Chen, David Patterson:
  Global search algorithm for automated maintenance planning and scheduling of parts requests. 1751-1757
  
• Walter O. Rom, Susan A. Slotnick:
  Order acceptance using genetic algorithms. 1758-1767
  
• Kwai-Sang Chin, Ying-Ming Wang, Gary Ka Kwai Poon, Jian-Bo Yang:
  Failure mode and effects analysis using a group-based evidential reasoning approach. 1768-1779
  
• S. Hamid Mirmohammadi, Shahram Shadrokh, Fereydoon Kianfar:
  An efficient optimal algorithm for the quantity discount problem in material requirement planning. 1780-1788
  
• Hamid Reza Sayarshad, Keivan Ghoseiri:
  A simulated annealing approach for the multi-periodic rail-car fleet sizing problem. 1789-1799
  
• Günes Erdogan, Jean-François Cordeau, Gilbert Laporte:
  The pickup and delivery traveling salesman problem with first-in-first-out loading. 1800-1808
  
• Dehua Xu, Zhenmin Cheng, Yunqiang Yin, Hongxing Li:
  Makespan minimization for two parallel machines scheduling with a periodic availability constraint. 1809-1812
  
• Wen-Chih Chen, Wei-Jen Cho:
  A procedure for large-scale DEA computations. 1813-1824
  
• Belmiro P. M. Duarte, Lino O. Santos, Jorge S. Mariano:
  Optimal sizing, scheduling and shift policy of the grinding section of a ceramic tile plant. 1825-1834
  
• Chien-Ta Bruce Ho, Desheng Dash Wu:
  Online banking performance evaluation using data envelopment analysis and principal component analysis. 1835-1842
  
• Hubert Setzler, Cem Saydam, Sungjune Park:
  EMS call volume predictions: A comparative study. 1843-1851
  
• Chao-Tang Tseng, Ching-Jong Liao, Kuo-Ling Huang:
  Minimizing total tardiness on a single machine with controllable processing times. 1852-1858
  
• Francesco Carrabs, Raffaele Cerulli, Monica Gentili:
  The labeled maximum matching problem. 1859-1871
  
• E. Jack Chen, Loo Hay Lee:
  A multi-objective selection procedure of determining a Pareto set. 1872-1879
  
• Lotte Berghman, Dries R. Goossens, Roel Leus:
  Efficient solutions for Mastermind using genetic algorithms. 1880-1885
  
• Gur Mosheiov, Assaf Sarig:
  Minmax scheduling problems with a common due-window. 1886-1892
  
• Xujin Chen, Jie Hu, Xiaodong Hu:
  A new model for path planning with interval data. 1893-1899
  
• Mehmet Fatih Tasgetiren, Quan-Qe Pan, Yun-Chia Liang:
  A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times. 1900-1915
  
• A. Chebouba, Farouk Yalaoui, A. Smati, Lionel Amodeo, K. Younsi, A. Tairi:
  Optimization of natural gas pipeline transportation using ant colony optimization. 1916-1923
  
• Sukgon Kim, Reha Uzsoy:
  Heuristics for capacity planning problems with congestion. 1924-1934
  
• Qingcheng Zeng, Zhongzhen Yang:
  Integrating simulation and optimization to schedule loading operations in container terminals. 1935-1944
  
• Andrea Raith, Matthias Ehrgott:
  A two-phase algorithm for the biobjective integer minimum cost flow problem. 1945-1954
  
• Ugur Özcan, Bilal Toklu:
  Multiple-criteria decision-making in two-sided assembly line balancing: A goal programming and a fuzzy goal programming models. 1955-1965
  
• Inmaculada Espejo, Alfredo Marín, Justo Puerto, Antonio M. Rodríguez-Chía:
  A comparison of formulations and solution methods for the minimum-envy location problem. 1966-1981
  
• A. Bellanger, A. Oulamara:
  Scheduling hybrid flowshop with parallel batching machines and compatibilities. 1982-1992
  
• A. Pavitsos, E. G. Kyriakidis:
  Markov decision models for the optimal maintenance of a production unit with an upstream buffer. 1993-2006
  
• Martino Luis, Saïd Salhi, Gabor Nagy:
  Region-rejection based heuristics for the capacitated multi-source Weber problem. 2007-2017
  
• Yumei Huo, Haibing Li, Hairong Zhao:
  Minimizing total completion time in two-machine flow shops with exact delays. 2018-2030
  
• Hatice Tekiner, S. Ilker Birbil, Kerem Bülbül:
  Robust crew pairing for managing extra flights. 2031-2048
  
• Shangyao Yan, Yu-Lin Shih:
  Optimal scheduling of emergency roadway repair and subsequent relief distribution. 2049-2065
  
• Feng Chen, Kailei Song:
  Minimizing makespan in two-stage hybrid cross docking scheduling problem. 2066-2073
  
• Kelly Cristina Poldi, Marcos Nereu Arenales:
  Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. 2074-2081
  
• Xinyu Shao, Xinyu Li, Liang Gao, Chaoyong Zhang:
  Integration of process planning and scheduling - A modified genetic algorithm-based approach. 2082-2096
  
• Sung-Pil Hong, Sung-Jin Cho, Myoung-Ju Park, Moon-Gul Lee:
  Optimal search-relocation trade-off in Markovian-target searching. 2097-2104
  
• Xianpeng Wang, Lixin Tang:
  A population-based variable neighborhood search for the single machine total weighted tardiness problem. 2105-2110
  
• Wen-Chiung Lee, Chin-Chia Wu, Yu-Hsiang Chung, Han-Chu Liu:
  Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates. 2111-2121
  
• Arife Burcu Colak Altunc, Ahmet Burak Keha:
  Interval-indexed formulation based heuristics for single machine total weighted tardiness problem. 2122-2131
  

Volume 36, Number 7, July 2009

• Feng Jin, Shiji Song, Cheng Wu:
  A simulated annealing algorithm for single machine scheduling problems with family setups. 2133-2138
  
• Engin Durmaz, Necati Aras, I. Kuban Altinel:
  Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations. 2139-2148
  
• Jozef Kratica, Mirjana Cangalovic, Vera Kovacevic-Vujcic:
  Computing minimal doubly resolving sets of graphs. 2149-2159
  
• Ahmed Hadjar, François Soumis:
  Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows. 2160-2172
  
• Rafael Pastor, Jordi Altimiras, Manuel Mateo:
  Planning production using mathematical programming: The case of a woodturning company. 2173-2178
  
• Cécile Simonin, Jean-Pierre Le Cadre, Frédéric Dambreville:
  A hierarchical approach for planning a multisensor multizone search for a moving target. 2179-2192
  
• Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos:
  Detecting critical nodes in sparse graphs. 2193-2200
  
• Xiangpei Hu, Zheng Wang, Minfang Huang, Amy Z. Zeng:
  A computer-enabled solution procedure for food wholesalers' distribution decision in cities with a circular transportation infrastructure. 2201-2209
  
• Sancho Salcedo-Sanz, Emilio G. Ortíz-García, Ángel M. Pérez-Bellido, Antonio Portilla-Figueras, Francisco López-Ferreras:
  On the performance of the LP-guided Hopfield network-genetic algorithm. 2210-2216
  
• Martin Schlüter, Jose A. Egea, Julio R. Banga:
  Extended ant colony optimization for non-convex mixed integer nonlinear programming. 2217-2229
  
• Andreas T. Ernst, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy, Gerhard J. Woeginger:
  Uncapacitated single and multiple allocation p-hub center problems. 2230-2241
  
• Nina Runge, Francis Sourd:
  A new model for the preemptive earliness-tardiness scheduling problem. 2242-2249
  
• Inmaculada Espejo, Antonio M. Rodríguez-Chía, C. Valero:
  Convex ordered median problem with l_p-norms. 2250-2262
  
• Renata Mansini, Barbara Tocchella:
  The traveling purchaser problem with budget constraint. 2263-2274
  
• Saadettin Erhan Kesen, M. Duran Toksari, Zülal Güngör, Ertan Güner:
  Analyzing the behaviors of virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization (ACO)-based metamodels. 2275-2285
  
• Brian Q. Rieksts, Jose A. Ventura, Yale T. Herer:
  Power-of-two policies for single-warehouse multi-retailer inventory systems with order frequency discounts. 2286-2294
  
• Rhyd Lewis:
  A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing. 2295-2310
  
• Huey-Kuo Chen, Che-Fu Hsueh, Mei-Shiang Chang:
  Production scheduling and vehicle routing with time windows for perishable food products. 2311-2319
  
• Adam N. Letchford, Amar Oukil:
  Exploiting sparsity in pricing routines for the capacitated arc routing problem. 2320-2327