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 Paul 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
- 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
- Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris N. Potts, Jonathan Whitehead: Scheduling of coupled tasks and one-machine no-wait robotic cells. 301-307
- T. C. Edwin Cheng, Alexander A. Lazarev, Evgeny 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 S. Gordon, Alexander Tarasevich: A note: Common due date assignment for a single machine scheduling with the rate-modifying activity. 325-328
- 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
- Ammar 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 Yu Han 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, Masoud 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
- 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
- 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
- Alberto García-Villoria, Rafael Pastor: Introducing dynamic diversity into a discrete particle swarm optimization. 951-966
- Joaquín A. Pacheco, Ada M. Alvarez, 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
- 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
- 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, Maria Conceição A. Silva 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
- 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
- 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
- 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
- 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
- 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, Ammar 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, Gábor 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 lp-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
Volume 36, Number 8, August 2009
- Christian Artigues, Michel Gendreau, Louis-Martin Rousseau, Adrien Vergnaud: Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound. 2330-2340
- Meinolf Sellmann: Approximated consistency for the automatic recording constraint. 2341-2347
- Christine Wei Wu, Kenneth N. Brown, J. Christopher Beck: Scheduling with uncertain durations: Modeling beta-robust scheduling with constraints. 2348-2356
- Laurent D. Michel, Andrew See, Pascal Van Hentenryck: Parallel and distributed local search in COMET. 2357-2375
- Mourad Boudhar, Amina Haned: Preemptive scheduling in the presence of transportation times. 2387-2393
- M. Duran Toksari, Ertan Güner: Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration. 2394-2417
- M. Pilar Cristobal, Laureano F. Escudero, Juan F. Monge: On stochastic dynamic programming for solving large-scale planning problems under uncertainty. 2418-2428
- Federico Della Croce, Andrea Grosso, Marco Locatelli: A heuristic approach for the max-min diversity problem based on max-clique. 2429-2433
- Suvrajeet Sen, Zhihong Zhou, Kai Huang: Enhancements of two-stage stochastic decomposition. 2434-2439
- Antonio Mauttone, María E. Urquhart: A route set construction algorithm for the transit network design problem. 2440-2449
- Arezoo Atighehchian, Mehdi Bijari, Hamed Tarkesh: A novel hybrid algorithm for scheduling steel-making continuous casting production. 2450-2461
- Hojung Shin, W. C. Benton, Minjoon Jun: Quantifying suppliers' product quality and delivery performance: A sourcing policy decision model. 2462-2471
- Adebayo Alabi, Jordi Castro: Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning. 2472-2483
- Mohsen S. Sajadieh, Mohammad R. Akbari Jokar, Mohammad Modarres: Developing a coordinated vendor-buyer model in two-stage supply chains with stochastic lead-times. 2484-2489
- Huei Chuen Huang, Loo Hay Lee, Haiqing Song, Brian Thomas Eck: SimMan - A simulation model for workforce capacity planning. 2490-2497
- Quan-Ke Pan, Ling Wang, Bin Qian: A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. 2498-2511
Volume 36, Number 9, September 2009
- Ling-Chieh Kung, Ching-Chin Chern: Heuristic factory planning algorithm for advanced planning and scheduling. 2513-2530
- Selin Özpeynirci, Meral Azizoglu: Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems. 2531-2540
- Gur Mosheiov, Assaf Sarig: Scheduling a maintenance activity and due-window assignment on a single machine. 2541-2545
- Florian Sahling, Lisbeth Buschkühl, Horst Tempelmeier, Stefan Helber: Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. 2546-2553
- Augusto Eusébio, José Rui Figueira: Finding non-dominated solutions in bi-objective integer network flow problems. 2554-2564
- Murat Köksalan, Selin Bilgin Özpeynirci: An interactive sorting method for additive utility functions. 2565-2572
- Yongqiang Chen, Hongwei Jiao: A nonisolated optimal solution of general linear multiplicative programming problems. 2573-2579
- Konstantin Chakhlevitch, Celia A. Glass: Scheduling reentrant jobs on parallel machines with a remote server. 2580-2589
- Laureano F. Escudero, María Araceli Garín, María Merino, Gloria Pérez: A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems. 2590-2600
- Marie E. Matta: A genetic algorithm for the proportionate multiprocessor open shop. 2601-2618
- Luís Paquete, Thomas Stützle: Design and analysis of stochastic local search for the multiobjective traveling salesman problem. 2619-2631
- Luís Santos, João Manuel Coutinho-Rodrigues, John R. Current: An improved heuristic for the capacitated arc routing problem. 2632-2637
- Bassem Jarboui, Mansour Eddaly, Patrick Siarry: An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. 2638-2646
- Peihai Liu, Xiwen Lu: On-line scheduling of parallel machines to minimize total completion times. 2647-2652
- N. Damak, Bassem Jarboui, Patrick Siarry, Taïcir Loukil: Differential evolution for solving multi-mode resource-constrained project scheduling problems. 2653-2659
- Brecht Cardoen, Erik Demeulemeester, Jeroen Beliën: Sequencing surgical cases in a day-care environment: An exact branch-and-price approach. 2660-2669
- Luigi Moccia, Jean-François Cordeau, Maria Flavia Monaco, Marcello Sammarra: A column generation heuristic for a dynamic generalized assignment problem. 2670-2681
- Fawaz S. Al-Anzi, Ali Allahverdi: Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan. 2682-2689
- Céline Gicquel, N. Miègeville, Michel Minoux, Yves Dallery: Discrete lot sizing and scheduling using product decomposition into attributes. 2690-2698
Volume 36, Number 10, October 2009
- José Manuel Cordero, Francisco Pedraja, Daniel Santín: Alternative approaches to include exogenous variables in DEA measures: A comparison using Monte Carlo. 2699-2706
- Jorge M. S. Valente, José Fernando Gonçalves: A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. 2707-2715
- Maria Elena Bruni, Francesca Guerriero, Erika Pinto: Evaluating project completion time in project networks with discrete random activity durations. 2716-2722
- Wenxing Zhu, M. M. Ali: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming. 2723-2728
- Francisco de Assis Corrêa, Luiz Antonio Nogueira Lorena, Glaydston Mattos Ribeiro: A decomposition approach for the probabilistic maximal covering location-allocation problem. 2729-2739
- Ali Allahverdi, Fawaz S. Al-Anzi: The two-stage assembly scheduling problem to minimize total completion time with setup times. 2740-2747
- Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang: Bounded single-machine parallel-batch scheduling with release dates and rejection. 2748-2751
- Jaime Catalán, Rafael Epstein, Mario Guajardo, Daniel Yung, Cristian Martinez: Solving multiple scenarios in a combinatorial auction. 2752-2758
- Gur Mosheiov, Assaf Sarig: A note: Simple heuristics for scheduling a maintenance activity on unrelated machines. 2759-2762
- An Caris, Gerrit K. Janssens: A local search heuristic for the pre- and end-haulage of intermodal container terminals. 2763-2772
- Stefan Creemers, Marc Lambrecht: An advanced queueing model to analyze appointment-driven service systems. 2773-2785
- Ningxiong Xu, Linda K. Nozick: Modeling supplier selection and the use of option contracts for global supply chain design. 2786-2800
- Svetlana A. Kravchenko, Frank Werner: Preemptive scheduling on uniform machines to minimize mean flow time. 2816-2821
- Fayez F. Boctor, Jacques Renaud, Angel Ruiz, Simon Tremblay: Optimal and heuristic solution methods for a multiprocessor machine scheduling problem. 2822-2828
- Nikolaos Mastrogiannis, Basilis Boutsinas, Ioannis Giannikos: A method for improving the accuracy of data mining classification algorithms. 2829-2839
- Shi Qiang Liu, Erhan Kozan: Scheduling trains as a blocking parallel-machine job shop scheduling problem. 2840-2852
- Paz Perez-Gonzalez, Jose M. Framiñan: Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics. 2866-2876
Volume 36, Number 11, November 2009
- Jack Brimberg, Nenad Mladenovic, Dragan Urosevic, Eric Ngai: Variable neighborhood search for the heaviest k-subgraph. 2885-2891
- João C. N. Clímaco, Marta M. B. Pascoal: Finding non-dominated bicriteria shortest pairs of disjoint simple paths. 2892-2898
- Rafael Martí, José Luis González Velarde, Abraham Duarte: Heuristics for the bi-objective path dissimilarity problem. 2905-2912
- Francisco Ballestín, Vicente Valls, Sacramento Quintanilla: Scheduling projects with limited number of preemptions. 2913-2925
- Nabil Absi, Safia Kedad-Sidhoum: The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs. 2926-2936
- Sigrid Knust, Daniel Lücking: Minimizing costs in round robin tournaments with place constraints. 2937-2943
- Cláudio Alves, Rita Macedo, José M. Valério de Carvalho: New lower bounds based on column generation and constraint programming for the pattern minimization problem. 2944-2954
- Rodrigo Moretti Branchini, Vinícius Amaral Armentano, Arne Løkketangen: Adaptive granular local search heuristic for a dynamic vehicle routing problem. 2955-2968
- Pedro Martins, Maurício C. de Souza: VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. 2969-2982
- Ángel Felipe, M. Teresa Ortuño, Gregorio Tirado: The double traveling salesman problem with multiple stacks: A variable neighborhood search approach. 2983-2993
- Amir Abbas Najafi, Seyed Taghi Akhavan Niaki, Moslem Shahsavar: A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations. 2994-3001
- Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Roberto Montanari: The single-finger keyboard layout problem. 3002-3012
- Rob A. C. M. Broekmeulen, Karel H. van Donselaar: A heuristic to manage perishable inventory with batch ordering, positive lead-times, and time-varying demand. 3013-3018
- Jinfeng Li, Feng Chu, Christian Prins: Lower and upper bounds for a capacitated plant location problem with multicommodity flow. 3019-3030
- T. C. Edwin Cheng, Bertrand M. T. Lin, Y. Tian: Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times. 3031-3040
- Maria Battarra, Michele Monaci, Daniele Vigo: An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. 3041-3050
- Lars Magnus Hvattum, Kjetil Fagerholt, Vinícius Amaral Armentano: Tank allocation problems in maritime bulk shipping. 3051-3060
- Stephen Mahar, P. Daniel Wright: The value of postponing online fulfillment decisions in multi-channel retail/e-tail organizations. 3061-3072
- Chun-Lung Chen, Chuen-Lung Chen: A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines. 3073-3081
- M. Eugénia V. Captivo, João C. N. Clímaco, Marta M. B. Pascoal: A mixed integer linear formulation for the minimum label spanning tree problem. 3082-3085
Volume 36, Number 12, December 2009
- Hatice Calik, Sibel A. Alumur, Bahar Yetis Kara, Oya Ekin Karasan: A tabu-search based heuristic for the hub covering problem over incomplete hub networks. 3088-3096
- Ricardo Saraiva de Camargo, Gilberto de Miranda Jr., Ricardo Poley Martins Ferreira, Henrique Pacca Loureiro Luna: Multiple allocation hub-and-spoke network design under hub congestion. 3097-3106
- James F. Campbell: Hub location for time definite transportation. 3107-3116
- Iván A. Contreras, Elena Fernández, Alfredo Marín: Tight bounds from a path based formulation for the tree of hub location problem. 3117-3127
- Horst A. Eiselt, Vladimir Marianov: A conditional p-hub location problem with attraction functions. 3128-3135
- Elena O. Gavriliouk: Aggregation in hub location problems. 3136-3142
- T. Meyer, Andreas T. Ernst, Mohan Krishnamoorthy: A 2-phase algorithm for solving the single allocation p-hub center problem. 3143-3151
- Marcos Roberto Silva, Claudio B. Cunha: New simple and efficient heuristics for the uncapacitated single allocation hub location problem. 3152-3165
- Thaddeus Sim, Timothy J. Lowe, Barrett W. Thomas: The stochastic p-hub center problem with service-level constraints. 3166-3177
- Christian Blum, Maria J. Blesa, Manuel López-Ibáñez: Beam search for the longest common subsequence problem. 3178-3186
- Panagiotis Xidonas, George Mavrotas, John E. Psarras: A multicriteria methodology for equity selection using financial analysis. 3187-3203
- Francisco Aparisi, Marco A. de Luna: Synthetic-X control charts optimized for in-control and out-of-control regions. 3204-3214
- Yuvraj Gajpal, Prakash L. Abad: An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. 3215-3223
- Reza Tavakkoli-Moghaddam, F. Taheri, M. Bazzazi, M. Izadi, Farrokh Sassani: Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. 3224-3230
- M. Zouba, P. Baptiste, D. Rebaine: Scheduling identical parallel machines and operators within a period based changing mode. 3231-3239
- Tammy Drezner, Zvi Drezner, Jeffery Guyse: Equitable service by a facility: Minimizing the Gini coefficient. 3240-3246
- Brahim Aghezzaf, Mohamed Naimi: The two-stage recombination operator and its application to the multiobjective 0/1 knapsack problem: A comparative study. 3247-3262
- Qiu Hong Zhao, Dragan Urosevic, Nenad Mladenovic, Pierre Hansen: A restarted and modified simplex search for unconstrained optimization. 3263-3271
- Mohsen S. Sajadieh, Kourosh Eshghi: Sole versus dual sourcing under order dependent lead times and prices. 3272-3280
- Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden: Iterated local search for the team orienteering problem with time windows. 3281-3290
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T214307 by the dblp team