Journal: Computers & OR

Volume 36, Issue 9

2513 -- 2530Ling-Chieh Kung, Ching-Chin Chern. Heuristic factory planning algorithm for advanced planning and scheduling
2531 -- 2540Selin Özpeynirci, Meral Azizoglu. Bounding approaches for operation assignment and capacity allocation problem in flexible manufacturing systems
2541 -- 2545Gur Mosheiov, Assaf Sarig. Scheduling a maintenance activity and due-window assignment on a single machine
2546 -- 2553Florian 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
2554 -- 2564Augusto Eusébio, José Rui Figueira. Finding non-dominated solutions in bi-objective integer network flow problems
2565 -- 2572Murat Köksalan, Selin Bilgin Özpeynirci. An interactive sorting method for additive utility functions
2573 -- 2579Yongqiang Chen, Hongwei Jiao. A nonisolated optimal solution of general linear multiplicative programming problems
2580 -- 2589Konstantin Chakhlevitch, Celias A. Glass. Scheduling reentrant jobs on parallel machines with a remote server
2590 -- 2600Laureano F. Escudero, María Araceli Garín, M. Merino, Gloria Pérez. A general algorithm for solving two-stage stochastic mixed 0-1 first-stage problems
2601 -- 2618Marie E. Matta. A genetic algorithm for the proportionate multiprocessor open shop
2619 -- 2631Luís Paquete, Thomas Stützle. Design and analysis of stochastic local search for the multiobjective traveling salesman problem
2632 -- 2637Luís Santos, João Manuel Coutinho-Rodrigues, John R. Current. An improved heuristic for the capacitated arc routing problem
2638 -- 2646Bassem Jarboui, Mansour Eddaly, Patrick Siarry. An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems
2647 -- 2652Peihai Liu, Xiwen Lu. On-line scheduling of parallel machines to minimize total completion times
2653 -- 2659N. Damak, Bassem Jarboui, Patrick Siarry, Taïcir Loukil. Differential evolution for solving multi-mode resource-constrained project scheduling problems
2660 -- 2669Brecht Cardoen, Erik Demeulemeester, Jeroen Beliën. Sequencing surgical cases in a day-care environment: An exact branch-and-price approach
2670 -- 2681Luigi Moccia, Jean-François Cordeau, Maria Flavia Monaco, Marcello Sammarra. A column generation heuristic for a dynamic generalized assignment problem
2682 -- 2689Fawaz S. Al-Anzi, Ali Allahverdi. Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan
2690 -- 2698Céline Gicquel, N. Miègeville, Michel Minoux, Yves Dallery. Discrete lot sizing and scheduling using product decomposition into attributes

Volume 36, Issue 8

2329 -- 0Gilles Pesant, Meinolf Sellmann, Bernard Gendron. Special issue on constraint programming
2330 -- 2340Christian Artigues, Michel Gendreau, Louis-Martin Rousseau, Adrien Vergnaud. Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
2341 -- 2347Meinolf Sellmann. Approximated consistency for the automatic recording constraint
2348 -- 2356Christine Wei Wu, Kenneth N. Brown, J. Christopher Beck. Scheduling with uncertain durations: Modeling beta-robust scheduling with constraints
2357 -- 2375Laurent D. Michel, Andrew See, Pascal Van Hentenryck. Parallel and distributed local search in COMET
2376 -- 2386Alda Carvalho, Nuno Crato, Carla P. Gomes. A generative power-law search tree model
2387 -- 2393Mourad Boudhar, Amina Haned. Preemptive scheduling in the presence of transportation times
2394 -- 2417M. Duran Toksari, Ertan Güner. Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
2418 -- 2428M. Pilar Cristobal, Laureano F. Escudero, Juan F. Monge. On stochastic dynamic programming for solving large-scale planning problems under uncertainty
2429 -- 2433Federico Della Croce, Andrea Grosso, Marco Locatelli. A heuristic approach for the max-min diversity problem based on max-clique
2434 -- 2439Suvrajeet Sen, Zhihong Zhou, Kai Huang. Enhancements of two-stage stochastic decomposition
2440 -- 2449Antonio Mauttone, María E. Urquhart. A route set construction algorithm for the transit network design problem
2450 -- 2461Arezoo Atighehchian, Mehdi Bijari, Hamed Tarkesh. A novel hybrid algorithm for scheduling steel-making continuous casting production
2462 -- 2471Hojung Shin, W. C. Benton, Minjoon Jun. Quantifying suppliers product quality and delivery performance: A sourcing policy decision model
2472 -- 2483Adebayo Alabi, Jordi Castro. Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning
2484 -- 2489Mohsen S. Sajadieh, Mohammad R. Akbari Jokar, Mohammad Modarres. Developing a coordinated vendor-buyer model in two-stage supply chains with stochastic lead-times
2490 -- 2497Huei-Chuen Huang, Loo Hay Lee, Haiqing Song, Brian Thomas Eck. SimMan - A simulation model for workforce capacity planning
2498 -- 2511Quan-ke Pan, Ling Wang, Bin Qian. A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems

Volume 36, Issue 7

2133 -- 2138Feng Jin, Shiji Song, Cheng Wu. A simulated annealing algorithm for single machine scheduling problems with family setups
2139 -- 2148Engin Durmaz, Necati Aras, I. Kuban Altinel. Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
2149 -- 2159Jozef Kratica, Mirjana Cangalovic, Vera Kovacevic-Vujcic. Computing minimal doubly resolving sets of graphs
2160 -- 2172Ahmed Hadjar, François Soumis. Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows
2173 -- 2178Rafael Pastor, Jordi Altimiras, Manuel Mateo. Planning production using mathematical programming: The case of a woodturning company
2179 -- 2192Cécile Simonin, Jean-Pierre Le Cadre, Frédéric Dambreville. A hierarchical approach for planning a multisensor multizone search for a moving target
2193 -- 2200Ashwin Arulselvan, Clayton W. Commander, Lily Elefteriadou, Panos M. Pardalos. Detecting critical nodes in sparse graphs
2201 -- 2209Xiangpei 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
2210 -- 2216Sancho 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
2217 -- 2229Martin Schlüter, Jose A. Egea, Julio R. Banga. Extended ant colony optimization for non-convex mixed integer nonlinear programming
2230 -- 2241Andreas T. Ernst, Horst W. Hamacher, Houyuan Jiang, Mohan Krishnamoorthy, Gerhard J. Woeginger. Uncapacitated single and multiple allocation p-hub center problems
2242 -- 2249Nina Runge, Francis Sourd. A new model for the preemptive earliness-tardiness scheduling problem
2250 -- 2262Inmaculada Espejo, Antonio M. Rodríguez-Chía, C. Valero. Convex ordered median problem with ::::l::::::p::-norms
2263 -- 2274Renata Mansini, Barbara Tocchella. The traveling purchaser problem with budget constraint
2275 -- 2285Saadettin 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
2286 -- 2294Brian Q. Rieksts, Jose A. Ventura, Yale T. Herer. Power-of-two policies for single-warehouse multi-retailer inventory systems with order frequency discounts
2295 -- 2310Rhyd Lewis. A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
2311 -- 2319Huey-Kuo Chen, Che-Fu Hsueh, Mei-Shiang Chang. Production scheduling and vehicle routing with time windows for perishable food products
2320 -- 2327Adam N. Letchford, Amar Oukil. Exploiting sparsity in pricing routines for the capacitated arc routing problem

Volume 36, Issue 6

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

Volume 36, Issue 5

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

Volume 36, Issue 4

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

Volume 36, Issue 3

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

Volume 36, Issue 2

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

Volume 36, Issue 12

3087 -- 0Horst W. Hamacher, T. Meyer. New developments on hub location
3088 -- 3096Hatice Calik, Sibel A. Alumur, Bahar Yetis Kara, Oya Ekin Karasan. A tabu-search based heuristic for the hub covering problem over incomplete hub networks
3097 -- 3106Ricardo 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
3107 -- 3116James F. Campbell. Hub location for time definite transportation
3117 -- 3127Iván A. Contreras, Elena Fernández, Alfredo Marín. Tight bounds from a path based formulation for the tree of hub location problem
3128 -- 3135Horst A. Eiselt, Vladimir Marianov. A conditional p-hub location problem with attraction functions
3136 -- 3142Elena O. Gavriliouk. Aggregation in hub location problems
3143 -- 3151T. Meyer, Andreas T. Ernst, Mohan Krishnamoorthy. A 2-phase algorithm for solving the single allocation p-hub center problem
3152 -- 3165Marcos Roberto Silva, Claudio B. Cunha. New simple and efficient heuristics for the uncapacitated single allocation hub location problem
3166 -- 3177Thaddeus Sim, Timothy J. Lowe, Barrett W. Thomas. The stochastic p-hub center problem with service-level constraints
3178 -- 3186Christian Blum, Maria J. Blesa, Manuel López-Ibáñez. Beam search for the longest common subsequence problem
3187 -- 3203Panagiotis Xidonas, George Mavrotas, John E. Psarras. A multicriteria methodology for equity selection using financial analysis
3204 -- 3214Francisco Aparisi, Marco A. de Luna. Synthetic-X control charts optimized for in-control and out-of-control regions
3215 -- 3223Yuvraj Gajpal, Prakash L. Abad. An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
3224 -- 3230Reza 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
3231 -- 3239M. Zouba, P. Baptiste, D. Rebaine. Scheduling identical parallel machines and operators within a period based changing mode
3240 -- 3246Tammy Drezner, Zvi Drezner, Jeffery Guyse. Equitable service by a facility: Minimizing the Gini coefficient
3247 -- 3262Brahim Aghezzaf, Mohamed Naimi. The two-stage recombination operator and its application to the multiobjective 0/1 knapsack problem: A comparative study
3263 -- 3271Qiu-Hong Zhao, Dragan Urosevic, Nenad Mladenovic, Pierre Hansen. A restarted and modified simplex search for unconstrained optimization
3272 -- 3280Mohsen S. Sajadieh, Kourosh Eshghi. Sole versus dual sourcing under order dependent lead times and prices
3281 -- 3290Pieter Vansteenwegen, Wouter Souffriau, Greet Vanden Berghe, Dirk Van Oudheusden. Iterated local search for the team orienteering problem with time windows

Volume 36, Issue 11

2885 -- 2891Jack Brimberg, Nenad Mladenovic, Dragan Urosevic, Eric Ngai. Variable neighborhood search for the heaviest k-subgraph
2892 -- 2898João C. N. Clímaco, Marta M. B. Pascoal. Finding non-dominated bicriteria shortest pairs of disjoint simple paths
2899 -- 2904Jia Shu, I. A. Karimi. Efficient heuristics for inventory placement in acyclic networks
2905 -- 2912Rafael Martí, José Luis González Velarde, Abraham Duarte. Heuristics for the bi-objective path dissimilarity problem
2913 -- 2925Francisco Ballestín, Vicente Valls, Sacramento Quintanilla. Scheduling projects with limited number of preemptions
2926 -- 2936Nabil Absi, Safia Kedad-Sidhoum. The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
2937 -- 2943Sigrid Knust, Daniel Lücking. Minimizing costs in round robin tournaments with place constraints
2944 -- 2954Clá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
2955 -- 2968Rodrigo Moretti Branchini, Vinícius Amaral Armentano, Arne Løkketangen. Adaptive granular local search heuristic for a dynamic vehicle routing problem
2969 -- 2982Pedro Martins, Maurício C. de Souza. VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
2983 -- 2993Ángel Felipe, M. Teresa Ortuño, Gregorio Tirado. The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
2994 -- 3001Amir 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
3002 -- 3012Mauro Dell Amico, José Carlos Díaz Díaz, Manuel Iori, Roberto Montanari. The single-finger keyboard layout problem
3013 -- 3018Rob A. C. M. Broekmeulen, Karel H. van Donselaar. A heuristic to manage perishable inventory with batch ordering, positive lead-times, and time-varying demand
3019 -- 3030Jinfeng Li, Feng Chu, Christian Prins. Lower and upper bounds for a capacitated plant location problem with multicommodity flow
3031 -- 3040T. C. Edwin Cheng, Bertrand M. T. Lin, Y. Tian. Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
3041 -- 3050Maria Battarra, Michele Monaci, Daniele Vigo. An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
3051 -- 3060Lars Magnus Hvattum, Kjetil Fagerholt, Vinícius Amaral Armentano. Tank allocation problems in maritime bulk shipping
3061 -- 3072Stephen Mahar, P. Daniel Wright. The value of postponing online fulfillment decisions in multi-channel retail/e-tail organizations
3073 -- 3081Chun-Lung Chen, Chuen-Lung Chen. A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
3082 -- 3085M. 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

Volume 36, Issue 10

2699 -- 2706José Manuel Cordero, Francisco Pedraja, Daniel Santín. Alternative approaches to include exogenous variables in DEA measures: A comparison using Monte Carlo
2707 -- 2715Jorge M. S. Valente, José Fernando Gonçalves. A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
2716 -- 2722Maria Elena Bruni, Francesca Guerriero, Erika Pinto. Evaluating project completion time in project networks with discrete random activity durations
2723 -- 2728Wenxing Zhu, M. M. Ali. Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
2729 -- 2739Francisco de Assis Corrêa, Luiz Antonio Nogueira Lorena, Glaydston Mattos Ribeiro. A decomposition approach for the probabilistic maximal covering location-allocation problem
2740 -- 2747Ali Allahverdi, Fawaz S. Al-Anzi. The two-stage assembly scheduling problem to minimize total completion time with setup times
2748 -- 2751Lingfa Lu, T. C. Edwin Cheng, Jinjiang Yuan, Liqi Zhang. Bounded single-machine parallel-batch scheduling with release dates and rejection
2752 -- 2758Jaime Catalán, Rafael Epstein, Mario Guajardo, Daniel Yung, Cristian Martinez. Solving multiple scenarios in a combinatorial auction
2759 -- 2762Gur Mosheiov, Assaf Sarig. A note: Simple heuristics for scheduling a maintenance activity on unrelated machines
2763 -- 2772An Caris, Gerrit K. Janssens. A local search heuristic for the pre- and end-haulage of intermodal container terminals
2773 -- 2785Stefan Creemers, Marc Lambrecht. An advanced queueing model to analyze appointment-driven service systems
2786 -- 2800Ningxiong Xu, Linda K. Nozick. Modeling supplier selection and the use of option contracts for global supply chain design
2801 -- 2815Flavio Keidi Miyazawa, Yoshiko Wakabayashi. Three-dimensional packings with rotations
2816 -- 2821Svetlana A. Kravchenko, Frank Werner. Preemptive scheduling on uniform machines to minimize mean flow time
2822 -- 2828Fayez F. Boctor, Jacques Renaud, Angel Ruiz, Simon Tremblay. Optimal and heuristic solution methods for a multiprocessor machine scheduling problem
2829 -- 2839Nikolaos Mastrogiannis, Basilis Boutsinas, Ioannis Giannikos. A method for improving the accuracy of data mining classification algorithms
2840 -- 2852Shi Qiang Liu, Erhan Kozan. Scheduling trains as a blocking parallel-machine job shop scheduling problem
2853 -- 2865Lixin Tang, Xie Xie, Jiyin Liu. Scheduling of a single crane in batch annealing process
2866 -- 2876Paz Perez-Gonzalez, Jose M. Framiñan. Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
2877 -- 2884Mohamed Haouari, Mehdi Serairi. Heuristics for the variable sized bin-packing problem

Volume 36, Issue 1

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