Computers & Operations Research, Volume 22

Volume 22, Number 1, January 1995

• Samuel J. Raff:
  Preface. 1-
  
• Anup Kumar, Yash P. Gupta:
  Introduction. 3-
  
• Colin R. Reeves:
  A genetic algorithm for flowshop sequencing. 5-13
  
• Federico Della Croce, Roberto Tadei, Giuseppe Volta:
  A genetic algorithm for the job shop problem. 15-24
  
• Ulrich Dorndorf, Erwin Pesch:
  Evolution based learning in a job shop scheduling environment. 25-40
  
• Anup Kumar, Rakesh M. Pathak, Yash P. Gupta:
  Genetic algorithm based approach for file allocation on distributed systems. 41-54
  
• T. Chockalingam, S. Arunkumar:
  Genetic algorithm based heuristics for the mapping problem. 55-64
  
• William Franklin Hahnert III, Patricia A. S. Ralston:
  Analysis of population size in the accuracy and performance of genetic training for rule-based control systems. 65-71
  
• David M. Tate, Alice E. Smith:
  A genetic approach to the quadratic assignment problem. 73-83
  
• Paul A. Rubin, Gary L. Ragatz:
  Scheduling in a sequence dependent setup environment with genetic search. 85-99
  
• Anthony Wren, David O. Wren:
  A genetic algorithm for public transport driver scheduling. 101-110
  
• Fred Glover, James P. Kelly, Manuel Laguna:
  Genetic algorithms and tabu search: Hybrids for optimization. 111-134
  
• P. W. Poon, J. N. Carter:
  Genetic algorithm crossover operators for ordering applications. 135-147
  
• A. R. Venkatachalam:
  An analysis of an embedded crossover scheme on a GA-hard problem. 149-157
  

Volume 22, Number 2, February 1995

• Dake Sun, Rajan Batta, Li Lin:
  Effective job shop scheduling through active chain manipulation. 159-172
  
• Soon Seok Lee, Ho Woo Lee, Seung Hyun Yoon, Kyung C. Chae:
  Batch arrival queue with N-policy and single vacation. 173-189
  
• Vaidyanathan K. Jayaraman, Rajesh Srivastava:
  A service logistics model for simultaneous siting of facilities and multiple levels of equipment. 191-204
  
• Chung-Lun Li, T. C. Edwin Cheng, Zhi-Long Chen:
  Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs. 205-219
  
• Mohammad Kaykobad, Q. N. U. Ahmed, A. T. M. Shafiqul Khalid, Rezwan-al Bakhtiar:
  A new algorithm for ranking players of a round-robin tournament. 221-226
  
• Hayri Önal, Delima H. Darmawan, Sam H. Johnson III:
  A multilevel analysis of agricultural credit distribution in East Java, Indonesia. 227-236
  
• Johnny C. Ho, Jatinder N. D. Gupta:
  Flowshop scheduling with dominant machines. 237-246
  
• Hüseyin Sarper:
  Comments and corrections for the machining economics optimization article by Duffuaa, Shuaib and Alam. 247-248
  
• Salih O. Duffuaa, Abdelrahman N. Shuaib:
  Rejoinder to sarper's note on the machining economics optimization article by Duffuaa, Shuaib and Alam. 249-250
  

Volume 22, Number 3, March 1995

• Christer Carlsson, Robert Fullér:
  Multiple criteria decision making: The case for interdependence. 251-260
  
• Houn-Gee Chen:
  Heuristics for operator scheduling in Group Technology cells. 261-276
  
• Chung-Lun Li:
  A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs. 277-283
  
• Maliyakal D. Jayakumar:
  Cascading-heuristics for the solution of staircase linear programs. 285-295
  
• Ching-Jong Liao, Chien-Lin Sun, Wen-Ching You:
  Flow-shop scheduling with flexible processors. 297-306
  
• Yeong-Dae Kim:
  A backward approach in list scheduling algorithms for multi-machine tardiness problems. 307-319
  
• Cha-Hon Sun, Sheng-De Wang:
  An efficient pruning algorithm for value independent knapsack problem using a DAG structure. 321-334
  
• Sydney C. K. Chu, Betty K. P. Tang:
  An optimization modeling for customer redistribution and its spreadsheet implementation. 335-343
  
• Hui-Ming Wee:
  A deterministic lot-size inventory model for deteriorating items with shortages and a declining market. 345-356
  

Volume 22, Number 4, April 1995

• Jee Soo Kim, Frank Proschan:
  A review: The arrangement increasing partial ordering. 357-371
  
• Mark Brown:
  The distribution of total variation distance, with applications to simultaneous confidence intervals. 373-381
  
• Philip J. Boland, Emad El-Neweihi:
  Expected cost comparisons for inspection and repair policies. 383-390
  
• Moshe Shaked, J. George Shanthikumar, Jose Benigno Valdez-Torres:
  Discrete hazard rate functions. 391-402
  
• C. E. Love, Renkuan G. Guo, K. H. Irwin:
  Acceptable quality level versus zero-defects: some empirical evidence. 403-417
  
• Moshe F. Friedman:
  Statistical analysis of deadband-deviation rules in quality control. 419-433
  
• Mohamed Abdel-Hameed:
  Inspection, maintenance and replacement models. 435-441
  
• John M. Charnes:
  Tests for special causes with multivariate autocorrelated data. 443-453
  
• Philip J. Boland, Emad El-Neweihi:
  Measures of component importance in reliability theory. 455-463
  
• Samuel J. Raff:
  Preface.
  
• Moshe F. Friedman:
  Foreword.
  

Volume 22, Number 5, May 1995

• Ram Pandi, B. Muralidharan:
  A capacitated general routing problem on mixed networks. 465-478
  
• Wen Lea Pearn, C. M. Liu:
  Algorithms for the Chinese postman problem on mixed networks. 479-489
  
• Jayaram K. Sankaran:
  A monotonic, dual-based bounding procedure for integer programs. 491-501
  
• K. Jo Min, Cheng-Kang Chen:
  A competitive inventory model with options to reduce setup and inventory holding costs. 503-514
  
• Moutaz J. Khouja:
  The economic production lot size model under volume flexibility. 515-523
  
• Zvi Drezner:
  On the conditional p-median problem. 525-530
  
• Sang-jin Nam, Rasaratnam Logendran:
  Modified production switching heuristics for aggregate production planning. 531-541
  
• Hyo-Seong Lee:
  Optimal control of the M^X/G/1/K queue with multiple server vacations. 543-552
  
• I-Ming Chao, Bruce L. Golden, Edward A. Wasil:
  A new heuristic for the period traveling salesman problem. 553-565
  

Volume 22, Number 6, July 1995

• Jae-Dong Hong, Jack C. Hayya:
  Joint investment in quality improvement and setup reduction. 567-574
  
• Rajani R. Joshi:
  Immune network memory: An inventory approach. 575-591
  
• Buyang Cao, Götz Uebe:
  Solving transportation problems with nonlinear side constraints with tabu search. 593-603
  
• Adam Fadlalla, James R. Evans:
  Improving the performance of enumerative search methods-I. Exploiting structure and intelligence. 605-613
  
• David W. Ashley:
  A spreadsheet optimization system for library staff scheduling. 615-624
  
• Patrice Marcotte, Gerald P. Marquis, Gilles Savard:
  A new implicit enumeration scheme for the discriminant analysis problem. 625-639
  
• B. Jay Coleman, Mark A. McKnew:
  A quick and effective method for capacitated lot sizing with startup and reservation costs. 641-653
  
• Peter W. Frizzell, J. W. Giffin:
  The split delivery vehicle scheduling problem with time windows and grid network distances. 655-667
  

Volume 22, Number 7, August 1995

• Alistair Richard Clark, Vinícius Amaral Armentano:
  The application of valid inequalities to the multi-stage lot-sizing problem. 669-680
  
• Munirpallam A. Venkataramanan, A. Victor Cabot, Wayne L. Winston:
  An interval branch and bound algorithm for global optimization of a multiperiod pricing model. 681-687
  
• Gadi Rabinowitz, Abraham Mehrez, Ching-Wu Chu, B. Eddy Patuwo:
  A partial backorder control for continuous review (r, Q) inventory system with poisson demand and constant lead time. 689-700
  
• Krishnamurty Muralidhar, Dinesh Batra:
  An investigation of the effectiveness of statistical distributions for additive fixed data perturbation. 701-713
  
• Michael C. Fu, Jian-Qiang Hu, Rakesh Nagi:
  Comparison of gradient estimation techniques for queues with non-identical servers. 715-729
  
• Madjid Tavana, Snehamay Banerjee:
  Evaluating strategic alternatives: An analytical model. 731-743
  
• Chih-Ming Liu, Chii-Lian Lin:
  An efficient two-phase approximation method for exponential tandem queueing systems with blocking. 745-762
  
• Danae Diakoulaki, George Mavrotas, Lefteris Papayannakis:
  Determining objective weights in multiple criteria problems: The critic method. 763-770
  

Volume 22, Number 8, October 1995

• B. K. Mohanty, T. A. S. Vijayaraghavan:
  A multi-objective programming problem and its equivalent goal programming problem with appropriate priorities and aspiration levels: A fuzzy approach. 771-778
  
• Yi-Cheng Su, M. Jeya Chandra:
  An approximation analysis for multistage production lines. 779-791
  
• Christopher Rose, Roy D. Yates:
  Scheduling arrivals to queues for minimum average blocking: The S(n)/M/C/C system. 793-806
  
• Radhika Santhanam, Jerzy Kyparisis:
  A multiple criteria decision model for information system project selection. 807-818
  
• Wen Lea Pearn, T. C. Wu:
  Algorithms for the rural postman problem. 819-828
  
• Huan Li, Yixin Zhu, Ping Yang:
  Computational analysis of M(n)/G/1/N queues with setup time. 829-840
  
• B. Awadh, N. Sepehri, O. Hawaleshka:
  A computer-aided process planning model based on genetic algorithms. 841-856
  
• Chae-Young Lee, Jae Young Choi:
  A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. 857-869
  

Volume 22, Number 9, November 1995

• Laura Burke, Seth Flanders:
  Using ontogenic classification networks in a smart structures application. 871-881
  
• Anito Joseph:
  Parametric formulation of the general integer linear programming problem. 883-892
  
• Saul I. Gass, Pablo M. R. Zafra:
  Modified fictitious play for solving matrix games and linear-programming problems. 893-903
  
• I. Douglas Moon, Lee Papayanopoulos:
  Facility location on a tree with maximum distance constraints. 905-914
  
• Klaus Jansen, Gerhard J. Woeginger, Zhongliang Yu:
  UET-scheduling with chain-type precedence constraints. 915-920
  
• Lloyd W. Clarke, G. Anandalingam:
  A bootstrap heuristic for designing minimum cost survivable networks. 921-934
  
• M. N. Gopalan, S. Kannan:
  Expected number analysis of a two-server queueing network subject to inter-stage inspection and rework. 935-946
  
• Susan X. Li, Zhimin Huang:
  Managing buyer-seller system cooperation with quantity discount considerations. 947-958
  
• Luis Gouveia:
  Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. 959-970
  
• Herminia I. Calvete, Pedro M. Mateo:
  An approach for the network flow problem with multiple objectives. 971-983
  

Volume 22, Number 10, December 1995

• Adam Fadlalla, James R. Evans, Martin S. Levy:
  Improving the performance of enumerative search methods - part II: Computational experiments. 987-994
  
• Heeseok Lee:
  Optimal static distribution of prioritized customers to heterogeneous parallel servers. 995-1003
  
• Surendra M. Gupta:
  Interrelationship between controlling arrival and service in queueing systems. 1005-1014
  
• Hsing Kenneth Cheng:
  Optimal capacity of a firm's computer backup center. 1015-1029
  
• Kuo-Ping Chang, Yeah-Yuh Guh:
  Piecewise loglinear frontier and log efficiency measures. 1031-1037
  
• Ohseok Kwon, Bruce L. Golden, Edward A. Wasil:
  Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks. 1039-1046
  
• Robert T. Sumichras, Ina S. Markham:
  A heuristic and lower bound for a multi-depot routing problem. 1047-1056
  
• Hemant D. Gosavi, J. MacGregor Smith:
  Asymptotic bounds of throughput in series-parallel queueing networks. 1057-1073
  
• A. K. Aggarwal, Marilyn D. Oblak, Rao R. Vemuganti:
  A heuristic solution procedure for multicommodity integer flows. 1075-1087
  
• Jon M. Peha:
  Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time. 1089-1100