Journal: Computers & OR

Volume 38, Issue 8

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