Journal: Computers & OR

Volume 29, Issue 9

1115 -- 1127Francisco J. Arcelus, T. P. M. Pakkala, Gopalan Srinivasan. A myopic policy for the gradual obsolescence problem with price-dependent demand
1129 -- 1141Jacques Renaud, Fayez F. Boctor, Gilbert Laporte. Perturbation heuristics for the pickup and delivery traveling salesman problem
1143 -- 1156Eugene J. Zak. Row and column generation technique for a multistage cutting stock problem
1157 -- 1172Chae Y. Lee, Hee K. Cho. Port partitioning and dynamic queueing for IP forwarding
1173 -- 1193Siddhartha S. Syam. A model and methodologies for the location problem with logistical components
1195 -- 1206Konstantin Kogan, Sheldon X. C. Lou. Scheduling one-part-type serial manufacturing system under periodic demand: a solvable case
1207 -- 1220Miro Gradisar, Gortan Resinovic, Miroljub Kljajic. Evaluation of algorithms for one-dimensional cutting
1221 -- 1235Mauricio Solar, VĂ­ctor Parada, Rodrigo Urrutia. A parallel genetic algorithm to solve the set-covering problem
1237 -- 1250Jaques Reifman, Earl E. Feldman. Multilayer perceptron for nonlinear programming
1251 -- 1266Ching-Fang Liaw, Chun-Yuan Cheng, Mingchih Chen. The total completion time open shop scheduling problem with a given sequence of jobs on one machine
1267 -- 1281Kyung Sang Lee, Kyung-Sam Park, Soung Hie Kim. Dominance, potential optimality, imprecise information, and hierarchical structure in multi-criteria analysis