- S. David Wu, Robert H. Storer, Pei-Chann Chang:
**One-machine rescheduling heuristics with efficiency and stability as criteria.**1-14

- Eleni Pratsini, Jeffrey D. Camm, Amitabh S. Raturi:
**Effect of process learning on manufacturing schedules.**15-24

- Rong-Hong Jan:
**Design of reliable networks.**25-34

- Hossein Arsham:
**A markovian model of consumer buying behavior and optimal advertising pulsing policy.**35-48

- Cliff T. Ragsdale:
**Deriving conclusions in expert systems when knowledge is incomplete.**49-58

- Yen-Liang Chen:
**An algorithm for finding the**59-65*k*quickest paths in a network.

- Kisu Kim, Andrew F. Seila:
**A generalized cost model for stochastic clearing systems.**67-82

- Michael G. Sklar, Ronald D. Armstrong:
**Lagrangian approach for large-scale least absolute value estimation.**83-93

- Wilfried de Corte:
**Qualitative programming for selection decisions: a reappraisal.**95-101

- John Mittenthal, Madabhushi Raghavachari, Arif I. Rana:
**A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions.**103-111

- Timothy H. Burwell, James P. Jarvis, Mark A. McKnew:
**Modeling co-located servers and dispatch ties in the hypercube model.**113-119

- S. Datta, R. Bandyopadhya:
**An application of O.R. in micro-level planning in India.**121-132

- Norman D. Curet:
**On the dual coordinate ascent approach for nonlinear networks.**133-140

- Prabuddha De, Jay B. Ghosh, Charles E. Wells:
**On the general solution for a class of early/tardy problems.**141-149

- M. J. Kaiser, T. L. Morin:
**Algorithms for computing centroids.**151-165

- Rose D. Baker:
**A nonparametric estimator of the renewal function.**167-178

- Parthasarati Dileepan:
**Common due date scheduling problem with separate earliness and tardiness penalties.**179-184

- Wu-Der Jeng, James T. Lin, Ue-Pyng Wen:
**Algorithms for sequencing robot activities in a robot-centered parallel-processor workcell.**185-197

- Jennifer D. Michaels, John E. Brennan, Bruce L. Golden, Michael C. Fu:
**A simulation study of donor scheduling systems for the American Red Cross.**199-213

- Donald L. Davis, James H. Barnes Jr., Wade M. Jackson:
**Integrating communications theory, cognitive style and computer simulation as an aid to research on implementation of operations research.**215-225

- Salih O. Duffuaa, Abdelrahman N. Shuaib, Mansoor Alam:
**Evaluation of optimization methods for machining economics models.**227-237

- Sri Gopal Mohanty, Aliakbar Montazer-Haghighi, R. Trueblood:
**On the transient behavior of a finite birth-death process with an application.**239-248

- Attila Csenki:
**Occupation frequencies for irreducible finite semi-markov processes with reliability applications.**249-259

- Bill Wild Jr., Kirk R. Karwan, Mark H. Karwan:
**The multiple bottleneck transportation problem.**261-274

- Hussein M. Saber, A. Ravi Ravindran:
**Nonlinear goal programming theory and practice: A survey.**275-291

- Emily Roth, Norman Josephy:
**A relaxation time heuristic for exponential-erlang queueing systems.**293-301

- Herwig Bruneel:
**Performance of discrete-time queueing systems.**303-320

- Lixin Tao, Yongchang Zhao:
**Multi-way graph partition by stochastic probe.**321-347

- Marvin D. Troutt, Suresh K. Tadisina:
**Simulation based validity testing of an outlier accommodation method for minimax absolute error regression.**349-353

- Joseph B. Mazzola, Alan W. Neebe:
**An algorithm for the bottleneck generalized assignment problem.**355-362

- Hanif D. Sherali, Gyunghyun Choi:
**Finding the closest point to the origin in the convex hull of a discrete set of points.**363-370

- Jean-Yves Potvin, Gina Dufour, Jean-Marc Rousseau:
**Learning vehicle dispatching with linear programming models.**371-380

- Prabuddha De, Jay B. Ghosh, Charles E. Wells:
**Delivery time quotation and order processing with forbidden early shipments.**381-390

- Yeong-Dae Kim:
**A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops.**391-401

- Kim Fung Lam, Eng Ung Choo:
**A linear goal programming model for classification with non-monotone attributes.**403-408

- Harvey H. Millar, Minzhu Yang:
**An application of Lagrangean decomposition to the capacitated multi-item lot sizing proble.**409-420

- Oded Z. Maimon, Mark Last:
**Information-efficient design of an automatic aircraft maintenance supervisor.**421-434

- Myungkoo Kang, Kailash Kapur, P. Simin Pulat:
**Interactive partitioning criteria set method for multiple objective linear programming.**435-446

- G. V. Krishna Reddy, R. Nadarajan, P. R. Kandasamy:
**A nonpreemptive priority multiserver queueing system with general bulk service and heterogeneous arrivals.**447-453

- Richard A. Sandbothe, Gerald L. Thompson:
**Decision horizons for the capacitated lot size model with inventory bounds and stockouts.**455-465

- Lori S. Franz, Jay Woodmansee:
**Zone skipping vs direct shipment of small orders: Integrating order processing and optimization.**467-475

- Zilla Sinuany-Stern, Hadar Yelin:
**Forecasting hardware resource requirements.**477-484

- Omar Ben-Ayed:
**Bilevel linear programming.**485-501

- Ching-Lai Hwang, Young-Jou Lai, Min-Der Ko:
**ISGP-II for multiobjective optimization with imprecise objective coefficients.**503-514

- Haïscam Abdallah, Raymond A. Marie:
**The uniformized power method for transient solutions of Markov processes.**515-526

- Choong Y. Lee:
**A cross decomposition algorithm for a multiproduct-multitype facility location problem.**527-540

- Noel Bryson:
**A parametric programming methodology to solve the lagrangian dual for network problems with multiple side-constraints.**541-552

- Jeffrey L. Arthur, James O. Frendewey:
**GENGUB: A generator for linear programs with generalized upper bound constraints.**565-573

- Gregory Levitin, Jacob Rubinovitz:
**Genetic algorithm for linear and cyclic assignment problem.**575-586

- Klaus Jansen:
**Scheduling with constrained processor allocation for interval orders.**587-595

- Vitaly A. Strusevich:
**Two machine open shop scheduling problem with setup, processing and removal times separated.**597-611

- Kenneth R. MacLeod, Gary R. Reeves:
**AXIS: A framework for interactively combining structured algorithms and knowledge based systems.**613-623

- Chang-ho Lee, Hyung-bong Ro, Dong-wan Tcha:
**Topological design of a two-level network with ring-star configuration.**625-637

- Billy M. Maloney, Cerry M. Klein:
**Constrained multi-item inventory systems: An implicit approach.**639-649

- Tsunemi Watanabe, Hugh Ellis:
**Stochastic programming models for air quality management.**651-663

- V. H. Furth, B. Rietveld:
**Spoke contour conversion for coverage diagrams.**665-678

- Marc J. Schniederjans, Thomas S. Zorn, Robert R. Johnson:
**Allocating total wealth: A goal programming approach.**679-685

- Marius Sinclair:
**Comparison of the performance of modern heuristics for combinatorial optimization on real data.**687-695

- Ching-Jong Liao:
**Tradeoff between setup times and carrying costs for finished items.**697-705

- Frank Werner:
**On the heuristic solution of the permutation flow shop problem by path algorithms.**707-722

- Ami Arbel:
**An interior multiobjective linear programming algorithm.**723-735

- Christian Foisy, Jean-Yves Potvin:
**Implementing an insertion heuristic for vehicle routing on parallel hardware.**737-745

- Gary R. Reeves, Scott R. Hedin:
**A generalized interactive goal programming procedure.**747-753

- Radhika Santhanam, Marc J. Schniederjans:
**A model formulation system for information system project selection.**755-767

- Venkat Subramanian, Ming S. Hung, Michael Y. Hu:
**An experimental evaluation of neural networks for classification.**769-782

- Véronique Lambert, Gilbert Laporte, François V. Louveaux:
**Designing collection routes through bank branches.**783-791

- P. Patrick Wang:
**An**793-805*M*/*M*/*c*type of queueing model with (*R*_{i},*r*_{i}) switch-over policy.

- Lei Lei:
**Determining the optimal starting times in a cyclic schedule with a given route.**807-816

- Donald Gross, Bingchang Gu, Richard M. Soland:
**Iterative solution methods for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems.**817-828

- Andrzej Bargiela, Joanna K. Hartley:
**Orthogonal linear regression algorithm based on augmented matrix formulation.**829-836

- Sabah U. Randhawa, Darwin Sitompul:
**A heuristic-based computerized nurse scheduling system.**837-844

- Raul San Martin, John P. Knight:
**Operations research in the high-level synthesis of integrated circuits.**845-856

- David F. Rogers, Robert D. Plante:
**Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques.**857-877

- Qiwen Wang, Xiaoyun Sun, Bruce L. Golden, Lenore Desilets, Edward A. Wasil, Scott Luco, Adam Peck:
**A neural network model for the wire bonding process.**879-888

- Ching-Lai Hwang, Young-Jou Lai, Ting-Yun Liu:
**A new approach for multiple objective decision making.**889-899