Computers & Operations Research, Volume 18

Volume 18, Number 1, 1991

• Rajendra S. Solanki:
  Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem. 1-15
  
• Herminio Simões Gomes, Jose Mario Martinez:
  A Numerically stable reduced-gradient type algorithm for solving large-scale linearly constrained minimization problems. 17-31
  
• David Whitaker, Susan M. Brown:
  Linear programme modelling with databases. 33-41
  
• Douglas J. White:
  The maximal dispersion problem and the "First point outside the neighbourhood" heuristic. 43-50
  
• Ho Woo Lee, Soon Seok Lee:
  A batch arrival queue with different vacations. 51-58
  
• Manlio Gaudioso, Pasquale Legato:
  Linear programming models for load balancing. 59-64
  
• Saul I. Gass:
  Military manpower planning models. 65-73
  
• Lawrence Bodin, Azita Kashani:
  The zone hopping problem. 75-86
  
• Cliff T. Ragsdale, Patrick G. McKeown:
  An algorithm for solving fixed-charge problems using surrogate constraints. 87-96
  
• Wan Seon Shin, A. Ravindran:
  Interactive multiple objective optimization: Survey I - continuous case. 97-114
  
• Tzvi Raz, Dennis L. Bricker:
  Optimal and heuristic solutions to the variable inspection policy problem. 115-123
  
• Bernard Dickman, Yonah Wilamowsky, Sheldon Epstein:
  Optimal common due-date with limited completion time. 125-127
  

Volume 18, Number 2, 1991

• Noel Bryson:
  Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint. 129-140
  
• Daoud Ait-Kadi, Robert Cléroux:
  Replacement strategies with mixed corrective actions at failure. 141-149
  
• Ram Ramesh, Kathleen M. Brown:
  An efficient four-phase heuristic for the generalized orienteering problem. 151-165
  
• Choong Y. Lee:
  An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type. 167-182
  
• Saligrama R. Agnihothri:
  Complementarity between the finite capacity and finite source queuing systems. 183-188
  
• Wen Lea Pearn:
  Augment-insert algorithms for the capacitated arc routing problem. 189-198
  
• Robert R. Trippi, Efraim Turban:
  Parallel processing and OR/MS. 199-210
  
• Laura Ignizio Burke:
  Introduction to artificial neural systems for pattern recognition. 211-220
  
• Jati K. Sengupta:
  Robust decisions in economic models. 221-232
  
• Eero Kasanen, Ralf Östermark, Milan Zeleny:
  Gestalt system of holistic graphics: New management support view of MCDM. 233-239
  

Volume 18, Number 3, 1991

• Bharat K. Kaku, Gerald L. Thompson, Thomas E. Morton:
  A hybrid heuristic for the facilities layout problem. 241-253
  
• J. K. Suryanarayanan, Bruce L. Golden, Qi Wang:
  A new heuristic for the linear placement problem. 255-262
  
• Martin Desrochers, T. W. Verhoog:
  A new heuristic for the fleet size and mix vehicle routing problem. 263-274
  
• Christopher L. Huntley, Donald E. Brown:
  A parallel heuristic for quadratic assignment problems. 275-289
  
• Lee Josvanger Crowder, V. A. Sposito:
  Sequential linear goal programming: Implementation via MPSX/370E. 291-296
  
• Muhammad El-Taha, John R. Heath:
  A model of channel allocation in multichannel local networks. 297-306
  
• Cesar G. Tapia, Bruce A. Murtagh:
  Interactive fuzzy programming with preference criteria in multiobjective decision-making. 307-316
  
• Bahram Alidaee:
  Single machine scheduling with nonlinear cost functions. 317-322
  
• A. M. A. Hariri, C. N. Potts:
  Heuristics for scheduling unrelated parallel machines. 323-331
  
• Corrigendum. 333-
  

Volume 18, Number 4, 1991

• Margaret F. Shipley, André de Korvin, Riad Obid:
  A decision making model for multi-attribute problems incorporating uncertainty and bias measures. 335-342
  
• Don Hommertzheim, John Huffman, Ihsan Sabuncuoglu:
  Training an artificial neural network the pure pursuit maneuver. 343-353
  
• Patrice Marcotte, Gilles Savard:
  A note on the Pareto optimality of solutions to the linear bilevel programming problem. 355-359
  
• Yves De Serres:
  Simultaneous optimization of flow-control and scheduling in a single server queue with two job classes: Numerical results and approximation. 361-378
  
• Chung-Yee Lee, Surya Danusaputro Liman, Chen-Sin Lin:
  Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date. 379-389
  
• Marvin D. Troutt, Suresh K. Tadisina:
  A mixed integer programming approach for accommodating outliers with the minimax absolute error criterion. 391-395
  

Volume 18, Number 5, 1991

• Abraham Mehrez, Buddy L. Myers, Moutaz J. Khouja:
  Quality and inventory issues within the newsboy problem. 397-410
  
• C. N. Potts:
  Scheduling two job classes on a single machine. 411-415
  
• Avishai Ceder:
  A procedure to adjust transit trip departure times through minimizing the maximum headway. 417-431
  
• Michael B. Silberholz, Bruce L. Golden, Edward K. Baker:
  Using simulation to study the impact of work rules on productivity at marine container terminals. 433-452
  
• In-Soo Lee:
  A note on a deterministic production scheduling model. 453-456
  
• Prabuddha De, Jay B. Ghosh, Charles E. Wells:
  On the minimization of the weighted number of tardy jobs with random processing times and deadline. 457-463
  
• Prabuddha De, Jay B. Ghosh, Charles E. Wells:
  Scheduling to minimize weighted earliness and tardiness about a common due-date. 465-475
  
• Kun-Jen Chung, Matthew J. Sobel:
  Linear programming solutions of the truncated moment problem. 477-485
  
• Diptendu Sinha:
  Optimal policy estimation for continuous review inventory systems. 487-496
  

Volume 18, Number 6, 1991

• Ayoade Kuye:
  Numerical experiments with the one-dimensional non-linear simplex search. 497-506
  
• Abid M. Elabdalla:
  A note on multikey sorting using modified binary insertion trees. 507-513
  
• Amiya K. Chakravarty, G. E. Martin:
  Operational economies of a process positioning determinant. 515-530
  
• Moshe B. Rosenwein:
  An improved bounding procedure for the constrained assignment problem. 531-535
  
• Kah Mun Cheh, Jeffrey B. Goldberg, Ronald G. Askin:
  A note on the effect of neighborhood structure in simulated annealing. 537-547
  
• Parthasarati Dileepan, Tapan Sen:
  Job lateness in a two-machine flowshop with setup times separated. 549-556
  
• Deb Ghosh, Ishwar Murthy:
  A solution procedure for the file allocation problem with file availability and response time. 557-568
  
• Robert T. Barrett, R. Lawrence LaForge:
  A study of replanning frequencies in a material requirements planning system. 569-578
  
• J. Ben Rosen, Shangzhi Sun, Guoliang Xue:
  Algorithms for the quickest path problem and the enumeration of quickest paths. 579-584
  

Volume 18, Number 7, 1991

• James A. Chisman:
  Preparing students and new practitioners for the real-world of OR/MS. 585-589
  
• Wilfred Candler:
  Coal blending - with acceptance sampling. 591-596
  
• Hamdy A. Taha:
  Operations research analysis of a stock market problem. 597-602
  
• Douglas A. Samuelson:
  On the hazards of relying on mathematical models: Three cases from federal policy analysis. 603-606
  
• Robert E. D. Woolsey:
  Being wrong with Clarke & Wright. 607-609
  
• Samuel J. Raff:
  The Navy passive ranging problem. 611-614
  
• Salah E. Elmaghraby:
  Manufacturing capacity and its measurement: A critical evaluation. 615-627
  
• Saul I. Gass:
  OR in the real world: How things go wrong. 629-632
  
• Fran Samuelson:
  An intelligent spouse's view of OR. 633-634
  
• Samuel J. Raff:
  Preface.
  

Volume 18, Number 8, 1991

• Thomas A. Feo, Krishnamurthi Venkatraman, Jonathan F. Bard:
  A GRASP^TM for a difficult single machine scheduling problem^, . 635-643
  
• Joaquim Júdice, Ana M. Faustino:
  A computational analysis of LCP methods for bilinear and concave quadratic programming. 645-654
  
• Tom M. Cavalier, Brian J. Melloy:
  An iterative linear programming solution to the Euclidean regression model. 655-661
  
• R. K.-Y. Li, R. J. Willis:
  Alternative resources in project scheduling. 663-668
  
• Marc J. Schniederjans, N. K. Kwak, James S. Frueh:
  A stochastic linear programming model to improve automobile dealership operations. 669-678
  
• Mohan L. Chaudhry, Umesh Chandra Gupta, Manju Agarwal:
  On exact computational analysis of distributions of numbers in systems for M/G/1/N + 1 and GI/M/1/N + 1 queues using roots. 679-694
  
• Yasushi Masuda, Ushio Sumita:
  Numerical analysis of gracefully degrading fault-tolerant computer systems: Semi-markov and laguerre transform approach. 695-707
  
• Leo W. G. Strijbosch, Arno G. M. van Doorne, Willem J. Selen:
  A simplified molp algorithm: The MOLP-S procedure. 709-716
  
• Prabuddha De, Jay B. Ghosh, Charles E. Wells:
  Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine. 717-720
  
• Alireza Ardalan:
  Combined optimal price and optimal inventory replenishment policies when a sale results in increase in demand. 721-730
  
• Michael M. Kostreva, Karen S. B. Jennings:
  Nurse scheduling on a microcomputer. 731-739
  
• K. Nurmi:
  Travelling salesman problem tools for microcomputers. 741-749
  
• Panos Constantopoulos, Fred C. Schweppe, Richard C. Larson:
  Estia: A real-time consumer control scheme for space conditioning usage under spot electricity pricing. 751-765
  
• Jean-François Mondou, Teodor Gabriel Crainic, Sang Nguyen:
  Shortest path algorithms: A computational study with the C programming language. 767-786
  
• B. V. Cadambi:
  One machine scheduling to minimize expected mean tardiness - part I. 787-796