Computers & Operations Research, Volume 38 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• 

• 

• 

• 

• 
  jump to

  • Number 1
  • Number 2
  • Number 3
  • Number 4
  • Number 5
  • Number 6
  • Number 7
  • Number 8
  • Number 9
  • Number 10
  • Number 11
  • Number 12

• 

• > Home > Journals > Computers & Operations Research

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 38, Number 1, January 2011

Special Issue Papers

• 
  • 
  • 
  • 
  • 
    Funda Sivrikaya-Serifoglu, Ümit Bilge:
    Guest editorial. 1-2
• 
  • 
  • 
  • 
  • 
    Oumar Koné, Christian Artigues, Pierre Lopez, Marcel Mongeau:
    Event-based MILP models for resource-constrained project scheduling problems. 3-13
• 
  • 
  • 
  • 
  • 
    Lucio Bianco, Massimiliano Caramia:
    A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations. 14-20
• 
  • 
  • 
  • 
  • 
    John E. Hebert, Richard F. Deckro:
    Combining contemporary and traditional project management tools to resolve a project scheduling problem. 21-32
• 
  • 
  • 
  • 
  • 
    Agustín Barrios, Francisco Ballestín, Vicente Valls:
    A double genetic algorithm for the MRCPSP/max. 33-43
• 
  • 
  • 
  • 
  • 
    Anurag Agarwal, Selçuk Çolak, S. Selçuk Erengüç:
    A Neurogenetic approach for the resource-constrained project scheduling problem. 44-50
• 
  • 
  • 
  • 
  • 
    Francisco Ballestín, Rosa Blanco:
    Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems. 51-62
• 
  • 
  • 
  • 
  • 
    Filip Deblaere, Erik Demeulemeester, Willy Herroelen:
    Reactive scheduling in the multi-mode RCPSP. 63-74

Normal Papers

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

Volume 38, Number 2, February 2011

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

Volume 38, Number 3, March 2011

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

Volume 38, Number 4, April 2011

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

Volume 38, Number 5, May 2011

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

Volume 38, Number 6, June 2011

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

Volume 38, Number 7, July 2011

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

Volume 38, Number 8, August 2011

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

Volume 38, Number 9, September 2011

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

Volume 38, Number 10, October 2011

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

Volume 38, Number 11, November 2011

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

Volume 38, Number 12, December 2011

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

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: