Back Matter

Back MatterSource: Operations Research, Vol. 36, No. 4 (Jul. - Aug., 1988), pp. 638-645Published by: INFORMSStable URL: http://www.jstor.org/stable/171142 .

Accessed: 09/05/2014 12:00

Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at .http://www.jstor.org/page/info/about/policies/terms.jsp

.JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range ofcontent in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new formsof scholarship. For more information about JSTOR, please contact [email protected].

.

INFORMS is collaborating with JSTOR to digitize, preserve and extend access to Operations Research.

http://www.jstor.org

This content downloaded from 194.29.185.62 on Fri, 9 May 2014 12:00:26 PMAll use subject to JSTOR Terms and Conditions

http://www.jstor.org/action/showPublisher?publisherCode=informs

http://www.jstor.org/stable/171142?origin=JSTOR-pdf

http://www.jstor.org/page/info/about/policies/terms.jsp


0"'

Tomasz Bielecki is with the Institute of Econometrics, The Main College of Planning and Statistics, Warsaw, Poland. Currently he is working on problems relating to applications of stochastic differential systems.

Robert L. Bulfin, see Chang Yung Liu.

Clark Bullard is Associate Professor of Mechanical Engineering and Director of the Office of Energy Research at the University of Illinois. His research focuses on tracking parametric uncertainties through large simulation and optimization problems. Richard Engelbrecht-Wiggans is Associate Professor of Busi- ness Administration at the University of Illinois. His research focuses on noncooperative game theory. Their paper reports how the choice of an appropriately defined game theoretic solution concept combined with an appropriate regard for known certainties in the input data yields a computationally tractable approach to a practical problem.

Kalyan Chatterjee is Professor of Management Sci- ence and Larry Samuelson is Professor of Economics at Penn State University. The work reported in this paper is part of a continuing program of research in noncooperative bargaining and negotiation under incomplete information. This paper generalizes an earl- ier study by the authors published in the Review of Economic Studies. The research was undertaken with the help of financial support from NSF and will pro- ceed with the assistance of the Center for Negotiation and Conflict Research recently established at Penn State by the William and Flora Hewlett Foundation. In addition to further theoretical work, the authors hope to explore their results experimentally and im- plement them in applications.

The Committee on the Next Decade in Operations Research (CONDOR) was composed of the following individuals; their respective affiliations are also provided. Allen R. Stubberud, Director, Division of Elec- trical, Communications and Systems Engineering; and Michael P. Polis, Director, Systems Theory and Op- erations Research represented the National Science Foundation. Members of the organizing committee include: Saul I. Gass, University of Maryland; Donald Gross, George Washington University; George L. Nemhauser, Georgia Institute of Technology; and Stephen M. Pollock, University of Michigan. In addition, workshop participants included: Earl Barnes,

IBM Thomas J. Watson Research Center; John J. Bartholdi III, Georgia Institute of Technology; Lawrence D. Burns, General Motors Research Labs; Marshall L. Fisher, University of Pennsylvania; Peter W. Glynn, University of Wisconsin at Mad- ison; Alan J. Goldman, Johns Hopkins University; Carl M. Harris, George Mason University; Karla L. Hoffman, George Mason University; Darwin Klingman, University of Texas at Austin; Richard C. Larson, Massachusetts Institute of Technology; Thomas L. Magnanti, Massachusetts Institute of Technology; Charles J. McCallum, Jr., AT&T Bell Laboratories; Alexander H. G. Rinnooy Kan, Erasmus Universiteit, Rotterdam; Richard M. Soland, George Washington University; Rajan Suri, University of Wisconsin at Madison; Arthur F. Veinott, Jr., Stan- ford University; Andrew B. Whinston, Purdue Uni- versity; Chelsea C. White III, University of Virginia; Douglas J. White, University of Virginia; and Paul H. Zipkin, Columbia University.

Gregory Dobson is Associate Professor of Operations Management and Operations Research at the William E. Simon Graduate School of Business Administra- tion, University of Rochester. His main research interests are in manufacturing management, especially production scheduling. The current paper on the sensitivity of the EOQ model to parameter estimates came about from the author's attempt to understand this phenomenon better for a class presentation. Students naturally ask questions on how well a model will work when the data may not be accurate and this paper responds to this question quantitatively. The work demonstrates that accurate estimates of the parame- ters of the problem are not as crucial as one might expect a prior.

Richard Engelbrecht-Wiggans, see Clark Bullard.

Carl M. Harris is Chairman and Professor in the Department of Operations Research and Applied Statistics at George Mason University; William G. Marchal is Professor in the Department of Informa- tion Systems and Operations Management at the Uni- versity of Toledo. Their interest in server vacation queueing problems arose from a concern for models of complex local area computer and communication networks. Follow-on research on the optimal choice of vacation policies has been completed and should appear in print shortly after this publication.

638



Contributors / 639

Sabine K. Hipp is Systems Engineer and Ulrich D. Holzbaur is a mathematician and Manager of the Airborne Radar Data Processing Group at AEG's Radio and Radar Systems Division in Ulm, West Germany. Prior to this affiliation, Dr. Holzbaur was an assistant professor in the Operations Research De- partment of the University of Ulm, where the authors both worked in the field of stochastic dynamic optimization. This paper was derived from Hipp's di- ploma thesis at the University of Ulm wherein several interesting results for decision processes in queueing systems were obtained. Dr. Holzbaur's current research interests include the structure of optimal policies, optimization under uncertainties, expert systems, and the modeling of complex systems.

Ulrich D. Holzbaur, see Sabine K. Hipp.

Anjani Jain is an assistant professor at The Wharton School of the University of Pennsylvania. His current interests include probabilistic analysis of combinatorial optimization problems, and recently, he has worked on the Steiner problem in networks and the set packing problem.

P. R. Kumar is Professor of Electrical and Computer Engineering and Director of the Decision and Control Laboratory at the University of Illinois. Currently, he is working on a theory for stable, distributed real-time scheduling of manufacturing systems. This entails studying the role of dynamics and feedback in manufacturing systems. In addition to manufacturing systems, his current research interests include adaptive control, simulated annealing for optimization, stochastic systems, and neural networks.

Chang Yung Liu is the Chairman of the Department of Business at the National Sun Yat-Sen University in Taiwan. Robert L. Bulfin is Associate Professor of Industrial Engineering at Auburn University. The authors were motivated to study open shop scheduling problems by the apparent difficulty in solving these notorious combinatorial problems. They have been investigating open shop scheduling problems for several years, and examples of their results are found in "On the Complexity of Preemptive Open-Shop Sched- uling Problems," Operations Research Letters, Vol. 4, No. 2, 71-74, and "Scheduling Ordered Open Shops," Computers and Operations Research, Vol. 14, No. 3, 257-264.

John Mamer is an associate professor at the Anderson Graduate School of Management at UCLA. His current research interests include random combinatorics, stochastic inventory systems, and game theory.

William G. Marchal, see Carl M. Harris.

Suleyman Ozekici is an associate professor in the Department of Industrial Engineering at Bogazici University, Istanbul, Turkey. His research interests usually center around the application of stochastic processes in operations research and management science. In recent years, he has been active in the reliability and maintenance field, and his article is an outcome of a more general research effort on the stochastic modeling and analysis of complex systems with multiple components.

Larry Samuelson, see Kalyan Chatterjee.

Ross D. Shachter is returning this fall to his position as an assistant professor in the Department of Engineering-Economic Systems at Stanford Univer- sity. He has been visiting for the past two years at the Center for Health Policy Research and Education at Duke University where he has been applying his work on influence diagrams and probabilistic inference toward a general approach to the assessment of health technologies. He and his students have extended the results in the article to linear quadratic Gaussian and dynamic problems, and his ongoing research involves the development of probabilistic reasoning tools in expert systems. He has incorporated many of the results from the article into DAVID, an influence diagram processing system for the Macintosh.

J. George Shanthikumar is Professor of Management Science, University of California, Berkeley. His interest in queueing systems with server vacations started when he was working on job shop systems that cater to primary and secondary job orders (as a part of his Ph.D. thesis on "Approximate Queueing Models of Dynamic Job Shops," 1979, University of Toronto). The server is seen to be on vacation by the primary jobs when it is serving the secondary jobs. The interest in the decomposition property of such queueing systems is generated by the works of Fuhrmann and Cooper and by that of Doshi. A related paper that deals with stochastic decomposition in G/G/I queues (co-authored with Ushio Sumita) is "Modified Lindley Process with Replacement: Dynamic Behavior, Asymptotic Decomposition and Applications," sched- uled to appear in Advances in Applied Probability.



The Editorial Board would like to thank the following individuals who have acted as referees for papers considered or published during the 1987 calendar year. Without their assistance it would be impossible for the Society to publish a journal of high professional standards.

A

R. Abella, Carnegie-Mellon University R. A. Abrams, University of Illinois, Chicago W. P. Adams, Clemson University I. Adiri, Technion-Israel Institute of Technology P. Afentakis, Syracuse University J. Ahmadi, University of Texas, Austin C. H. Aikens, University of Tennessee M. Akgul, North Carolina State University J. Alamzad, American Airlines, Dallas, Texas S. L. Albin, Rutgers University S. C. Albright, Indiana University A. A. Aldrich, Jr., Dewey Square Investors, Boston,

Massachusetts C. J. Ancker, Jr., University of Southern California R. W. Andrews, University of Michigan Y. P. Aneja, University of Windsor S. Anily, University of British Columbia K. M. Anstreicher, Yale University E. M. Arkin, Cornell University A. A. Assad, University of Maryland D. Assaf, Hebrew University, Jerusalem

B

U. Bagchi, University of Texas, Austin E. K. Baker, University of Miami T. E. Baker, Numetrix Decision Sciences, Berkeley

Heights, New Jersey A. Balakrishnan, Purdue University E. Balas, Carnegie-Mellon University J. M. Banks, Georgia Institute of Technology J. F. Bard, University of Texas, Austin A. I. Barnett, Massachusetts Institute of Technology J. J. Bartholdi III, Georgia Institute of Technology J. Bather, University of Sussex J. C. Bean, University of Michigan L. Beard, Center for Naval Analyses, Alexandria,

Virginia D. E. Bell, Harvard University I. Bernhardt, University of Waterloo B. Betro, Universita di Milano, Italy F. Beutler, University of Michigan S. Biddle, Institute for Defense Analyses, Alexandria

Virginia D. Bienstock, Bell Communications Research,

Morristown, New Jersey J. R. Birge, University of Michigan

G. R. Bitran, Massachusetts Institute of Technology R. E. Bohn, Harvard University M. Bouakiz, Francis Marion College A. Brandenburger, Harvard University H. Braun, Electric Power Research Institute, Palo Alto,

California J. R. Brown, Kent State University S. S. Brown, General Electric, Philadelphia,

Pennsylvania D. M. Buede, Decision Logistics, Reston, Virginia R. M. Burton, Duke University D. A. Butler, Oregon State University J. A. Buzacott, University of Waterloo

C

D. Caldwell, University of Santa Clara M. Caramanis, Boston University J. Carlier, Universit6 de Compiegne, France R. L. Carraway, University of Virginia J. A. Carson, Carson/Banks & Associates, Atlanta,

Georgia M. W. Carter, University of Toronto T. M. Cavalier, Pennsylvania State University F. Cellier, University of Arizona J. M. Chaiken, ABT Associates, Inc., Cambridge,

Massachusetts P. Chambers, Boston College S. Chand, Purdue University C. Charalambous, Kuwait University, Kuwait S. S. Chiu, Stanford University S. Chu, West Virginia University G. M. Clark, Ohio State University R. T. Clemen, University of Oregon M. S. Cohen, Decision Science Consortium, Inc.,

Reston, Virginia C. Colbourn, University of Waterloo M. Conforti, New York University B. Conolly, Queen Mary College, University of London A. E. Conway, GTE Laboratories, Waltham,

Massachusetts T. M. Cook, American Airlines, Dallas, Texas T. Corwin, Metron, Inc., McLean, Virginia W. Cosgrove, University of Colorado P. C. Cramton, Yale University W. H. Cunningham, Carleton University, Ottawa,

Canada J. Czyzowicz, University of Quebec, Hull, Canada

Operations Research 0030-364X/88/3604-0640 $01.25 Vol. 36, No. 4, July-August 1988 640 ? 1988 Operations Research Society of America



Appreciation to 1987 Referees / 641

D

C. F. Daganzo, University of California, Berkeley S. Dasu, Massachusetts Institute of Technology R. Dattero, Bentley College M. de Carvalho, University of California, Berkeley E. Dekel, University of California, Berkeley A. P. Dempster, Harvard University M. A. H. Dempster, Dalhousie University, Halifax,

Canada C. Dert, Eramus University, Rotterdam,

The Netherlands M. Desrochers, University of Montreal J. Desrosiers, University of Montreal L. Devroye, McGill University A. S. Dhebar, Harvard University B. Dismukes, Center for Naval Analyses,

Alexandria, Virginia B. M. Dodin, University of California, Riverside D. Dyke, Dartmouth University

E

B. C. Eaves, Stanford University J. H. Ellis, John Hopkins University W. England, University of Wisconsin E. Erkut, University of Alberta R. Ernst, Georgetown University G. W. Evans, University of Louisville J. R. Evans, University of Cincinnati

F

P. H. Farquhar, Carnegie-Mellon University A. Federgruen, Columbia University G. Feichtinger, Technische Universitat, Austria R. M. Feldman, Texas A&M University J. Ferreira, Jr., Massachusetts Institute of

Technology M. B. Fiering, Harvard University J. A. Filar, University of Maryland C. H. Fine, Massachusetts Institute of Technology T. L. Fine, Cornell University R. D. Foley, Georgia Institute of Technology R. Fourer, Northwestern University B. L. Fox, University of Montreal S. French, University of Manchester, England J. 0. Frendewey, Virginia Polytechnic Institute and

State University R. M. Freund, Massachusetts Institute of Technology E. Frostig, Haifa University, Israel

G

H. N. Gabow, University of Colorado A. V. Gafarian, University of Southern California R. Garfinkel, University of Connecticut S. I. Gass, University of Maryland G. Gassman, University of British Columbia

D. P. Gaver, Naval Postgraduate School B. Gavish, University of Rochester L. F. Gelders, Catholic University of Leuven, Belgium S. B. Gershwin, Massachusetts Institute of Technology W. D. Geyer, Universtaet Erlangen-Nuernberg, Federal

Republic of Germany A. Ghosh, New York University E. N. Gilbert, AT&T Bell Laboratories, Murray Hill,

New Jersey P. W. Glynn, Stanford University A. A. Goett, Cambridge Systematics, Inc., Berkeley,

California A. V. Goldberg, Stanford University B. L. Golden, University of Maryland T. F. Gonzalez, University of California, Santa Barbara I. J. Good, Virginia Polytechnic Institute and State

University N. Gould, Harwell Laboratory, Oxfordshire, England A. Goyel, IBM D. Granot, University of British Columbia W. K. Grassmann, University of Saskatchewan S. C. Graves, Massachusetts Institute of Technology L. Green, Columbia University W. Greene, New York University H. Groenevelt, University of Rochester H. Groflin, ETH, Zurich, Switzerland M. Grotschel, University of Augsburg, Federal

Republic of Germany R. M. Gupta, GMI Engineenng and Management

Institute, Flint, Michigan

H

P. Haas, IBM R. W. Haessler, University of Michigan A. E. Haghani, University of Pittsburgh J. N. Hagstrom, University of Illinois, Chicago B. Hajek, University of Illinois, Urbana S. L. Hakimi, University of California, David S. Halfin, Bell Communications Research, Morristown,

New Jersey L. Hall, Massachuetts Institute of Technology N. G. Hall, Ohio State University H. Hamacher, University of Florida G. Handler, Tel Aviv University, Israel P. Hansen, Rutgers University J. Hao, Columbia University M. Hariga, Cornell University P. T. Harker, University of Pennsylvania J. M. Harrison, Stanford University T. P. Harrison, Pennsylvania State University M. Haviv, University of British Columbia D. Heath, Cornell University R. V. Helgason, Southern Methodist University R. L. Helmbold, U.S. Army Concepts Analysis Agency,

Bethesda, Maryland M. Henig, Tel Aviv University, Israel



642 / Appreciation to 1987 Referees

D. S. Hochbaum, University of California, Berkeley M. J. Hodgson, University of Alberta K. Holmberg, Linkoping, Sweden W. T. Hood, GPU Service Corporation, Parsippany,

New Jersey J. A. Hoogeveen, Centre for Mathematics and

Computer Science, Amsterdam, The Netherlands

J. N. Hooker, Carnegie-Mellon University D. S. P. Hopkins, Stanford University W. J. Hopp, Northwestern University A. Hordijk, University of Leiden, The Netherlands J. Horen, AT&T, Basking Ridge, New Jersey I. Horowitz, University of Florida R. Horst, Universitaet Trier, Federal Republic

of Germany E. C. Houck, Virginia Polytechnic Institute and State

University Y. Hsiau, University of Texas, Austin L. F. Hsu, Baruch College W. L. Hsu, Northwestern University M. S. Hung, Kent State University A. B. Huseby, University of Oslo, Norway

J

P. Jackson, Cornell University P. A. Jacobs, Naval Postgraduate School M. A. Jafari, Syracuse University G. Jahn, Indiana University 0. Janssens, CORE, Louvain-la-Neuve, Belgium E. T. Jaynes, Washington University T. R. Jefferson, University of California, Irvine R. G. Jeroslow, Georgia Institute of Technology K. Y. Jo, George Mason University R. S. John, University of Southern California M. Johnson, Los Alamos National Laboratory M. Juenger, Universitaet Augsburg, Federal Republic of

Germany

K

E. Kalai, Northwestern University L. C. Kallenberg, University of Leiden,

The Netherlands R. D. Kamenetzky, Aluminum Co. of America,

Davenport, Iowa K. Kang, University of Miami R. Kanna, Carnegie-Mellon University E. P. C. Kao, University of Houston E. H. Kaplan, Yale University E. Karni, Johns Hopkins University K. R. Karwan, Duke University M. H. Karwan, State University of New York, Buffalo L. Kaufman, AT&T Bell Laboratories, Murray Hill,

New Jersey J. Keilson, Massachusetts Institute of Technology W. D. Kelton, University of Minnesota

D. Kierstead, Daniel H. Wagner Associates, Inc., Vienna, Virginia

P. C. Kiessler, Virginia Commonwealth University M. Kijima, Tokyo Institute of Technology, Japan S. 0. Kimbrough, University of Pennsylvania G. A. P. Kindervater, Erasmus University, Rotterdam,

The Netherlands A. J. King, IIASA, Laxenburg, Austria A. King, University of British Columbia M. Klein, Columbia University P. R. Kleindorfer, University of Pennsylvania J. G. Klincewicz, AT&T Bell Laboratories, Holmdel,

New Jersey D. Klingman, University of Texas, Austin D. Koch, University of Michigan E. Koenigsberg, University of California, Berkeley A. W. J. Kolen, University of Limburg, Maastricht,

The Netherlands P. J. Kolesar, Columbia University G. J. Koop, Queen's College, Ontario P. J. Korhonen, Helsinki School of Economics, Finland K. 0. Kortnanek, University of Iowa A. Krieger, University of Pennsylvania V. G. Kulkarni, University of North Carolina A. Kumar, AT&T Bell Laboratories, Holmdel,

New Jersey A. Kusiak, University of Manitoba J. Kyparisis, Florida International University

L

M. Labbe, Erasmus University, Rotterdam, The Netherlands

R. Lal, California State University, Fullerton M. A. Langston, Washington State University R. C. Larson, Massachusetts Institute of Technology K. Laskey, Decision Science Consortium, Inc., Reston,

Virginia J. Lasserre, CNRS, Toulouse, France J. W. Lathrop, Strategic Decision Insights, Los Altos,

California I. H. La Valle, Tulane University S. Lawphongpanich, Naval Postgraduate School C.-Y. Lee, University of Florida H. L. Lee, Stanford University L. F. Lee, University of Minnesota S. B. Lee, University of South Korea T. Y. Leong, Massachusetts Institute of Technology J. Leung, Yale University H. Lewis, University of California, Berkeley L. Li, Massachusetts Institute of Technology J. D. C. Little, Massachusetts Institute of Technology J. J. Liu, University of Wisconsin, Milwaukee Z. Livne, Columbia University D. C. Llewellyn, Georgia Institute of Technology E. L. Lloyd, University of Pittsburgh G. Loomes, University of York, England




J. Loris-Teghem, Universit6 de L'Etat a Mons, Mons, Belgium

R. Loulou, McGill University J. J. Louviere, University of Alberta W. S. Lovejoy, Stanford University A. Lucena, CORE, Louvain-la-Neuve, Belgium H. Luss, AT&T Bell Laboratories, Murray Hill,

New Jersey

M

M. J. Magazine, University of Waterloo N. Majluf, Universidad Catolica de Chile, Santiago,

Chile S. Majumdar, University of Saskatchewan A. Makowski, University of Maryland D. M. Malon, State University of New York, Buffalo J. W. Mamer, University of California, Los Angeles M. Mangel, University of California, Davis B. Margolin, University of North Carolina C. U. Martel, University of California, Davis S. Martello, University of Bologna, Italy W. A. Massey, AT&T Bell Laboratories, Murray Hill,

New Jersey Y. Masuda, University of California, Riverside H. Matsuo, University of Texas, Austin W. L. Maxwell, Cornell University G. McClelland, University of Colorado R. D. McConnell, Management Consulting & Research,

Inc., Falls Church, Virginia S. T. McCormick, Columbia University P. F. McCoy, ANSER, Arlington, Virginia L. F. McGinnis, Georgia Institute of Technology A. Mehrez, Kent State University M. S. Meketon, AT&T Bell Laboratories, Murray Hill,

New Jersey M. L. Merkhofer, Applied Decision Analysis, Inc.,

Palo Alto, California C. Meyer, North Carolina State University W. Michalowski, Carleton University, Canada D. R. Miller, George Washington University D. L. Minh, California State University, Fullerton M. Minoux, Electricit6 de France P. B. Mirchandani, Rensselaer Polytechnic Institute J. C. Mitchell, Citibank, N.A., New York J. S. B. Mitchell, Cornell University R. H. Mohring, Hochschule Hildesheim, Federal

Republic of Germany K. Moinzadeh, University of Washington C. L. Monma, Bell Communications Research,

Morristown, New Jersey J. M. Mulvey, Princeton University B. S. Munson, AT&T Bell Laboratories, Holmdel,

New Jersey F. H. Murphy, Temple University W. C. Mylander, Jr., U.S. Naval Academy

N

K. Nair, University of New Brunswick H. Nakayama, Koran University, Japan R. Neavel, Exxon Research & Engineering, Baytown,

Texas B. Nelson, Ohio State University M. F. Neuts, University of Arizona C. E. Noon, University of Michigan A. Nozari, Salomon Brothers, New York

0

C. A. O'Cinneide, University of Arkansas A. R. Odoni, Massachusetts Institute of Technology K. Ohno, Nagoya Institute of Technology, Nagoya,

Japan I. Olkin, Stanford University G. Olsder, Technological University of Delft,

The Netherlands J. B. Orlin, Massachusetts Institute of Technology

P

S. Pallottino, University of Pisa, Italy R. G. Parker, Georgia Institute of Technology J. Perl, University of Maryland A. F. Perold, Harvard University M. L. Pinedo, Columbia University L. K. Platzman, Georgia Institute of Technology R. Plemmons, North Carolina State University P. Politser, Harvard University S. M. Pollock, University of Michigan E. L. Porteus, Stanford University M. E. Posner, Ohio State University M. J. Posner, University of Toronto C. N. Potts, University of Southampton S. Powell, London School of Economics J. Pratt, Harvard University A. A. B. Pritsker, Pritsker & Associates,

West Lafayette, Indiana A. Prodon, Ecole Polytechnique Federale de Lausanne,

Switzerland H. N. Psaraftis, Massachusetts Institute of Technology W. R. Pulleyblank, University of Waterloo

a

M. Queyranne, University of Houston

R

R. M. Rachamadugu, University of Michigan F. J. Radermacher, Universitaet Passau, Federal

Republic of Germany A. G. Rao, New York University B. M. Rao, AT&T Bell Laboratories, Holmdel,

New Jersey R. L. Rardin, Purdue University



644 / Appreciation to 1987 Referees

H. D. Ratliff, Georgia Institute of Technology W. D. Ray, University of London J. Reinganum, California Institute of Technology A. H. G. Rinnooy Kan, Erasmus University,

Rotterdam, The Netherlands J. S. Rogers, University of Toronto T. Rolski, University of Wrocaw, Poland D. Ronen, University of Missouri, St. Louis J. S. Rose, University of Richmond D. B. Rosenfileld, Arthur D. Little, Inc., Cambridge,

Massachusetts R. E. Rosenthal, Naval Postgraduate School M. Rosenwein, AT&T Bell Laboratories, Murray Hill,

New Jersey A. E. Roth, University of Pittsburgh U. G. Rothblum, Technion-Israel Institute of

Technology, Haifa, Israel M. H. Rothkopf, Lawrence Berkeley Laboratory,

Berkeley, California M. Rothstein, University of Connecticut R. 0. Roundy, Cornell University D. S. Rubin, University of North Carolina R. Y. Rubinstein, Technion-Israel Institute of

Technology R. A. Russell, University of Tulsa R. J. Ruth, General Motors Research Laboratories,

Warren, Michigan

S

G. Saad, Widener University T. L. Saaty, Pittsburgh, Pennsylvania H. M. Safer, Massachusetts Institute of Technology M. H. Safilzadeh, Wichita State University I. Sahin, University of Wisconsin, Milwaukee R. Saigal, University of Michigan S. Salant, Rochester University P. Sanchez, University of Arizona T. Sanders, U.S. Naval Academy R. G. Sargent, Syracuse University D. Sarkar, AT&T Bell Laboratories, Holmdel,

New Jersey M. Schal, University of Bonn, Federal Republic of

Germany W. T. Scherer, University of Virginia B. W. Schmeiser, Purdue University C. P. Schmidt, University of Alabama G. Schmidt, Technische Universitaet Berlin, Federal

Republic of Germany A. Schoenhage, Universitaet Tuebingen, Federal

Republic of Germany L. W. Schruben, Cornell University A. F. Seila, University of Georgia J. K. Sengupta, University of California, Santa Barbara L. D. Servi, GTE Laboratories, Waltham,

Massachusetts M. Shaked, University of Arizona

J. G. Shanthikumar, University of California, Berke J. F. Shapiro, Massachusetts Institute of Technolog~ G. S. Shedler, IBM Research, San Jose, California H. D. Sherali, Virginia Polytechnic Institute and Stc

University C. Sherbrooke, Potomac, Maryland H. D. Sherman, Northeastern University T. Sheskin, Cleveland State University C. M. Shetty, Georgia Institute of Technology D. R. Shier, Clemson University D. B. Shmoys, Massachusetts Institute of Technolog A. W. Shogan, University of California, Berkeley A. Sicherman, Woodward-Clyde Consultants,

Walnut Creek, California J. B. Sidney, University of Ottawa E. Silverberg, AT&T Bell Laboratories, Holmdel,

New Jersey S. H. Sim, Ontario Hydro Research, Toronto, Cana D. Simchi-Levi, Columbia University B. B. Simons, IBM Almaden Research Center, San. R. Slowski, Politechnika Poznanska, Poland B. C. Smith, American Airlines, Dallas, Texas D. H. Smith, Polytechnic of Wales, United Kingdor J. Smith, University of Warwick, Coventry, Englanc R. H. Smith, AT&T Bell Laboratories, Holmdel,

New Jersey R. L. Smith, University of Michigan V. L. Smith-Daniels, Arizona State University M. Sniedovich, CSIR, Pretoria, South Africa M. J. Sobel, State University of New York,

Stony Brook M. M. Solomon, Northeastern University E. J. Sondik, National Cancer Institute, Bethesda,

Maryland K. Srikanth, University of Rochester P. A. Stephens, American Airlines, Dallas, Texas W. Stewart, North Carolina State University W. R. Stewart, College of William and Mary S. Stidham, University of North Carolina L. D. Stone, Metron, Inc., McLean, Virginia R. Suri, University of Wisconsin J. J. Swain, Georgia Institute of Technology

T

M. R. Taaffe, Purdue University P. R. Tadikamalla, University of Pittsburgh G. Tagaras, University of Pennsylvania M. I. Taksar, Florida State University M. Tamaki, Aichi University, Aichi, Japan H. Tamule, Suffolk University C. S. Tang, University of California, Los Angeles C. S. Tapiero, Hebrew University, Jerusalem, Israel M. S. Taqqu, Boston College L. D. Taylor, University of Arizona S. G. Taylor, University of Wyoming




N. Temme, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands

J. Templeton, University of Toronto H. Theil, University of Florida C. J. Thomas, Department of the Air Force,

Washington, DC L. C. Thomas, University of Edinburgh, Scotland P. M. Thompson, Massachusetts Institute of

Technology R. G. Thompson, University of Houston H. Thorisson, University of Goteborg, Goteborg,

Sweden H. Tijms, Free University, Amsterdam,

The Netherlands J. A. Tomlin, IBM Almaden Research Center, San Jose P. Toth, University of Bologna, Italy W. W. Trigeiro, Systems and Technology Research

V

G. Van der Hoek, Erasmus University, Rotterdam, The Netherlands

J. Van der Wal, Eindhoven University of Technology, The Netherlands

N. Van Dijk, Free University, Amsterdam, The Netherlands

M. H. Van Hoorn, Volmac Networks, Amsterdam, The Netherlands

T. J. Van Roy, Catholic University of Leuven, Belgium N. Van Thoai, Erasmus University, Rotterdam,

The Netherlands M. Van Veldhuizen, Free University, Amsterdam,

The Netherlands L. Van Wassenhove, Catholic University of Leuven,

Belgium P. Velleman, Arizona State University R. G. Vickson, University of Waterloo R. Vohra, Ohio State University B. von Stengel, University of Passau, Federal Republic

of Germany 0. J. Vrieze, University of Limburg, The Netherlands

W

J. Walrand, University of California, Berkeley A. Warburton, University of Ottawa S. R. Watson, Cambridge University J. R. Weaver, University of Alabama I. R. Webb, Massachusetts Institute of Technology

R. R. Weber, University of Cambridge G. Weiss, Georgia Institute of Technology R. E. Wendell, University of Pittsburgh G. Weslowsky, McMaster University C. C. White, University of Virginia C. Whitney, Charles Stark Draper Lab., Inc.,

Cambridge, Massachusetts W. Whitt, AT&T Bell Laboratories, Murray Hill,

New Jersey C. Whittaker, Seattle University A. Wierzbicki, Institute for Applied Systems Analysis,

Laxenburg, Austria J. Wijngaard, Technical University Eindhoven,

The Netherlands S. Wilcox, General Research Corporation, McLean,

Virginia J. G. Wilson, Case Western Reserve University J. R. Wilson, Purdue University R. L. Winkler, Duke University W. L. Winston, Indiana University L. A. Wolsey, CORE, Louvain-la-Neuve, Belgium R. T. Wong, Purdue University R. K. Wood, Naval Postgraduate School G. P. Wright, Purdue University B. Wynne, Indiana State University

y

M. Yadin, Technion-Israel Institute of Technology C. A. Yano, University of Michigan D. D. Yao, Harvard University H. P. Young, University of Maryland C. S. Yu, AT&T Bell Laboratories, Holmdel,

New Jersey 0. Yu, Electric Power Research Institute, Palo Alto,

California

z I. Zang, Tel Aviv University, Israel W. I. Zangwill, University of Chicago M. Zazanis, Northwestern University E. Zemel, Northwestern University S. A. Zenios, University of Pennsylvania H. J. Zimmermann, Technische Universitaet, Aachen,

Federal Republic of Germany S. Zionts, State University of New York, Buffalo P. H. Zipkin, Columbia University K. G. Zografos, University of Miami



* A * A I. A

Operations Research publishes quality operations research and management science work of interest to the OR practitioner and researcher in three substantive categories: operations research methods, data based opera- tional science, and the practice of OR. The Journal seeks papers reporting underlying data-based principles of op- erational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discus- sions of the administrative environment, the history, policy, practice, future, and arenas of application of operations research.

Complete studies that contain data, computer experiments, and model validation, and that integrate the theory, methods, and applications are of particular interest. Thus, we encourage case studies of lasting value. Con- tributors should submit informal descriptions of cases to the joint ORSA/TIMS publication Interfaces.

A TECHNICAL NOTES section contains brief articles on all of the topics covered by the Journal. An OR PRACTICE section contains practitioner-oriented applications, tuto- rials, and surveys. Application papers whose utility is as yet undemonstrated in practice or that are not tailored for practitioners should be submitted to the appropriate

contextual Area Editor. An OR FORUM section publishes papers on history, policy, analyses of current and future trends, and related subject matter. For more information on subject coverage and editorial policy, see the editorials and Area Editor statements published in the January- February issues of both 1983 and 1984.

All papers published in Operations Research are refer- eed. Initial refereeing of clear, concise, well-written papers normally takes about four months for papers of average length; generally a shorter time for notes. - Decisions on manuscripts for publication in Opera-

tions Research will be based, in part, on the answers to such questions as: Does this paper make a new and substantial contribution to the literature of operations research? Will it be of interest to a significant group of OR workers? Does the paper give sufficient introductory and summary material to inform readers of the content, importance, and possible fields of application of the material covered? Is it clearly, concisely, accurately and logically written? Could it benefit from condensation or expansion? Is its character clear from title, abstract and text? Does the paper describe its relation to previously published work, and does it give adequate credit and references to this work?

INSTRUCTIONS FOR CONTRIBUTORS

Authors should submit four copies of manuscripts di- rectly to the appropriate Area Editor. Papers not in the fields covered by the Area Editors should be sent to

H. Donald Ratliff, Editor Georgia Institute of Technology School of Industrial and Systems Engineering Atlanta, GA 30332.

Papers should not be sent to the Associate Editors.

Submission of a manuscript is a representation that the paper has neither been published nor submitted for publication elsewhere, and that, if the work is officially sponsored, it has been released for open publication. The manuscript should be accompanied by a Copyright Transfer Agreement from the authors (or their employ- ers-whoever holds the copyright) transferring the copyright to ORSA. The form for this agreement is printed in most issues of this journal and is also available from the Editor and the Executive Director of ORSA. This written transfer of copyright, which previously was assumed to

be implicit in the act of submitting a manuscript, is necessary under the 1978 U.S. Copyright Law in order for ORSA to continue disseminating operations research results as widely as possible.

Copies of a manuscript will not be returned to an author unless specifically requested, or unless reviewers have provided annotations that will be of use to the author.

Observe the following points in preparing manuscripts (manuscripts not conforming closely to these instructions will be returned to their authors for appropriate revisions):

1. Readability. The abstract and the introduction of every paper must be free of unnecessary jargon and clearly readable by any ORSA member. The abstract should be self-contained, summarize the problem, principal results and conclusions; it should not contain formulas or references or exceed 200 words. The introduction must clearly state the problem, the results to be found in the paper and their significance to the operations research community. The introduction does not have a section heading. The main sections of the paper must be



readable, the level of mathematics and/or terminology appropriate to the topic, and the material logically presented.

2. Style. The message of your paper will be enhanced if it is presented in active, forceful, and concise prose. Since good writing is a craft at least as difficult as doing operations research, before beginning your paper you will be well advised to refresh your acquaintance with the most important points of good style by spending some time with a source of good editorial advice, such as Writing a Technical Paper by Donald H. Menzel, How- ard Mumford Jones, and Lyle G. Boyd (New York: McGraw-Hill 1961). While the Editor and staff will cor- rect minor lapses from good style in your manuscript, they cannot undertake wholesale revisions of poorly written papers. It is a good idea to write more than one draft of your manuscript, and to have an early draft reviewed by someone who can give you effective advice on style. There is no a priori limit to the number of pages for a paper; however, conciseness and clarity of presentation are important publication criteria.

3. Spacing and Format. Double space manuscripts throughout (including the abstract, subsidiary matter and references) with the original in typewritten form. No line- printed computer printouts will be considered for publication. Put subsidiary matter on separate sheets (see Figures and Tables below). The introduction does not have a section heading; begin numbering with the main sections.

4. Footnotes. Operations Research does not use footnotes in the text; incorporate subsidiary material that would otherwise appear in footnotes in the main text (possibly in parentheses or brackets), or place it in a section at the end of the text. In particular, place the usual acknowledgments of presentation, support, and assistance in such a final section.

5. References. List only those references that are cited in the text. References in the text should be cited by the author's surname and the year of publication-for example, Flood (1962). If the reference has two or three authors, cite all of the authors' surnames and the year of publication-Flood, Smith and Jones (1982). If the reference has more than three authors, cite the first author's surname followed by et al. and the year of publication- Brown et al. (1985). If there is more than one reference by the same author with the same year of publication, the first citation appearing in the text would read Flood (1962a), the second citation would read Flood (1962b), etc. Do not use parentheses or brackets for dates when the citation is already enclosed within parentheses. At the end of the paper list references alphabetically by the surname of the first author. Do not number the reference list.

For journal references, give the author, year of publication, title, journal name, volume, and pages-for example,

FLOOD, M. M. 1962. New Operations Research Potentials. Opns. Res. 10, 423-436.

For book references, give the author, year of publication,

title, publisher, city, and state-for example,

MORSE, P. M., AND G. E. KIMBALL. 195 1. Methods of Operations Research. Technology Press of MIT and John Wiley, Cambridge, Mass. and New York.

6. Mathematical Expressions. Within the text, use the solidus whenever possible in preference to built-up

fractions, e.g., a/(1 - b) rather than a

; write com-

plicated exponentials in the form exp ( ); avoid subscripts or superscripts on subscripts or superscripts; and, in general, minimize unusual typographical requirements. For displayed equations, use built-up fractions. Avoid lengthy equations that will take several lines to typeset (possibly by defining terms of the equations in separate displays). Make subscripts and superscripts large and clear. On first occurrence label unusual or ambiguous symbols; for example, distinguish the letter "oh" from the numeral "zero." The difference between upper and lower case letters should be clear. Display only those mathematical expressions that must be numbered for later reference or need to be emphasized. Put numbers at the right of the mathematical expressions.

7. Figures and Tables. Draw figures in black ink on white paper in a form suitable for photographic reproduction. Make lettering of uniform size and sufficiently large to be legible when the figure is reduced to final size; use a sans serif typeface whenever possible. Send originals of typed tables suitable for photographic reproduction. Designate figures by arabic numbers, designate tables by roman numerals, and type the legends for the figures and tables on a single separate sheet rather than placing them on the originals. Please proofread carefully since later changes can be made only by submitting new originals.

8. Reporting Computational Experience. In reporting computational experience on the efficiency of algorithms follow the guidelines given in Operations Research, Vol. 29, No. 2, "Reporting Computational Experience in Op- erations Research." Copies of these guidelines may be obtained from

Executive Director, ORSA Mount Royal and Guilford Avenues Baltimore, MD 21202

or from

H. Donald Ratliff, Editor Georgia Institute of Technology School of Industrial and Systems Engineering Atlanta, GA 30332

9. Abstract and Introduction. Preface each article with a self-contained abstract that summarizes the problem and the principal results and conclusions. The abstract should not contain formulas or references and should not exceed 200 words. The abstract and introductory material should be written in an expository style that will be comprehensible to readers who are not technical



experts in the subject matter. The introduction does not have a section heading.

10. Subject Classification Scheme for the OR/MS Index. Determine the appropriate subject classification(s) and accompanying descriptive phrase(s) for all work submitted. A complete list of subject categories appears at the back of most issues; be sure to refer to the revised scheme as it appears in Volume 36, No. I (January- February 1988) and in subsequent volumes. Each subject category is indicated by a specific listing. Choose from one to three subject categories for each manuscript. For every category chosen, write a short phrase that puts the paper in context. (The phrase can be a concise rendering of the title, or it may specify some aspect of the paper that is important but not apparent in the title.) The total length of each phrase, including spaces and punctuation, should not exceed 60 characters. This information will be printed on the title page of every article, technical note, and letter that is published. Subject categories/ phrases must either appear on the title page of the manuscript (this is the preferred method), or else authors can use the form provided (see the bottom half of the Copy- right Transfer Agreement form)-for example:

A paper entitled "Cost Effectiveness in Urban Trans- portation" might be classified under two subject categories: "Cost analysis" and "Transportation, costs." On the Subject Classification form, the categories and accompanying phrases might be listed as:

Cost analysis: urban transportation Transportation, costs: cost effectiveness in urban trans-

portation. Do not repeat the subject classifications (e.g., "cost analysis" or "transportation, costs") from the subject categories. The accompanying phrase should help to further clarify the paper within the subject category.

11. Reprints. Operations Research does not have page charges, nor does it supply free reprints. Authors of

accepted articles may order reprints at reasonable rates at the time they submit their corrected galley proofs. Reprints of individual articles are not available from ORSA.

Reproduction of Journal Articles

1. Permission is granted to quote from this Journal in scientific works with the customary acknowledgment of the source. The reprinting of a figure, table or an excerpt requires the consent of one of the original authors and the notification of ORSA.

2. Reprinting of any article or a portion of an article beyond that permitted in Paragraph 1 requires written permission from the copyright holder (ORSA) and payment of an appropriate royalty. Reprinting requests should be directed to the ORSA Business Office and should contain the following details: author, title, volume, number, year, intended purpose or use of the article (book, journal, abstract, anthology, etc.) and estimated sale price of the work. Permission must first be obtained from the author(s) and be submitted to the Business Office with the request.

3. Libraries maintaining a "reserve list" are permitted to reproduce five copies of an article for this purpose. Additional copies are subject to the copying fee as covered in the 1978 U.S. Copyright Law as explained in the following paragraph.

4. Copying without fee is permitted provided that the copies are not made or distributed for direct commercial advantage and are distributed without charge beyond cost. Credit to the source should be given, and abstracting with credit is permitted. Other copying of articles is permitted provided that a per-copy fee is paid through the Copyright Clearance Center, Inc., 21 Congress Street, Salem, MA 01970, (617) 744-3350. For permission to republish, write to the ORSA Business Office. To copy otherwise, or to republish, requires a separate fee and/or specific permission.

Announcements should be sent to John Llewellyn Lionheart Publishing, Inc. 2555 Cumberland Parkway Atlanta, GA 30339

Books for Review should be sent to Professor Marion G. Sobol Book Review Editor, Interfaces Cox School of Business Southern Methodist University Dallas, TX 75275.



COPYRIGHT TRANSFER AGREEMENT

Copyright to the article entitled " .................................................................................

by ........................................................................................................... is hereby transferred to the Operations Research Society of America (ORSA) (for U.S. Government employees: to the extent transferable), effective if and when the article is accepted for publication in Operations Research. However, the authors reserve the following: (1) All proprietary rights other than copyright, such as patent rights. (2) The right to grant or refuse permission to third parties to republish all or part of the article or translations thereof. In the case of whole articles, such third parties must obtain ORSA's written permission as well. However, ORSA may grant rights with respect to journal issues as a whole. (3) The right to use all or part of this article in future works of their own, such as lectures, press releases, reviews, text books, or reprint books. In addition, the authors affirm that the above article has been neither copyrighted nor published, that it is not being submitted for publication elsewhere, and that, if the work is officially sponsored, it has been released for open publication.

To be signed by at least one of the authors (who agrees to inform the others, if any) or, in the case of a "work made for hire," by the employer.

SIGNATURE SIGNATURE

PRINT NAME PRINT NAME

TITLE, IF NOT AUTHOR TITLE, IF NOT AUTHOR

DATE DATE

This signed statement must be received by the Editor's office before a manuscript can be accepted for processing. Address requests for further information or exceptions to the Executive Director, ORSA, Mount Royal and Guilford Avenues, Baltimore, MD 21202.

SUBJECT CLASSIFICATION FOR THE OR/MS INDEX Classify manuscript under one, two, or three subject categories. A complete list of subject categories appears on adjacent pages in most issues of this journal. For every subject category chosen, write a short phrase that places the manuscript in its proper context within the subject category. The total length of each phrase, including spaces and punctuation, must not exceed 60 characters.

Example. A paper entitled "Cost-Effectiveness in Urban Transportation" might be classified under two subject categories: "Cost analysis" and "Transportation, costs." On this Subject Classification form the categories and accompanying phrases might be: cost analysis: urban transportation and transportation, costs: cost-effectiveness in urban transportation. Do not repeat the subject classification (e.g., cost analysis or transportation) from the subject categories. The descriptive phrase should further clarify the paper within the subject category.

SUBJECT DESCRIPTIVE

CATEGORY PHRASE

1.__________________________

2 . _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ __ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _



SUBJECT CLASSIFICATION SCHEME FOR THE OR/MS INDEX Please refer to the Copyright Transfer Agreement or to Operations Research Editorial Policy, Section 10, for instructions on choosing the appropriate categories and accompanying phrases for your paper.

Accounting Financial institutions Inventory/production Military Analysis of algorithms (continued) (continued) (continued)

Computational complexity Insurance Perishable/aging items Warfare models Data structures Investment Planning horizons Natural resources Suboptimal algorithms Forecasting Policies Energy

Communications Applications Disposal/issuing Land development Computers/computer ARIMA processes Maintenance/replacement Water resources

science Delphi technique Marketing/pricing Networks/graphs Artificial intelligence Regression Review/lead times Applications Data bases Time series Scale-diseconomies/smoothing Distance algorithms Microcomputers Games/group decisions Scale-diseconomies/lot-sizing Flow algorithms Software Bargaining Sensitivity analysis Generalized networks System design/operation Bidding/auctions Uncertainty Heuristics

Cost analysis Cooperative Deterministic Matehings Decision analysis Differential Stochastic Multicommodity

Applications Gambling Judicial/legal Stochastic Inference Nonatomic Crime Theory Multiple criteria Noncooperative Crime prevention Traveling salesman Risk Stochastic Law Tree algorithms Sequential Teams Penal system Organizational studies Systems Voting/committees Labor Behavior Theory Government Libraries Decision

Dynamic programming/ Agencies Manufacturing Deisigon making optimal control Defense Automated systems Effectiveness/perforgance

Applications Elections Performance/productivity Goals Deterministic Energy policies Strategy oas Markov Foreign policy Marketing Information

Finite state Programs Advertising and media Manpower planning Infinite state Regulations Buyer behavior Motivation/incentives

Models Services Channels of distribution Personnel SemiMarkov Tax policy Choice models Produetivity

Economics Health care Competitive strategy State-owned Econometrics Ambulance service Estimation/statistical Strategy Input-output analysis Blood bank techniques Strateg

Education systems Diagnosis Industrial marketing Structures Inutra Philosophy of modeling Operations Epidemiology International marketing Planning Planning Hospitals Marketing mix Community

Engineering Pharmaceutical Measurement Corporate Environment Treatment New products Corporate Facilities/equipment Industries Pricing Government

planning Agriculture/food Product policy Urban Capacity expansion Chemical Promotion Population Design Communications/journalism Retailing and wholesaling Family planning Layout Computer/electronic Salesforce Probability Location Electric Scaling methods Applications

Continuous Hotel/motel Segmentation Clearing processes Discrete Lumber/wood Mathematics Crossing problems Stochastic Machinery Combinatorics Diffusion

Maintenance/replacement Mining/metals Convexity Distribution comparisons Finance Petroleum/natural gas Functions Distributions

Asset pricing Pharmaceutical Fixed points Entropy Capital budgets Recreation/sports Piecewise linear Markov processes Capital rationing Real estate Matrices Random walk Corporate finance Textiles/apparel Sets Renewal processes Depreciation Transportation/shipping Systems solution Regenerative processes Investment Information systems Military Stochastic model Investment criteria Analysis and design Cost effectiveness applications Management Decision support systems Defense systems Production/scheduling Portfolio Expert systems Force effectiveness Applications Securities Management Logistics Approximations/heuristic Taxation Inventory/production Personnel Cutting stock/trim Working capital Applications Search/surveillance Flexible manufacturing/

Financial institutions Approximations/heuristics Stochastic duels line balancing Banks Multi-item/echelon/stage Tactics/strategy Learning Brokerage/trading Operating characteristics Targeting Planning



Production/scheduling Programming Reliability Transportation (continued) (continued) Availability Automobile

Sequencing Multiple criteria Coherent structures Costs Deterministic Nondifferentiable Failure models Freight/materials handling

Single machine Nonlinear Inspection Fuel Multiple machine Algorithms Life distributions Mass transit

Stochastic Applications Maintenance/repairs Models Professional Theory Multistate systems Assignment

Addresses Unconstrained Quality control Network Comments on Quadratic Redundancy/spares Location Humor/satire Stochastic Replacement/renewal Traffic Journal policies Project management System safety Safety/injuries Obituaries CPM Shock models Scheduling OR/MS education GERT Research and development Personnel OR/MS implementation PERT Innovation Vehicles OR/MS philosophy Resource constraints Project selection Taxis/limousines OR/MS policy/standards VERT Search and surveillance Travel

Programming Queues Simulation Mode/route choice Complementarity Algorithms Applications Vehicle routing Fractional Applications Design of experiments Utility/preference Geometric Approximations Efficiency Applications Infinite dimensional Balking and reneging Languages Estimation Integer Batch/bulk Random variable Multiattribute

Algorithms Birth-death generation Theory Benders/decomposition Busy period analysis Statistical analysis Value theory Branch-and-bound Cyclic System dynamics Cutting plane/facet Diffusion models Space program

generation Feedback Statistics Group Limit theorems Analysis of variance Heuristic Markovian Bayesian Relaxation/subgradient Multichannel Censoring

Applications Networks Cluster analysis Nonlinear Nonstationary Correlation Theory Optimization Data analysis

Interval Output process Design of experiments Linear Priority Estimation

Algorithms Simulation Nonparametric Applications Statistical inference Pattern analysis Large scale systems Tandem Sampling Parametric Transient results Time series Theory Recreation and sports Technology



Announcing A New Journa1... ORSA JOURNAL ON COMPUTING

Editor:

Dr. Harvey J. Greenberg, University of Colorado at Denver Mathematics Department, Campus Box 170

University of Colorado at Denver 1100 Fourteenth Street

Denver, Colorado 80202 USA telephone: (303) 556-8464

BITNET: HGREENBERG@CUDENVER.

Advisory Board:

Dr. Thomas L. Magnanti, Massachusetts Institute of Technology Dr. Gautam Mitra, Brunel University Dr. Anil Nerode, Cornell University Dr. Christos Papadimitriou, Stanford University Dr. William P. Pierskalla, University of Pennsylvania Dr. Andrew B. Whinston, Purdue University

The ORSA JOURNAL ON COMPUTING seeks to publish quality research results in the interfaces between operations research and computer science. Contributed papers must satisfy at least one of the following: (1) Operations research as applied to a computer science problem. (2) Computer science as applied to an operations research problem. (3) In- tegrated results involving both operations research and computer science. (4) Results from new areas that have the potential of advancing the interface of operations research and computer science. To submit a paper for possible publication, send four copies of your paper to the Editor. To subscribe to the journal complete the form below and mail to ORSA JOURNAL ON COMPUTING, ORSA Business Office, Mount Royal and Guilford Avenues, Baltimore, MD 21202 USA.

El YES, Enroll me as a charter subscriber to the ORSA JOURNAL ON COMPUTING today.

Check one: ORSA member ($20) ORSA student/retired member ($10)

nonmember ($30)* institution ($60)*

* Non-US subscribers please add $5.00 postage.

E Payment enclosed. El Please bill me.

El Please charge my: El VISA El Mastercard

Account # Expiration Date Signature

NAME

ADDRESS

CITY, STATE, ZIP_ 90060R



ASSOCIATE EDITORS

Egon Balas Peter Jackson Donald B. Rosenfield Carnegie-Mellon University Catholic University QfLeuven Arthur D. Little, Inc.

Karl Heinz Borgwardt Edward Kaplan Lee W. Schruben Universitaet Augsburg Yale University Cornell University

Michael Carter W David Kelton J. George Shanthikumar University of Toronto University of Minnesota University of California, Berkeey

Teodor Crainic C. M.s Shetty University of Quebec, Montreal Vijay Krishna Georgia Institute of Technology

Harvard Business School David B. Shmoys Greg Dobson Massachusetts Institute of University of Rochester Hau L. Lee MschutIsue

Peter H. Farquhar Stanford University Technology Carnegie-Mellon University Thomas M. Liebling Northeastern University

A. Federgruen Ecole Polytechnique Federale Ralph Steuer Columbia University de Lausanne UniversityofGeorgia

Robert D. Foley Hirofumi Matsuo Lawrence D. Stone Georgia Institute Qf Technology University of Texas at Austin Metron, Inc.

Robert Fourer Leon McGinnis Charles S. Tapiero Northwestern University Georgia Institute of Technology Hebrew University

Terry L. Friez University of Pennsylvania Douglas R. Miller Henk Tijms UniversityofPennsylvania George Washington University Vrije Universiteit

Yigal Gerchak Rolf H. Mohring Devanath Tirupati University of Waterloo

Technische Universitaet, Berlin University of Texas at Austin Stanley Gershwin Michael A. Trick

Massachusetts Institute of Henry Nuttle University of Minnesota Technology North Carolina State University Mark Turnquist

Donald Goldfarb Amedeo R. Odoni Cornell University Columbia University Massachusetts Institute of Alan R. Washburn

Alan J. Goldman Technology Naval Postgraduate School Johns Hopkins University Michael L. Pinedo Chelsea C. White III

Winfried K. Grassmann Columbia University University of Virginia University of Saskatchewan Stephen M. Pollock Laurence A. Wolsey

Steven Hackman University of Michigan CORE Georgia Institute of Technology Evan L. Porteus N. Keith Womer

Philip Heidelberger Stanford University University of Mississippi IBM T. J. Watson Research Alexander H. G. Rinnooy Kan Paul H. Zipkin

Center Erasmus University Columbia University

OR PRACTICE ASSOCIATE EDITORS

Thomas M. Cook Clarence Haverly Marc Mangel American Airlines, Inc. Haverly Systems University of California, Davis

Dale 0. Cooper David S. P. Hopkins James G. Root

Dale Cooper Consulting Stanford University Westport, Connecticut Ralph L. Keeney

Mark J. Eisner University of Southern California Stephen A. Smith Exxon Company International John Lastivica University of Santa Clara

First National Bank of Boston Thomas C. Varley

University of Maryland Mark Lembersky Management Consulting and Innovis Interactive Technologies Research, Inc.

Alan Gleit Judith S. Liebman Paul Wyman Citicorp Mortgage, Inc. University of Illinois Wyman Associates



Volume 36 July-August 1988 Number 4

IN THIS ISSUE 518 Sensitivity of the EOQ Model to Parameter Estimates 570

Gregory Dobson

OR PRACTICE Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning 575

Intelligent Data Compression in a Coal Anjain Jain and John W. Mamer Model 521

Clark W. Bullard and Richard Engelbrecht-Wiggans Decision Processes with Monotone Hysteretic

Policies 585 Sabine K. Hipp and Ulrich D. Holzbaur

ARTICLES Probabilistic Inference and Influence Diagrams 589

Ross D. Shachter Optimality of Zero-Inventory Policies for Unreliable Manufacturing Systems 532

T. Bielecki and P. R. Kumar Bargaining Under Two-Sided Incomplete Information: The Unrestricted Offers Case 605

Kalyan Chattejee and Larry Samuelson

Optimal Periodic Replacement of Multicomponent Reliability Systems 542

Suleyman Ozekici OR FORUM

Operations Research: The Next Decade 619 Scheduling Open Shops with Unit Execution Committee on the Next Decade in Times to Minimize Functions of Due Dates 553 Copmteratons R hesNearch

adi

C. Y. Liu and R. L. Bulfin Operations Research

State Dependence in M/G/I Server-Vacation CONTRIBUTORS 638 Models 560

Carl M. Harris and William G. Marchal APPRECIATION TO 1987 REFEREES 640

On, Stochastic Decomposition in MIGI I Type Queues with Generalized Server Cover Illustration: The supply side view of prices Vacations 566 from {'Intelligent Data Compression in a Coal

J. George Shanthikumar Model, '}page S27.



Date post:	04-Jan-2017
Category:	Documents
Upload:	buituong
View:	214 times
Download:	2 times

Back Matter

Documents