Journal: Computers & OR

Volume 26, Issue 9

849 -- 869Emanuel Melachrinoudis, Frank GuangSheng Zhang. An ::::O::::(::::mn::::) Algorithm for the 1-maximin problem on a network
871 -- 882Peter M. Van den Bosch, Dennis C. Dietz, Edward A. Pohl. Choosing the best approach to matrix exponentiation
883 -- 899Toshitsugu Otake, K. Jo Min, Cheng-Kang Chen. Inventory and investment in setup operations under return on investment maximization
901 -- 920Won Jun Lee, Kun Chang Lee. PROMISE: a distributed DSS approach to coordinating production and marketing decisions
921 -- 935Erik Rolland, Ali Amiri, Reza Barkhi. Queueing delay guarantees in bandwidth packing

Volume 26, Issue 8

749 -- 754T. C. Edwin Cheng, Qing Ding. The time dependent machine makespan problem is strongly NP-complete
755 -- 772Soung Hie Kim, Chang Hee Han. An interactive procedure for multi-attribute group decision making with incomplete information
773 -- 787Funda Sivrikaya-Serifoglu, Gündüz Ulusoy. Parallel machine scheduling with earliness and tardiness penalties
789 -- 798João Manuel Coutinho-Rodrigues, João C. N. Clímaco, John R. Current. An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
799 -- 817Shouhong Wang. Nonlinear regression: a hybrid model
819 -- 827Wen Lea Pearn, J. B. Chou. Improved solutions for the Chinese postman problem on mixed networks
829 -- 848Alf Kimms. A genetic algorithm for multi-level, multi-machine lot sizing and scheduling

Volume 26, Issue 7

645 -- 663Ji-Hui Zhang, Xin-He Xu. An efficient evolutionary programming algorithm
665 -- 678Tai-Yue Wang, Kuei-Bin Wu. A parameter set design procedure for the simulated annealing algorithm under the computational time constraint
679 -- 693Ching-Fang Liaw. A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
695 -- 698Bertrand M. T. Lin. The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine
699 -- 714Michel Gendreau, Gilbert Laporte, Daniele Vigo. Heuristics for the traveling salesman problem with pickup and delivery
715 -- 730T. C. Edwin Cheng, Guoqing Wang, Chelliah Sriskandarajah. One-operator-two-machine flowshop scheduling with setup and dismounting times
731 -- 747Waldemar Czuchra. Optimizing budget spendings for software implementation and testing

Volume 26, Issue 6

545 -- 558Hui-Ming Wee, Sh-Tyan Law. Economic production lot size for deteriorating items taking account of the time-value of money
559 -- 581Ho Woo Lee, S.-H. Lee, Seung Hyun Yoon, Boo Yong Ahn, No Ik Park. A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM
583 -- 597Faruk Güder, James L. Zydiak. Ordering policies for multi-item inventory systems subject to multiple resource constraints
599 -- 605Shaw-Ping Lan, Peter Chu, Kun-Jen Chung, Wun-Jung Wan, Ricky Lo. A simple method to locate the optimal solution of the inventory model with variable lead time
607 -- 621Tamie L. Veith, John E. Kobza, C. Patrick Koelling. Netsim: JavaTM-based simulation for the World Wide Web
623 -- 635Ralf Östermark. Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
637 -- 643Noel Kweku-Muata Bryson, Anito Joseph. Generating consensus priority point vectors: a logarithmic goal programming approach

Volume 26, Issue 5

443 -- 460Paul Mangiameli, David West. An improved neural classification network for the two-group problem
461 -- 480Chu-Fu Wang, Bo-Rong Lai, Rong-Hong Jan. Optimum multicast of multimedia streams
481 -- 503James M. Varanelli, James P. Cohoon. A fast method for generalized starting temperature determination in homogeneous two-stage simulated annealing systems
505 -- 523Jae-Dong Hong, Jack C. Hayya. On integrated production-replenishment policies in single-stage manufacturing
525 -- 544Oded Berman, U. Dinesh Kumar. Optimization models for complex recovery block schemes

Volume 26, Issue 4

297 -- 312Yash P. Aneja, Hichem Kamoun. Scheduling of parts and robot activities in a two machine robotic cell
313 -- 320Gregory Gutin. Exponential neighbourhood local search for the traveling salesman problem
321 -- 327Gregory Gutin, Anders Yeo. Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour
329 -- 351Santosh N. Kabadi, Md. Fazle Baki. Gilmore-Gomory type traveling salesman problems
353 -- 369Md. Fazle Baki, Santosh N. Kabadi. Pyramidal traveling salesman problem
371 -- 394Leyuan Shi, Sigurdur Ólafsson, Ning Sun. New parallel randomized algorithms for the traveling salesman problem
395 -- 407Samerkae Somhom, Abdolhamid Modares, Takao Enkawa. Competition-based neural network for the multiple travelling salesmen problem with minmax objective
409 -- 425Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen. Solving the ::::k::::-best traveling salesman problem
427 -- 441Steven E. Butt, David M. Ryan. An optimal solution procedure for the multiple tour maximum collection problem using column generation

Volume 26, Issue 3

189 -- 209Dennis Ridley. Optimal antithetic weights for lognormal time series forecasting
211 -- 218Haïscam Abdallah, Raymond A. Marie, Bruno Sericola. Point and expected interval availability analysis with stationarity detection
219 -- 235Vinícius Amaral Armentano, Débora P. Ronconi. Tabu search for total tardiness minimization in flowshop scheduling problems
237 -- 254Hui-Ming Wee, Wan-Tsu Wang. A variable production scheduling policy for deteriorating items with time-varying demand
255 -- 270Gülay Barbarosoglu, Demet Özgür. A tabu search algorithm for the vehicle routing problem
271 -- 279Diptesh Ghosh, Nilotpal Chakravarti. A competitive local search heuristic for the subset sum problem
281 -- 292Douglas M. Kline, Abraham Mehrez, Geoffrey Steinberg. Information availability vs. solution space size in a knowledge acquisition problem

Volume 26, Issue 2

93 -- 108Sabine Wittevrongel, Herwig Bruneel. Discrete-time queues with correlated arrivals and constant service times
109 -- 126Ching-Fang Liaw. A tabu search algorithm for the open shop scheduling problem
127 -- 141Nagraj Balakrishnan, John J. Kanet, Sri V. Sridharan. Early/tardy scheduling with sequence dependent setups on uniform parallel machines
143 -- 155Richard L. Daniels, Stella Y. Hua, Scott Webster. Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
157 -- 177Valery S. Gordon, Vitaly A. Strusevich. Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
179 -- 188Gin Hor Chan, Z. H. Xia, Eng Ung Choo. The critical cut-off value approach for dynamic lot sizing problems with time varying cost parameters

Volume 26, Issue 14

1335 -- 1349Zvi Drezner, George O. Wesolowsky. Allocation of discrete demand with changing costs
1351 -- 1367Stefano Benati. The maximum capture problem with heterogeneous customers
1369 -- 1394Maureen Kilkenny, Jacques-François Thisse. Economics of location: A selective survey
1395 -- 1409Igor Averbakh, Oded Berman. Algorithms for path medi-centers of a tree
1411 -- 1422Mihiro Sasaki, Atsuo Suzuki, Zvi Drezner. On the selection of hub airports for an airline hub-and-spoke system
1423 -- 1436Mamnoon Jamil, Alok Baveja, Rajan Batta. The stochastic queue center problem

Volume 26, Issue 13

1243 -- 1265Edward M. Condon, Bruce L. Golden, Edward A. Wasil. Predicting the success of nations at the Summer Olympics using neural networks
1267 -- 1292Ayse Kavusturucu, Surendra M. Gupta. Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy
1293 -- 1310Wei-Chang Yeh. A new branch-and-bound approach for the ::::n::::/2/flowshop/alpha::::F::::+beta::::C::::::::::max:::::: flowshop scheduling problem
1311 -- 1321Gary R. Reeves, Kenneth R. MacLeod. Some experiments in Tchebycheff-based approaches for interactive multiple objective decision making
1323 -- 1333David J. Robb, Dan Trietsch. Maximizing the number of mixed packages subject to variety constraints

Volume 26, Issue 12

1153 -- 1173Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard. A tabu search heuristic for the heterogeneous fleet vehicle routing problem
1175 -- 1194Ching-Chir Shyur, Ta-Chien Lu, Ue-Pyng Wen. Applying tabu search to spare capacity planning for network restoration
1195 -- 1216Ruben Kirkeby Martinson, Jørgen Tind. An interior point method in Dantzig-Wolfe decomposition
1217 -- 1230Manuel Laguna, Rafael Martí, Vicente Campos. Intensification and diversification with elite tabu search solutions for the linear ordering problem
1231 -- 1242Gary R. Reeves, Randall C. Reid. A military reserve manpower planning model

Volume 26, Issue 10-11

941 -- 953H. Edwin Romeijn, Robert L. Smith. Parallel algorithms for solving aggregated shortest-path problems
955 -- 966Kurt Jørnsten, Rainer Leisten, Sverre Storøy. Convergence aspects of adaptive clustering in variable aggregation
967 -- 988Igor S. Litvinchev, Socorro Rangel. Localization of the optimal solution and a posteriori bounds for aggregation
989 -- 1002Chiun-Ming Liu. Clustering techniques for stock location and order-picking in a distribution center
1003 -- 1014Susan K. Norman, David F. Rogers, Martin S. Levy. Error bound comparisons for aggregation/disaggregation techniques applied to the transportation problem
1015 -- 1039Jishnu Hazra, Paul J. Schweitzer, Abraham Seidmann. Analyzing closed Kanban-controlled assembly systems by iterative aggregation-disaggregation
1041 -- 1058Rajesh Tyagi, Chandrasekhar Das. Grouping customers for better allocation of resources to serve correlated demands
1059 -- 1074Larry Weinstein, Chen-Hua Chung. Integrating maintenance and production decisions in a hierarchical production planning environment
1075 -- 1096Erhan Erkut, Burçin Bozkaya. Analysis of aggregation errors for the ::::p::::-median problem
1097 -- 1111Robert L. Bowerman, Paul H. Calamai, G. Brent Hall. The demand partitioning method for reducing aggregation errors in ::::p::::-median problems
1113 -- 1124M. Brenda Rayco, Richard L. Francis, Arie Tamir. A ::::p::::-center grid-positioning aggregation procedure
1125 -- 1132Moshe Haviv. On censored Markov chains, best augmentations and aggregation/disaggregation procedures
1133 -- 1149Gene Fliedner. An investigation of aggregate variable time series forecast strategies with specific subaggregate time series statistical correlation

Volume 26, Issue 1

1 -- 15Zvi Drezner, George O. Wesolowsky. Allocation of demand when cost is demand-dependent
17 -- 34Andreas Fink, Stefan Voß. Applications of modern heuristic search methods to pattern sequencing problems
35 -- 44A. Volgenant, E. Teerhuis. Improved heuristics for the n-job single-machine weighted tardiness problem
45 -- 57Dirk Biskup, T. C. Edwin Cheng. Multiple-machine scheduling with earliness, tardiness and completion time penalties
59 -- 72Soung Hie Kim, Choong-Gyoo Park, Kyung-Sam Park. An application of data envelopment analysis in telephone offices evaluation with partial data
73 -- 91Liu Bin, Cao Jinhua. Analysis of a production-inventory system with machine breakdowns and shutdowns