Back Matter

Back MatterSource: Operations Research, Vol. 34, No. 2 (Mar. - Apr., 1986), pp. 332-340Published by: INFORMSStable URL: http://www.jstor.org/stable/170832 .

Accessed: 08/05/2014 20:28

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 169.229.32.137 on Thu, 8 May 2014 20:28:41 PMAll use subject to JSTOR Terms and Conditions

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

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

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


=:::====

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

A

R. A. Abrams, University of Illinois W. Adams, Clemson University A. Agrawal, Tymnet Inc., San Jose, California B. Ahn, Korea Advanced Institute of Science and

Technology C. Aikens, University of Tennessee A. I. Ali, University of Texas at Austin T. Altiok, Rutgers University R. Alvarez-Valdes, University of Valencia, Spain Y. Alyahya, University of Michigan, Dearborn P. M. G. Apers, Twente University of Technology,

The Netherlands J. L. Arthur, Oregon State University A. Assad, University of Maryland Y. J. Assous, AT&T Bell Laboratories S. Axsater, Lulea University of Technology, Sweden K. A. Azoury, California State University

B

U. Bagchi, University of Texas at Austin K. G. Baker, University of New Mexico A. Balakrishnan, Purdue University E. Balas, Carnegie-Mellon University Y. Balcer, University of Wisconsin M. Ball, University of Maryland R. D. Banker, Carnegie-Mellon University R. E. Barlow, University of California, Berkeley J. W. Barnes, University of Texas at Austin R. R. Barton, R. C. A. Laboratories, Princeton, New Jersey B. Bauer, Stevens Institute of Technology M. Baughman, University of Texas I. Baybears, Carnegie-Mellon University J. C. Bean, University of Michigan W. Bein, Universitat Osnabruck, Federal Republic

of Germany C. E. Bell, University of Iowa D. E. Bell, Harvard University B. Bengtssos, Linkoping University, Sweden H. Benson, University of Florida M. Berg, University of Haifa, Israel 0. Berman, University of Calgary J. W. Bertrand, Eindhoven University of Technology,

The Netherlands F. J. Beutler, University of Michigan U. N. Bhat, Southern Methodist University J. R. Birge, University of Michigan R. Bixby, Rice University

W. Blischke, University of Southern California J. A. Bloom, General Public Utilities Service Corporation,

Parsippany, New Jersey S. Bodily, University of Virginia L. Bodin, University of Maryland F. Boesch, Stevens Institute of Technology P. J. Boland, University College-Dublin, Ireland M. A. Bonuccelli, Universita di Pisa, Italy A. Borison, Applied Decision Analysis, Menlo Park,

California H. Bouonaka, Bell Communications Research 0. J. Boxma, Mathematical Institute, The Netherlands M. Brandeu, Stanford University R. Brown, Decision Science Consortium, Falls Church,

Virginia S. S. Brown, General Electric Company, Valley Forge,

Pennsylvania P. Brucker, Universitat Osnabruck, Federal Republic

of Germany J. Bruno, Research Institute for Advanced Computational

Science, Moffet Field, California D. Buchanan, McMaster University W. A. Buehring, Argonne National Laboratories, Argonne,

Illinois R. Bulfin, Auburn University D. Y. Burman, AT&T Bell Laboratories J. A. Buzacott, University of Waterloo

C

M. Caramanis, Boston University D. R. Carino, Stanford University K. Carley, Carnegie-Mellon University J. Carlier, Universite de Paris, France J. Carson, Georgia Institute of Technology J. M. Chaiken, Abt Associates, Cambridge, Massachusetts A. Chakravarty, University of Wisconsin-Milwaukee S. Chand, Purdue University R. Chandrasekaran, University of Texas at Dallas K. Chatterjee, University of Pennsylvania K. Chelst, Wayne State University R. Cheng, University of Wales, United Kingdom S. Chiu, Stanford University C. W. Chow, AT&T Information Systems M. Cohen, Decision Science Consortium, Falls Church,

Virginia M. A. Cohen, University of Pennsylvania T. Coleman, Cornell University R. Cooper, Florida Atlantic University D. J. Corbet, ORI, Inc., Rockville, Maryland

Operations Research 0030-364X/86/3402-0332 $01.25 Vol. 34, No. 2, March-April 1986 332 C) 1986 Operations Research Society of America



Appreciation to Referees / 333

C. Courcoubetis, AT&T Bell Laboratories T. Cover, Stanford University A. Crupnick, Resources for the Future, Inc., Washington,

D.C. J. D. Cummins, University of Pennsylvania I. Currim, University of California, Los Angeles C. Curry, Stauffer Chemical Company, San Francisco,

California C. Cusano, University of Illinois

D

M. Dada, University of Illinois, Chicago S. Dafermos, Brown University C. Daganzo, University of California, Berkeley P. M. Dearing, Clemson University R. Dembo, Yale University J. Desrosiers, CNET/PAA/TIM/MIT, France B. L. Deuermeyer, Texas A. and M. University G. Dobson, University of Rochester J. Dodu, Electricite de France, Clamart, France B. Doshi, AT&T Bell Laboratories P. Dowling, McMaster University A. Drud, The World Bank, Washington, D.C. J. Dyer, University of Texas at Austin

E

J. N. Eagle, U.S. Naval Postgraduate School R. Ehrhardt, University of North Carolina at Greensboro J. Eliashberg, University of Pennsylvania J. Elzinga, University of Florida J. C. Emery, University of Pennsylvania M. Engquist, University of Texas at Austin M. Epelman, GTE Laboratories, Waltham, Massachusetts T. Eppel, University of Southern California G. Eppen, University of Chicago W. J. Erikson, University of Southern California

F

B. Faaland, University of Washington P. Farquhar, Carnegie-Mellon University A. Federgruen, Columbia University B. R. Feiring, University of Minnesota R. M. Feldman, Texas A. and M. University T. Feo, University of California, Berkeley G. Fischer, Carnegie-Mellon University P. Fishburn, AT&T Bell Laboratories C. Fisk, University of Illinois L. Flatto, AT&T Bell Laboratories M. Florian, Universite de Montreal E. Forman, George Washington University G. J. Foschini, AT&T Bell Laboratories S. French, University of Manchester, England R. Freund, Massachusetts Institute of Technology B. E. Fries, University of Michigan D. Friesen, Texas A. and M. University E. Frostig, Georgia Institute of Technology S. W. Fuhrmann, AT&T Bell Laboratories

G

A. Gaivoronski, International Institute for Applied Systems Analysis, Laxenburg, Austria

A. Garcia-Diaz, Texas A. and M. University R. Garfinkel, University of Tennessee G. Gassman, University of British Columbia J. L. Gastwirth, George Washington University D. P. Gaver, U.S. Naval Postgraduate School E. Gelenba, Universite de Paris-Sud, France A. Geoffrion, University of California at Los Angeles S. Gershwin, Massachusetts Institute of Technology I. Girtsbach, Ben-Gurion University of the Negev, Israel F. Glover, University of Colorado P. Glynn, University of Wisconsin A. A. Goett, Cambridge Systematics, Inc., Cambridge,

Massachusetts B. Golden, University of Maryland D. Goldfarb, Columbia University D. Goldsman, Georgia Institute of Technology I. J. Good, Virginia Polytechnic Institute and State

University G. Gottlieb, New York University N. Gould, University of Waterloo A. Goyal, IBM Thomas J. Watson Research Center,

Yorktown Heights, New York D. Granot, University of British Columbia W. K. Grassman, University of Saskatchewan S. C. Graves, Massachuetts Institute of Technology L. Green, Columbia University R. C. Grinold, University of California, Berkeley F. C. A. Groen, Delft University of Technology,

The Netherlands

H

R. Hahn, Carnegie-Mellon University M. Haimovich, University of Chicago S. L. Hakimi, Northwestern University L. Hall, Massachusetts Institute of Technology N. Hall, Ohio State University H. Hamacher, University of Florida P. Hammond, Stanford University P. T. Harker, University of Pennsylvania C. Harris, George Mason University M. Harrison, Stanford University P. Harrison, Imperial College of Science and Technology,

London, England R. Hartley, University of Manchester, England C. M. Harvey, Dickinson College C. M. Harvis, George Mason University J. Hauser, Massachusetts Institute of Technology A. Hax, Massachusetts Institute of Technology D. Hearn, University of Florida D. Heath, Cornell University P. Hell, Simon Fraser University R. L. Helmbold, U.S. Army Concepts Analysis Agency D. R. Heltne, Shell Oil Company, Houston, Texas J. Henderson, Massachusetts Institute of Technology



334 / Appreciation to Referees

K. Hinderer, Universitat Karlsruhe, Federal Republic of Germany

B. Hobbs, Case Western Reserve University D. Hochbaum, University of California, Berkeley K. Hoffman, George Mason University C. S. Hong, Johns Hopkins University W. T. Hood, General Public Utilities Service Corporation,

Parsippany, New Jersey M. S. Hung, Kent State University

T. Ichimoni, Hiroshima University, Japan Y. Ikura, Cornell University D. Inglehart, Stanford University H. Ishii, Osaka University, Japan

J

P. L. Jackson, Cornell University S. K. Jacobsen, Technical University of Denmark M. A. Jafari, Syracuse University D. Jagerman, AT&T Bell Laboratories J. JaJa, University of Maryland J. Jarvis, Clemson University P. Jensen, University of Texas at Austin W. S. Jewel, University of California, Berkeley K. Y. Jo, George Mason University H. Joe, University of British Columbia R. John, University of Southern California E. Johnson, Carnegie-Mellon University P. P. Jonker, Delft University of Technology,

The Netherlands M. A. Junger, University of Waterloo

K

L. C. M. Kallenberg, University of Leiden, The Netherlands

U. Karmarkar, University of Rochester J. J. Karrenbauer, Insight, Inc., Alexandria, Virginia P. Kedia, Purdue University R. L. Keeney, University of Southern California J. Keilson, University of Rochester L. R. Keller, University of California, Irvine W. D. Kelton, University of Michigan J. Kennington, Southern Methodist University D. P. Kierstead, Daniel H. Wagner, Associates,

Washington, D.C. T. Kimura, Tokyo Institute of Technology, Japan G. A. P. Kindervater, Centre for Mathematics and

Computer Science, The Netherlands C. Kirkwood, Arizona State University J. Kleijnen, Tilburg University, The Netherlands J. G. Klincewicz, AT&T Bell Laboratories D. Klingman, University of Texas at Austin E. Koenigsberg, University of California, Berkeley G. Kominski, Prospective Payment Assessment

Commission, Washington, D.C. H. Konno, Tokyo Institute of Technology, Japan

G. Koop, Queen's University, Ontario F. Koppelman, Northwestern University V. Krishna, Harvard University M. S. Krishnamoorthty, United Nations Information

Service, Lagos, Nigeria P. Kubat, GTE Laboratories, Waltham, Massachusetts A. Kydes, Brookhaven National Laboratories, Upton,

New York

L

B. Lamond, University of British Columbia D. Lane, University of British Columbia T. Lane, IBM Thomas J. Watson Research Center,

Yorktown Heights, New York M. K. Langston, Washington State University L. Lasdon, University of Texas at Austin K. Laskey, Decision Science Consortium, Falls Church,

Virginia J. Lathrop, Strategic Insights, Cupertino, California A. Law, University of Arizona K. Lawrence, AT&T Bell Laboratories H. L. Lee, Stanford University A. Lemoine, Ford Aerospace, Palo Alto, California R. V. Lenth, University of Iowa W. G. Lese, Jr., U.S. Department of Defense J. Leung, Northwestern University R. T. Lewis, Bell Communications Research V. Li, University of Southern California T. Liebling, Ecole Polytechnique Federale de Lausanne,

Switzerland J. Liebman, University of Illinois D. Lindley, Decision Science Consortium, Falls Church,

Virginia E. Lipper, AT&T Bell Laboratories M. Locks, Oklahoma State University M. Loeb, University of Maryland F. Lootsman, Delft University of Technology,

The Netherlands J. Loris-Teghem, Universite de l'Etat a Mons, France J. Loudiere, University of Alberta L. Lovasz, Eotvos Lorand University, Hungary R. Love, McMaster University S. F. Love, Textronix, Inc., Beaverton, Oregon

M

M. Machina, University of California, San Diego R. Madsen, University of Missouri M. J. Magazine, University of Waterloo N. Majluf, Massachusetts Institute of Technology J. W. Mamer, University of California, Los Angeles A. Marchetti-Spaccamela, University of Rome, Italy 0. Marcotte, Universite de Sherbrooke, Quebec B. Margolin, Department of Health and Human Services,

Washington, D.C. W. Massey, AT&T Bell Laboratories H. Matsuo, University of Texas at Austin J. Mazzola, Duke University




R. McBride, University of Southern California P. F. McCoy, ANSER, Inc., Arlington, Virginia R. McLean, University of Pennsylvania A. Mees, University of Western Australia R. Mehra, Scientific Systems, Inc., Cambridge,

Massachusetts I. Meilyson, Tel Aviv University, Israel K. Meier, AT&T Bell Laboratories M. Meketon, AT&T Bell Laboratories H. Mendelson, University of Rochester L. Merkhofer, Applied Decision Analysis, Menlo Park,

California D. R. Miller, George Washington University L. Mirman, University of Illinois R. H. Mohring, Hochschule Hildesheim, Federal Republic

of Germany G. E. Monahan, George Washington University C. Monma, AT&T Bell Laboratories T. Morin, Purdue University J. Morrison, AT&T Bell Laboratories T. E. Morton, Carnegie-Mellon University J. Mulvey, Princeton University J. Mumpower, State University of New York F. H. Murphy, Temple University B. Murtagh, University of New South Wales K. Murty, University of Michigan

N

S. Nahmias, University of Santa Clara C. Narasimhan, University of Chicago B. Natvig, University of Oslo, Norway J. I. Naus, Rutgers University R. Nauss, University of Missouri G. Nemhauser, Cornell University M. Netus, University of Arizona R. H. Nickel, Center for Naval Analyses, Alexandria,

Virginia J. Noel, Carnegie-Mellon University A. Nozari, AT&T Bell Laboratories K. Nti, George Washington University S. C. Nu, University of Texas at Dallas W. R. Nunn, Center for Naval Analyses, Alexandria,

Virginia

0

C. A. O'Cinneide, University of Arkansas S. Olmstead, Stanford University J. Orlin, Massachusetts Institute of Technology L. Ostresh, University of Wyoming T. Ott, Bell Communications Research P. W. Ow, Carnegie-Mellon University

P

M. Padberg, New York University G. Pailier, Georgia Institute of Technology J. Pang, University of Texas at Dallas R. Parker, Georgia Institute of Technology

M. Pereira, CEPEL P. P. Perla, Center for Naval Analyses, Alexandria,

Virginia H. D. Perros, North Carolina State University E. Peterson, North Carolina State University G. R. Phillips, Center for Naval Analyses, Alexandria,

Virginia M. L. Pinedo, Columbia University R. Pippert, Indiana University-Purdue University B. Pittel, Ohio State University R. Plemmons, North Carolina State University S. M. Pollock, University of Michigan C. N. Potts, University of Keele, England W. Powell, Princeton University N. U. Prabhu, Cornell University J. Pratt, Harvard University P. Preckel, Purdue University J. Prins, IBM, East Fishkill, New York E. Prisman, Georgia Institute of Technology P. Purdue, University of Kentucky

0

A. F. Quattromani, XMCO Inc., McLean, Virginia M. Queyranne, University of British Columbia

R

F. Radermacher, University of Passau, Federal Republic of Germany

G. Raghuram, Tulane University R. C. Rao, University of Texas at Dallas R. Rardin, Purdue University M. I. Reiman, AT&T Bell Laboratories 0. Renn, Kernforschungsunlage Julich, Federal Republic

of Germany A. H. G Rinnooy Kan, Erasmus University,

The Netherlands S. Robinson, University of Wisconsin-Madison W. F. Roller, University of Wisconsin-Milwaukee D. Ronen, University of Missouri J. Rose, University of Richmond D. Rosenfield, Arthur D. Little, Inc., Cambridge,

Massachusetts R. Rosenthal, Naval Postgraduate School U. Rothblum, Technion, Haifa, Israel R. Roundy, Cornell University A. Rubinstein, The Hebrew University of Jerusalem, Israel W. H. Ruckel, Clemson University R. J. Ruth, University of Wisconsin-Milwaukee

S T. Saaty, University of Pittsburgh H. Safer, Massachusetts Institute of Technology I. Sahin, University of Wisconsin-Milwaukee M. Saltzman, University of Arizona R. Sargent, Syracuse University R. Sarin, University of California, Los Angeles A. Satyanarayana, Stevens Institute of Technology



336 / Appreciation to Referees

M. W. P. Savelsbergh, Centre for Mathematics and Computer Science, The Netherlands

R. H. Schachtman, University of North Carolina at Chapel Hill

R. Schassberger, Technical University of Berlin, Federal Republic of Germany

Z. Schechner, Columbia University S. Scheffler, MANTIS S. Schiable, University of Alberta C. Schmidt, University of Alabama J. Schmidt, Virginia Polytechnic Institute J. Schoenfelder, Burroughs Wellcome Inc., Research

Triangle Park, North Carolina L. Schruben, Cornell University A. Seila, University of Georgia S. Selkow, Worcester Polytechnic Institute S. Sen, University of Arizona G. Sengupta, AT&T Bell Laboratories R. F. Serfozo, Georgia Institute of Technology L. Servi, GTE Laboratories, Waltham, Massachusetts T. Sexton, State University of New York at Stony rook J. G. Shanthikumar, University of California, Berkeley D. Shepard, Harvard University H. Sherali, Virginia Polytechnic Institute and State

University H. D. Sherman, Massachusetts Institute of Technology C. M. Shetty, Georgia Institute of Technology R. Shinnar, City College of The City University

of New York D. E. Shobrys, Chesapeake Decision Sciences, Houston,

Texas J. B. Sidney, University of Ottowa B. Simons, IBM, San Jose, California V. Singhal, Massachusetts Institute of Technology B. Siviazlian, University of Florida E. V. Slud, University of Maryland M. Sobel, Georgia Institute of Technology M. Solomon, Northwestern University D. Sonderman, University of Massachusetts E. Sondik, National Cancer Institute, Bethesda, Maryland H. Soroush, Michigan Technological University S. E. Spear, Carnegia-Mellon University J. Springarn, Georgia Institute of Technology K. E. Stecke, University of Michigan R. Steinberg, AT&T Bell Laboratories W. Stewart, College of William and Mary J. C. Stone, Stanford University L. D. Stone, Metron, Inc., McLean, Virginia D. Stoyan, Freiberg Mining Academy, Federal Republic of

Germany J. Strumfer, University of Pennsylvania C. Suffel, Stevens Institute of Technology R. Sullivan, University of Texas at Austin U. Sumita, University of Rochester R. Suri, University of Wisconsin-Madison A. Svornos, Columbia University W. Swarc, University of Wisconsin-Milwaukee G. B. Swartz, Eatontown, New Jersey

T

C. S. Tang, University of California, Los Angeles E. Tardos, Rheinische Friedrich-Wilhelms-Universitat,

Bonn, Federal Republic of Germany H. M. Taylor, Cornell University L. D. Taylor, University of Arizona J. G. C. Templeton, University of Toronto J. Tew, Purdue University J. Thisse, Universite Catholique de Louvain, Belgium J. Thizy, Princeton University K. D. Thorp, National Defense University, Washington,

D.C. R. M. Thrall, National Science Foundation, Washington

D.C. H. Tijms, Vrije Universiteit, The Netherlands B. Titus, Stanford University P. Toth, University of Bologna, Italy C. Tovey, Georgia Institute of Technology P. Tseng, Massachusetts Institute of Technology P. Turnquist, Cornell University

V

F. van der Duyn Schouten, Vrije Universiteit, The Netherlands

L. van der Heyden, Yale University N. van Dijk, University of British Columbia E. A. van Doorn, Twente University of Technology,

The Netherlands T. J. Van Roy, Bank Brussel Lambert, Belgium L. Van Wassenhove, Katholieke Universiteit, Belgium

w

W. Walker, The Rand Corporation, Santa Monica, California.

Y. S. Wan, Electric Power Research Institute, Palo Alto, California

A. R. Washburn, U.S. Naval Postgraduate School R. J. Weber, Northwestern University R. R. Weber, Cambridge University, England D. Wehrung, University of British Columbia R. Weiner, Harvard University A. Weintraub, University of Chile E. Weiss, Cornell University G. Weiss, University of Tel Aviv, Israel H. Weiss, Temple University R. Wendell, University of Pittsburgh M. J. Wenocur, Ford Aerospace, Palo Alto, California P. Werbos, U. S. Department of Energy G. Weslowsky, McMaster University C. C. White III, University of Virginia D. White, University of Manchester, England W. Whitt, AT&T Bell Laboratories C. Whittaker, Seattle University J. Wijngaard, Eindhoven University of Technology,

The Netherlands S. V. Williams, University of Pennsylvania J. G. Wilson, Case Western Reserve University




J. R. Wilson, Purdue University R. Wilson, Stanford University R. L. Winkler, Indiana University W. Winston, Indiana University R. T. Wong, Purdue University K. Wood, U.S. Naval Postgraduate School G. Wright, Purdue University M. Wright, Stanford University R. D. Wright, National Defense University, Washington,

D.C.

y

M. Z. Yakin, University of Houston H. H. Yanasse, Instituto de Pesquisas Espaciaia, Brazil

C. A. Yano, University of Michigan D. Yao, Columbia University Y. Yao, Colorado State University H. P. Young, University of Maryland

z

M. Zelen, Harvard University E. Zemel, Northwestern University W. T. Ziemba, University of British Columbia P. Zipkin, Columbia University A. Zoltners, Northwestern University M. Zheng, Columbia University D. Zuckerman, University of British Columbia



* p*

Payanotis Afentakis is Assistant Professor in the Industrial Engineering and Operations Research Department, Syracuse University. Bezalel Gavish is Associate Professor at the University of Rochester. Between 1965 and 1973 Professor Gavish had respon- sibility for bill of materials processor-based production scheduling systems for a large industrial organization. This interest was renewed in the late 1970s, when he discovered that very little had changed in our computational ability to solve such problems. Their paper is a portion of Professor Afentakis' doctoral dissertation; the authors have also collaborated on research for capacitated multistage production planning. A companion paper has appeared in Management Sci- ence, Vol. 30, No. 2.

Gabriel R. Bitran is Professor of Management at the Sloan School of Management, Massachusetts Institute of Technology. Elizabeth A. Haas is a partner with McKenzie and Company, Cleveland, Ohio, and Hirofumi Matsuo is Assistant Professor of Manage- ment at the Graduate School of Business, The Uni- versity of Texas at Austin. The problem treated in their paper arose from a consulting opportunity with a producer of consumer electronic products. The re- sulting research encompasses notions of hierarchical planning and stochastic programming. The authors have previously contributed to the literature on production planning problems in several joint publications.

Michael W. Carter is an Associate Professor in the Industrial Engineering Department at the University of Toronto. He is actively involved in the design of algorithms for examination timetabling and course timetabling problems. His paper was inspired by the lack of any comprehensive survey of examination timetabling applications in the literature, and offers an overview for the researcher and a tutorial for the practitioner. He plans to produce a similar survey for the course timetabling problem.

Avishai Ceder is Visiting Professor, Department of Civil Engineering, Massachusetts Institute of Tech- nology (on leave from the Technion, Israel Institute of Technology, Haifa). He became involved with the research reported in his paper as a member of Dr. Geverghese Tharakan's doctoral thesis committee. His research interests include the development of new

methods for transit operation planning, transit network design, and various scheduling problems.

Hans Daduna is Professor of Mathematics at the In- stitut fur Mathematische Stochastik, Department of Mathematics, University of Hamburg. His paper was written as part of a research project on distributed systems conducted by the Deutsche Forschungs- gemeinschaft at the Technical University of Berlin, under the direction of Professor Rolf Schassberger. The main theme of the project was sojourn times in queueing networks; the model developed in this paper was evaluated in detail because it is used in perform- ance analysis of computer systems, and because several relevant theoretical and algorithmic issues can be studied in this simple system. A more general solution to the sojourn time problem in queueing networks is given in "Sojourn Times in Queueing Networks with Multiserver Nodes," written with R. Schassberger (to appear in the Journal ofApplied Probability, 1987).

Awi Federgruen is Associate Professor of Management Science and Operations Management at the Graduate School of Business, Columbia University. Henry Groenevelt is Assistant Professor of Operations Management at the Graduate School of Management of the University of Rochester. Their paper arose from an optimization model they developed for a professional filing service that assists investors in selecting land parcels to bid on in the Bureau of Land Manage- ment's bimonthly simultaneous drawings. This problem was originally specified as a project in an elemen- tary course Professor Federgruen taught in the Mas- ter's Degree Program for Executives at Columbia. The paper is part of a series of publications on resource allocation problems with decreasing marginal returns to scale. It is also a part of Professor Groenevelt's dissertation, written under the supervision of his coauthor.

Bezalel Gavish, see Payanotis Afentakis.

Henry Groenevelt, see Awi Federgruen.

Elizabeth A. Haas, see Gabriel R. Bitran.

Gordon B. Hazen is Assistant Professor, Department of Industrial Engineering and Management Sciences, Northwestern University. His paper is part of his

338



Contributors / 339

continuing study of the use of partial preference information in multiple-objective decision making. His related research interests include multiple-criteria optimization and the foundations of decision analysis.

Pierre Humblet is Associate Professor in the Depart- ment of Electrical Engineering and Computer Science, Massachusetts Institute of Technology. Warren B. Powell is Assistant Professor, Department of Civil Engineering, Princeton University. Their research grew out of an interest in developing both a nonlinear optimization model of flows over freight transportation networks and the requisite computational procedures to overcome several specific computational weaknesses in the theory of bulk service queues. On- going related research has focused on finding waiting time distributions for general bulk service queues, with special attention given to the development of efficient, numerically stable iterative methods for modeling transient systems.

Richard C. Larson is a Professor at the Massachusetts Institute of Technology, holding joint appointments in the Departments of Electrical Engineering and Computer Science, and Urban Studies and Planning. From 1978 to 86 he served as Co-Director of the MIT Operations Research Center. Christian Schaack has been appointed Assistant Professor at the Harvard Business School. Their paper, the first in a series of three on cutoff priority queues, was motivated by shortcomings of current police dispatching policies. The paper is an outgrowth of Christian Schaack's doctoral dissertation research, supervised by his coauthor.

Austin J. Lemoine is responsible for system modeling in the Special Programs Operation of Ford Aerospace, Palo Alto, California. The modeling activities include technology development (modeling research), technology transfer (primarily interactive modeling soft- ware design and development), and project support (training, and application of modeling concepts and tools). His research interests include dynamic reliability modeling, sojourn time problems in networks of queues, and service systems with periodic Poisson input.

Dennis V. Lindley, now retired, was formerly Profes- sor of Statistics at University College, London. Since retiring, he has been a visitor to many universities throughout the world. In addition, he has worked closely with Dr. Rex Brown at Decision Science Con-

sortium, Inc., on problems that arise in the implementation of decision analyses. This paper attempts to investigate the problem of when an analysis might be worthwhile.

Hirofumi Matsuo, see Gabriel R. Bitran.

Warren B. Powell, see Pierre Humblet.

Harilaos N. Psaraftis is Associate Professor of Marine Systems, Department of Ocean Engineering, Massa- chusetts Institute of Technology. His paper is part of a multidisciplinary research project he led with Pro- fessor J. D. Nyhart of MIT on the modeling of oil spill response operations and decisions. Professor Psaraftis was stimulated to become involved in this project by the opportunity he saw for applying OR/MS methods to a set of important public policy problems charac- terized mainly by little or no structure and overall confusion with respect to knowledge and practice. The "tactical" counterpart of this paper appeared in Man- agement Science, Vol. 31, No. 12 (coauthored with Babis Ziogas). Professor Psaraftis' research interests also include vehicle routing and scheduling, logistics, and transportation planning.

Christian Schaack, see Richard C. Larson.

Craig C. Sherbrooke is President of Sherbrooke & Associates, a consulting firm specializing in inventory models and logistics applications. The research for this article was done while the author was a consultant to the Logistics Management Institute in Bethesda, Maryland. It improves upon earlier models developed by Dr. Sherbrooke in the mid-i 960s while he was at The Rand Corporation.

Shaler Stidham, Jr., is Professor of Operations Re- search and Systems Analysis at the University of North Carolina at Chapel Hill. Previously he was a faculty member at Cornell University and North Car- olina State University. His research interests are in the optimization of stochastic service systems, and are motivated by problems in the design and control of traffic flow, computer/communication systems, and manufacturing systems. This paper continues his study of stochastic clearing systems as unified models for certain demand-responsive bulk-service queueing systems, begun with his 1974 article "Stochastic Clear- ing Systems" (Stochastic Processes and Their Appli- cations, Vol. 2, pp. 85-133). His paper's goal is to show how the regenerative analysis introduced in the 1974 article can be extended to clearing systems with



340 / Contributors

nonlinear costs, periodic review, and/or positive lead- times.

fEva Tardos, now on leave from the Research Insti- tute for Telecommunication, Budapest, Hungary, is a Humboldt Fellow at the Institut fur Okonometrie und Operations Research, University of Bonn, West Germany. Her paper arose from an interest in finding a polynomial time linear programming algorithm for linear programs that are described with real numbers. These results generalize a previous algorithm for minimum cost network circulation problems (Combinatorica 5, No. 3, 1985, pp. 247-255).

Geverghese G. Tharakan is a Research Scientist, Transportation Department, The World Bank, Wash- ington, D.C. His paper with Psaraftis and Ceder is an outgrowth of his doctoral dissertation ("The Comple- mentary Locations on a Network," MIT, May 1982). The author is currently involved in projects that involve planning intermodal transportation systems, forecasting port traffic, and risk analysis.

K. E. Trummel is a Senior Systems Analyst at Singer, Link Flight Simulation Division; J. R. Weisinger is a Senior Associate at Daniel H. Wagner, Associates (DHWA), Sunnyvale, California. At the time their note was written, both authors were employed at DHWA and were involved in search-related consulting work for the U.S. Navy and the U.S. Coast Guard. The results in their note confirm a long-held folk theorem of search theory-that is, constructing optimal search paths is a hard problem.

J. R. Weisinger, see K. E. Trummel.

Michael L. Wenocur is a Senior Systems Modeler at Ford Aerospace, Palo Alto, California. He holds a Ph.D. in statistics from Stanford University and is currently pursuing the M.S. degree in computer science. His research interests include applications of queueing theory to computer systems, diffusion processes and the associated analytic theory, and estimation problems arising from reliability modeling.



S]MUifuU[S]CU4IW(UinEUUU(SR4MkS]UW

Operations Research publishes quality operations research and management science work of interest to the OR practitioner and researcher in the three substantive categories: operations research methods, data based operational science, and the practice of OR. The Journal seeks papers reporting underlying data-based principles of operational science, observations and modeling of operating systems, contributions to the methods and models of OR, case histories of applications, review articles, and discussions 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, tutorials, 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 pub-

lishes papers on history, policy, analyses of current and future trends, and related subject matter including "Let- ters to the Editor." 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 refereed. 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 and material for the OR Forum section should be sent to

Thomas L. Magnanti, Editor Sloan School of Management Room E53-35 1 Massachusetts Institute of Technology Cambridge, MA 02139.

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 every issue 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; incorporate subsidiary material that would other- wise 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 acknowl- edgments 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. If the reference has more than three authors, cite the first author's surname followed by et al. and the year of publication. 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 book references give the author, year of publication, title, pub- lisher, city, and state-for example:

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

MORSE, P. M., AND G. E. KIMBALL. 1951. 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

a fractions, e.g., a/(1 - b) rather than 1 b; 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. 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

Thomas L. Magnanti, Editor Sloan School of Management Room E53-35 1 Massachusetts Institute of Technology Cambridge, MA 02139.

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 ex- perts in the subject matter. The introduction does not have a section heading.

10. Subject Classification for the OR/ MS Index. De- termine the appropriate subject classification and accompanying descriptive phrase for all work submitted. A



complete list of subject- categories appears at the back of every issue. Each subject category is indicated by a specific number. 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, must 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 Copyright Transfer Agreement form)-for example:

A paper entitled "Cost-Effectiveness in Urban Trans- portation" would be classified under two subject categories: 71 Cost/Benefit Analysis and 831 Transportation. On the Subject Classification form the numbers and accompanying phrases would be:

71 urban transportation 831 cost-effectiveness in urban transportation.

Do not repeat the subject classification (e.g., "Cost/ Benefit Analysis") 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. On the first page of each article is a code line and a notation of a $1.25 fee, which indicates ORSA's consent that copies may be made for personal or internal use of specific clients. A condition of this consent is that the copier must pay the per article fee through the Copyright Clearance Center, Inc., 21 Congress Street, Salem, MA 01970, (617) 744-3350. This consent does not extend to copying for general distribution, for advertising or promotional purposes, for creating new collec- tive works, or for resale, which are covered in Paragraph 2 above.

Announcements should be sent to Armand B. Weiss Editor, OR/MS Today 1449 Laughlin Avenue McLean, VA 22101 (703) 442-8780.

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.



COUNCIL OF THE SOCIETY 1986-1987

OFFICERS MEMBERS

President 1984-1987

Stephen M. Pollock Daniel P. Heyman Department of Industrial and Operations Engineering Bell Communications Research, Inc. University of Michigan Ann Arbor, MI 48109 Room 3Z-342 Red Bank, NJ 07701 (313) 764-9403 (201) 758-2886

Michael J. Magazine Vice President/ President-Elect Department of Management Science Judith S. Liebman University of Waterloo 107 Coble Hall Waterloo, Ontario N2L 3G1 Canada University of Illinois (519) 888-4440 Champaign, IL 61820 1985-1988 (217) 333-0034 Karla L. Hoffman

Secretary Systems Engineering Department Carl M. Harris George Mason University Department of Operations Research Fairfax, VA 22030

and Applied Statistics (703) 425-3920 George Mason University Fairfax, VA 22030 Richard C. Larson (703) 425-3931 Operations Research Center

Room E40-129 Treasurer Massachusetts Institute of Technology Charles J. McCallum, Jr. Cambridge, MA 02139 AT&T Bell Laboratories Room HO3L-323 (617) 253-3604 Crawfords Corner Road Holmdel, NJ 07733 1986-1989 (201) 949-0844 Donald L. Iglehart

Executive Director Operations Research Department Patricia H. Morris Stanford University Stanford, CA 94305 ORSA Business Office (415) 723-0850 Mount Royal and Guilford Avenues Linus E. Schrage Baltimore, MD 21202 Graduate School of Business (301) 528-4251 University of Chicago

1101 East 58th Street Chicago, IL 60637 (312) 962-7743

PAST PRESIDENTS EDITORS

1984-1987 Operations Research David A. Schrady Thomas L. Magnanti Provost and Academic Dean Sloan School of Management Room E53-351 Naval Postgraduate School Massachusetts Institute of Technology

Monterey, CA 93943 Cambridge, MA 02139 (408) 375-0204 (617) 253-6604

1985-1988 Transportation Science Michael E. Thomas Denos C. Gazis School of Industrial and Systems Engineering IBM Corporation Georgia Institute of Technology Thomas J. Watson Research Center

Atlanta, GA 30332 P.O. Box 218 Yorktown Heights, NY 10598

(404) 894-4288 (914) 945-2176 Operations Research Letters

1 986-1989 George L. Nemhauser Hugh E. Bradley School of Operations Research and Industrial Engineering Shaklee Corporation (T-265) Upson Hall 444 Market Street San Francisco, CA 94111 Cornell University Ithaca, NY 14853 (415) 954-2022 (607) 256-3410



Publications in Operations Research (PORS) Membership Saul I. Gass Gilbert T. Howard College of Business and Management U.S. Naval Postgraduate School University of Maryland College Park, MD 20742 Monterey, CA 93943 (301) 454-3842 (408) 646-2098

Interfaces* Nominating Gary L. Lilien Hugh E. Bradley Business Administration Building, 31 OA Shaklee Corporation (T-265) Pennsylvania State University 444 Market Street San Francisco, CA 94111

University Park, PA 16802 (415) 954-2022 (814) 863-2782 Publications

Mathematics of Operations Research* F. Russell Richards Stephen M. Robinson Department of Operations Research Department of Industrial Engineering U.S. Naval Postgraduate School University of Wisconsin Monterey, CA 93943 1513 University Avenue Madison, WI 53706 (408) 646-2543 (608) 263-6862 Scientific and Professional Recognition Marketing Science* Robert Herman Subrata K. Sen Department of Civil Engineering, Crockrell Hall School of Organization and Management University of Texas at Austin Austin, TX 78712 Yale University, Box IA New Haven, CT 06520 (512) 471-4379 (203) 436-1953 Student Affairs OR/ MS Today* James C. Bean Armand B. Weiss Department of Industrial and Operations Engineering Associations International Inc. University of Michigan Ann Arbor, MI 48109 6803 Whittier Avenue McLean, VA 22101 (313) 763-1454 (703) 442-8780 Technical Sections/ Special Interest Groups

Marlin U. Thomas Department of Industrial Engineering

COMMITTEES 1986-1987 Cleveland State University Cleveland, OH 44115 (216) 687-4664

Affiliated Professional Activities Karla L. Hoffman Systems Engineering Department George Mason University Fairfax, VA 22030 (703) 425-3920 JOINT ORSA/TIMS COMMITTEES Education Archives Jon C. Liebman Hugh J. Miser 2210 Fletcher Street Urbana, IL 61801 199 South Road Farmington, CT 06032 (217) 333-6966 (203) 677-0092

Geographical Sections Automated Data Processing Dalen T. Chiang Hugh E. Bradley Department of Quantitative Business Analysis Shaklee Corporation (T-265) Cleveland State University Cleveland, OH 44115 444 Market Street San Francisco, CA 94111 (216) 687-3792 (415) 954-2022

Kimball Medal Combined Meetings William P. Pierskalla Robert A. Abrams The Wharton School, Suite 1000, SH-DH CC Department of Quantitative Methods University of Pennsylvania Philadelphia, PA 19104 University of Illinois Chicago, IL 60680 (215) 898-6820 (312) 996-2676

Lanchester Prize Combined Publications John A. Muckstadt F. Russell Richards 320 Upson Hall Department of Operations Research Cornell University Ithaca, NY 14853 U.S. Naval Postgraduate School (607) 255-9123 Monterey, CA 93943

Long Range Planning (408) 646-2543 Judith S. Liebman Finance 107 Coble Hall Charles J. McCallum, Jr. University of Illinois AT&T Bell Laboratories Room HO3L-323 Champaign, IL 61820 Crawfords Corner Road Holmdel, NJ 07733 (217) 333-0034 (201) 949-0844

* Joint Publication of the Operations Research Society of America and The Institute of Management Sciences.



Visiting Lecturer Program Robert L. Bovey Coopers & Lybrand 1800 M Street, NW Washington, DC 20036 (202) 822-4205

von Neumann Theory Prize Julian Keilson Graduate School of Management University of Rochester Rochester, NY 14627 (716) 275-4714

LIAISON REPRESENTATIVES 1986-1987

AAAS American Association for the Advancement of Science

Saul I. Gass

ACM Association for Computing Machinery W. Charles Mylander

AIDS American Institute for Decision Sciences Herbert Moskowitz

APHA American Public Health Association Richard H. Shachtman

ASA American Statistical Association, Committee on Quality Control Douglas C. Montgomery

CBMS Conference Board of the Mathematical Sciences Joseph Engel

CORS Canadian Operations Research Society James H. Bookbinder

COSSA Consortium of Social Science Associations Robert M. Thrall

CSSP Council of Scientific Society Presidents Michael E. Thomas

IEEE Institute of Electrical and Electronic Engineers Abraham Haddad

IFORS International Federation of Operational Research Societies

William P. Pierskalla

IIASA International Institute for Applied Systems Analysis Alfred Blumstein

IIE Institute of Industrial Engineers V. Edward Unger, Jr.

MORS Military Operations Research Society Clayton J. Thomas

MPS Mathematical Programming Society Milton Gutterman

NRC National Research Council Robert Herman

SIAM Society for Industrial and Applied Mathematics Eric Wolman

WSC Winter Simulation Conference Bruce W. Schmeiser

MEMBERSHIP INFORMATION

Persons interested in joining the Operations Research Society of America will initially be admitted as Associate Members. Twice yearly at joint national meetings, the ORSA Council, upon recommendation from the Mem- bership Committee, elects to Full Member status those individuals who have requested such a designation and who have met certain professional requirements of the Society.

Dues. The annual dues for Full Members and Associate Members are $30.00 (1986). For members who are pursuing at least a half-time program of instruction at a recognized institute of higher learning, who are enlisted personnel (non-commissioned officers) in the U.S. Armed Forces, or who are retired members, the dues are $15.00-one-half the rate for Full and Associate members. If a person joins ORSA after July 1, the dues are 50% of these amounts. Society dues include subscriptions to Operations Research and the OR/MS Today news- letter (each published six times per year), two ORSA/ TIMS meeting Bulletins, and the joint ORSA/TIMS Directory.

Applications. Information on membership and Society activities may be requested from the Society's Business Office, at the address listed below.

NONMEMBER SUBSCRIPTION INFORMATION

For six issues (plus the two meeting Bulletins): $65.00 for individuals and $96.00 for institutions in the USA; $73.00 for individuals and $104.00 for institutions in all

foreign countries including Canada. ($105.00 foreign air mail for individuals and $136.00 for institutions.) Single issues can be purchased for $15.00 by individuals and $17.00 by institutions.

Back Issues of Volumes 1- 13 (1952-1965) are available from

Kraus Reprint and Periodicals Route 100 Millwood, NY 10546.

Volumes 14-24 and 26-33 are available from the ORSA Business Office at $5.00 per volume for members and $48.00 per volume for nonmembers. Volume 25 (1977) and some individual issues are out of stock; please contact the ORSA Business Office for details concerning availability.

Microfllm Editions are available from Microfilm Department, Waverly Press, Inc. 428 East Preston Street Baltimore, MD 21202.

Microfi'che Editions are available from KTO Microform Route 100, Millwood, NY 10546.

Claims of non-receipt: Claims should be made within six months of publication. Issues claimed after six months may be purchased as back issues.

SOCIETY BUSINESS OFFICE Patricia H. Morris, Executive Director Mary Thomas Magrogan, Administrative Assistant Operations Research Society of America Mount Royal and Guilford Avenues Baltimore, MD 21202 (301) 528-4146



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 the following pages. For every number (that is, 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" would be classified under two subject categories: 71 Cost/ Benefit Analysis and 831 Transportation. On this Subject Classification form the numbers and accompanying phrases would be: 71 urban transportation, 831 cost-effectiveness in urban transportation.

SUBJECT CATEGORY PHRASE

1.

2.

3.-



SUBJECT CLASSIFICATION FOR THE OR/MS INDEX

1 Accounting Finance (continued) Inventory/Production (continued) 2 Auditing 202 Portfolio 333 Approximations 3 Depreciation 201 Securities 334 Deterministic Models 4 Operating Budgets 200 Taxation 341 Limit Theorems

11 Acknowledgment 203 Working Capital 342 Linear Decision Rules 21 Artificial Intelligence 211 Financial Institutions 343 Measures of Effectiveness 31 Civil Defense 212 Banks 344 Operating Characteristics 41 Comments on 217 Brokerage/Trading 367 Packaging 51 Communications 213 Insurance 345 Parameter Estimation 52 Information Theory 214 Investment 346 Parametric Analysis 61 Computers 215 Markets 347 Perishable Items 62 Analog Techniques 216 Underwriters 348 Planning Horizons 63 File Systems 221 Forecasting 349 Policies, Advertising 64 System Design/Operation 222 Applications 350 Policies, Capacity 65 Time Sharing 225 ARIMA Processes 351 Policies, Disposal 71 Cost/Benefit Analysis 223 Delphi Technique 352 Policies, Employment 81 Costing 224 Regression 353 Policies, Issuing 82 Estimation 226 Time Series 354 Policies, Leadtime 83 Life Cycle 231 Games/Group Decisions 355 Policies, Maintenance 91 Decision Analysis 232 Bargaining 356 Policies, Pricing 92 Applications 233 Bidding 357 Policies, Replacement 93 Approximations 234 Cooperative 358 Policies, Review Interval 94 Criteria 235 Gambling 359 Production Smoothing 95 Inference 236 Noncooperative 360 Reject Allowances 96 Sensitivity 237 Teams 361 Simulation 97 Sequential 238 Voting/Committees 362 Stochastic Models 98 Systems 251 Government 366 Surveys

111 Dynamic Programming 252 Elections 381 Judicial/Legal 112 Applications 253 Politics 382 Crime 113 Bayesian 254 Services, Fire 384 Crime Prevention 115 Deterministic: Continuous Time 255 Services, Police 383 Law 114 Deterministic: Discrete Time 256 Services, Postal 385 Penal System 116 Markov: Finite State 257 Services, Waste Disposal 391 Labor 117 Markov: Infinite State 258 Services, Water 392 Unions 119 Optimal Control 259 Tax Policy 401 Man-Machine Systems 118 Semi-Markov 271 Health Care 411 Marketing 131 Economics 272 Ambulance Service 412 Advertising/Promotion 132 Econometrics 273 Blood Bank 413 Buyer Behavior 133 Input-Output Analysis 274 Diagnosis 414 Competition 141 Education Systems 275 Epidemiology 415 Distribution 143 Operations 276 Hospitals 416 Measurement 142 Planning 277 Pharmaceutical 417 Mix 151 Engineering 278 Treatment 418 New Products 152 Applications 291 Industries 419 Packaging 161 Environment 292 Agriculture/Food 420 Pricing 162 Earthquakes 293 Business Services 421 Sales Force 163 Ecology 294 Chemical 431 Mathematics 164 Noise 295 Communications 432 Combinatorics 165 Pollution 296 Construction 433 Equations 166 Weather 297 Electric/Electronic 434 Functions 171 Errata 298 Leisure 435 Matrices 181 Facilities/Equipment Planning 299 Lumber/Wood 436 Sets 182 Capacity Expansion 300 Machinery 441 Military 183 Design 301 Mining/Metals 442 Antisubmarine Warfare 184 Layout 302 Paper 443 Artillery 185 Location 303 Petroleum/Natural Gas 444 Combat 186 Maintenance/Replacement 304 Printing/Publications 445 Cost Effectiveness 191 Finance 305 Retail 446 Defense Systems 192 Capital Assets 306 Textiles/Apparel 447 Fire Control 193 Capital Budgeting 307 Transportation Equipment 448 Force Effectiveness 194 Capital Rationing 308 Wholesale 449 Lanchester Theory 195 Corporate Finance 321 Information Systems 450 Logistics 196 Depreciation 322 Libraries 459 Missile Systems 197 Investment 323 Management 451 Requirements Evaluation 198 Investment Criteria 331 Inventory/Production 452 Search 199 Management 332 Applications 453 Stochastic Duels



Military (continued) Professional (continued) Queues (continmwd) 454 Surveillance 608 OR/MS Standards 696 Optimization 455 Tactics 609 ORSA/TIMS Policy 697 Output Process 456 Targeting 621 Programming 698 Priority 457 Test/Evaluation 622 Complementarity/Fixed Points 700 Simulation 460 Tracking 652 Equivalence/Transformations 701 Statistical Inference 458 War Games and Simulation 623 Fractional 702 Switching 471 Natural Resource Policies 624 Geometric 703 Tandem 472 Conservation 658 Infinite Horizon 704 Transient Results 473 Energy 625 Integer Algorithms: 720 Recreation/Sports 474 Land Development 627 Branch and Bound 721 Reliability 475 Water Resources 628 Cutting Planes 722 Availability 481 Networks/Graphs 629 Dynamic Programming 723 Failure Models 482 Applications 630 Enumerative 724 Inspection 483 Distance Algorithms 631 Group 725 Life Distributions 484 Flow Algorithms 632 Heuristic 726 Life Testing 486 Matchings 626 Tests 727 Maintenance 487 Multicommodity 633 Integer Applications 728 Quality Control 488 Stochastic 634 Integer Theory 729 Redundancy/Spares 490 Theory 635 Large Scale Systems 730 Replacement 491 Traveling Salesman 636 Leontief Substitution 731 System Safety 492 Tree Algorithms 660 Linear 741 Research and Developmei 501 Organizational Studies 637 Linear Algorithms 742 Project Selection 502 Behavior 638 Linear Applications 751 Search and Surveillance 503 Design 639 Linear, Parametric 761 Simulation 504 Goals 640 Linear Theory 762 Applications 505 Information 641 Multiple Criteria 763 Design of Experiments 506 Leadership 661 Nonlinear 769 Efficiency 507 Manpower Planning 642 Nonlinear Algorithms 764 Gaming 508 Motivation 649 Nonlinear Applications 765 Languages 509 Personnel 644 Nonlinear Cutting Planes 766 Random-Number Gen 510 Training 645 Nonlinear Gradient 767 Statistical Analysis 521 Philosophy 646 Nonlinear Linear Constraints 768 Systems Dynamics 531 Philosophy of Modeling 647 Nonlinear Penalty/Barrier 781 Space Program 541 Planning 643 Nonlinear Tests 791 Statistics 542 Community 650 Nonlinear Theory: 792 Analysis of Variance 543 Corporate 651 Duality 793 Bayesian 544 Urban 653 Optimality Conditions 794 Censoring 551 Population 654 Stability 795 Cluster Analysis 552 Family Planning 648 Nonlinear Unconstrained 796 Correlation 561 Probability 657 Quadratic 797 Data Analysis 562 Crossing Problems 655 Stochastic 798 Design of Experiments 563 Diffusion 656 Stochastic, Chance Constrained 799 Estimation 565 Distribution Comparisons 671 Project Management 800 Factor Analysis 564 Distributions 672 CPM 801 Nonparametric 566 Entropy 673 GERT 802 Pattern Analysis 567 Markov Processes 674 PERT 803 Regression 568 Random Walk 675 Resource Constraints 804 Sampling 569 Renewal Processes 681 Queues 805 Time Series 570 Stochastic Model Applications 682 Applications 821 Technology 581 Production/Scheduling 683 Approximations 831 Transportation 582 Cutting Stock 684 Balking and Reneging 832 Air 583 Flow Shop 685 Batch Arrivals 833 Mass Transit 584 Job Shop, Deterministic 686 Batch Service 834 Materials Handling 585 Job Shop, Stochastic 687 Birth-Death 835 Rail 586 Line Balancing 688 Busy Period Analysis 836 Road 587 Materials Handling 689 Cyclic 837 Route Selection 588 Product Design 707 Dam Models 838 Traffic 589 Work Studies 690 Deterministic 839 Water 601 Professional 706 Diffusion Models Utility/Preference 602 Addresses 691 Feedback 855 Applications 603 Comments on 692 Limit Theorems 856 Estimation 604 Obituaries 705 Markovian 852 Multiattribute 605 OR/MS Education 693 Multichannel 853 Scaling 606 OR/MS Implementation 694 Networks 851 Theory 607 OR/MS Philosophy 695 Nonstationary 854 Value Theory



Publications in Operations Research Series

Edited by Saul 1. Gass

Published by Elsevier Science Publishing Company, Inc., under the sponsorship of the Operations Research Society of America

Advanced Techniques in the Practice of Operations (March 20-22, 1985, University of Colorado, Den- Research. H. J. Greenberg, F. H. Murphy and S. H. ver) documents the current view of how microcom- Shaw, co-editors. 1982. 472 pages. puters will influence the future of OR. Current and

Consisting of six tutorials presented at the semi- future applications are discussed, along with surveys annual meeting of ORSA/TIMS, Colorado Springs, that give the reader an up-to-date view of microcom- November 10-12, 1980, this book deals with ad- puters and their role in statistics, decision support vanced topics in operations research that have systems, linear programming, expert systems and

important b i. simulation. Also discussed are the implementation important benefits in problem-solving and analysis. o ircmue ytmi nvriystig The papers are: "Qualitative Matrices," by John of a microcomputer system in a university setting, TheMpapber aie: "uitai Maltrics, bymJohn the role of PCs in project management, plus appli- Maybee; "ie Poins," Solutions. Coplem en- cations that deal with vehicle routing, personnel tarity,

Reean Thequil ria," bye WillagenrdI.Zan will " ar - scheduling, robotics, spreadsheet analysis, disaster kov Renewal Theory, Semi-Regenerative Processes maaeet*n rdcinpann.Teky

and~~~~ thi plctos"b ap . D sny Cm management, and production planning. The key- and~~~~~ thi

Aplctos"b'ap .Dse;"on note talk by Dr. Thomas Saaty is must reading for

puter-Assisted Analysis," by Harvey J. Greenberg; . . "Inventory Models and Practice," by Richard Ehr- all professionals who deal with microcomputers and hardt and Harvey Wagner; "Matroids and Opera- operations research. tions Research," by Robert E. Bixby. List price: $59.00

List price: $47.50 Members' price: $44.25

Members' price: $35.62 Manpower Planning Models. Richard C. Grinold and

Fire Department Deployment Analysis: A Public Policy Kneale T. Marshall. 1976. 256 pages. Analysis Case Study. Warren E. Walker, Jan M. Chaiken The first unified approach to the latest material, and Edward J. Ignall, editors. 1979. 680 pages. presented so you can apply it to solve practical

Based on research conducted by The Rand Corpo- problems, this volume offers a broad picture of ration and the New York City-Rand Institute, this possible trade-offs in manpower planning, as well as book brings together the most modem techniques the mathematical models to gauge them. Essential and analytical tools for tackling the resource alloca- to policy makers concerned with manpower prob- tion problems of locating and dispatching fire- lems in their organizations. fighting units. It covers all aspects of deployment List price: $39.50 analysis, from political and administrative consid- Members' price: $29.62 erations to precise formulation of solution algorithms, and is a complete, self-contained case example of how to perform successful public policy Queueing Tables and Graphs. Frederick S. Hiller and analysis. Oliver S. Yu. 1980. 256 pages.

List price: $39.50 Provides comprehensive data for analyzing and Members' price: $29.62 designing queueing systems without resorting

to expensive simulation and gives many new Impacts of Microcomputers on Operations Research. numerical results for previously intractable queue- Saul I. Gass, Harvey J. Greenberg, Karla L. Hoffman, ing models. Aimed at practitioners who design and R. Warren Langley, editors. 1986. 280 pages. New queueing service systems and have little or no back- title. ground in queueing theory.

This proceedings volume of the Symposium on the List price: $36.50 Impacts of Microcomputers on Operations Research Members' price: $27.37

ORSA and TIMS members are entitled to a 25% discount if books are ordered, and payment made, through the ORSA Business Office. Checks should be made payable to ORSA and sent to the Operations Research Society of America, Business Office, Mount Royal and Guilford Avenues, Baltimore, MD 21202.



Special Issue of Operations Research

on Decision Support Systems

Operations Research, the journal of the Operations Research Society of America, is pleased to announce a forthcoming special issue on Decision Support Systems. This broad subject includes the practical and methodological issues related to information systems for supporting decision making in business, industry, government, and the professions. These systems involve man-machine interactions on the one hand and operations research models and methods on the other. We welcome the submission of reviews and research papers on all aspects of this theme.

Typical subjects include

* successes and limitations of decision support systems in practice;

* their role in strategic, tactical or operational planning anddecision making;

* their functional, structural, and technical characteristics;

* general techniques for development and implementation;

* design and analysis of algorithms for using real-time optimization in decision support systems;

* representation of operations research expertise in knowledge bases and the manipulation of this expertise through inference techniques.

All manuscripts will be refereed according to the usual procedures followed by Operations Research.

Manuscripts should be submitted by January 1, 1987 to one of the editors of the special issue:

Paul Gray Jan Karel Lenstra Claremont Graduate School Centre for Mathematics Claremont, CA 91711 and Computer Science U.S.A. P.O. Box 4079

1009 AB Amsterdam The Netherlands BITNET address:

GRAYP@CLARGRAD Telephone: 31-20-5929333



COMPETITIVE MARKETING STRATEGY

CALL FOR PAPERS For a Special Issue of Marketing Science

Marketing Science plans a special issue on competitive marketing strategy. By "competitive" we mean models and analyses that explicitly consider competition. For example, how will competitive brands react to my advertising and promotion, what will be the implications of their reactions and how should I act in light of these implications? By "marketing" we mean analyses that explicitly consider and use marketing phenomena, data, and/or theory. For example, one might analyze the equilibrium implications of empirically-grounded marketing models, or one might analyze competitive situations with UPC data, or one might address positioning and segmentation strategies.

Here are a few examples of analyses that we might like to see.

Theory * analysis of competitive strategy with previously published and empirically documented

(non-competitive) models of promotion or advertising * new product development and the entry decision - when does it pay to be first in the

market? * equilibrium analyses of positioning and segmentation (e.g., based on perceptual maps) * defensive marketing strategy (including entry deterrence) based on the recognition of

competitive reaction to positioning strategy * the role of reputation in competition * analysis of channels of distribution in light of competitive considerations * analysis of marketing situations such as an oligopolist facing decisions on allocating

advertising, promotion, new product, and distribution budgets. Empirical

* analysis of observed competitive action and reaction in actual markets and interpretation in light of theory (We prefer you analyze more than one market.)

* estimation of reaction functions based on UPC and/or other archival data * analysis of human subjects making competitive marketing decisions, if care is taken to

ensure external validity.

Applications * application to a real competitive marketing situation of a model which explicitly considers

competitive action and reaction * reanalysis of a published application, but with new competitive insights.

Interested authors should send five copies of their articles to:

Professor Subrata K. Sen, Editor Marketing Science Yale School of Management Box IA New Haven, CT 06520

The deadline for submission of articles is January 30, 1987.



MANAGER-OPERATIONS RESEARCH

Large nonprofit health and emergency organization is seeking an individual with a Ph.D./M.B.A. and 10 years of experience, or the equivalent, in operations research, industrial engineering, or management systems/science. Excellent oral, written, quantitative, and microcomputing skills must be demonstrated. The incumbent will plan, implement, and manage operations research studies for corporate headquarters units and coordinate operations research work with other units nationwide. Salary mid-40s plus. Excellent and varied benefits program. Salary requirements must accompany resume. Send vita to Thomas P. Higgins, National Headquarters, American Red Cross, Washington, DC 20006.

Schedule of Future ORSA / TIMS Meetings

1986 OCTOBER 27-29 MIAMI, FL FONTAINBLEU

Chairman

Jack R. Borsting

School of Business Administration Jenkins 219 University of Miami Coral Gables, FL 33124

1987 MAY 4-6 NEW ORLEANS, LA MARRIOTT

Chairman

William E. Biles

Department of Industrial Engineering Louisiana State University Baton Rouge, LA 70803

1987 OCTOBER 26-28 SAINT LOUIS, MO ADAM'S MARK

Chairperson

Vicki L. Sauter School of Business Administration University of Missouri-St. Louis St. Louis, MO 63 121



I hereby Sapl foth

I hereby apply for admission to the Operations Research Society ofAmerica with the grade of: ..FuHl Member - Reinstatement as Full Member (attach copy of oniginal acceptance letter)

- Associate Member --Hlaf year Associative Member (after July 1)

Student Member -falf year Student Member (after July 1)

---------------------------------------------------------------------__------__---------------------------------------

Last Name (Please Print) First Name Middle Name Citizenship

(Preferred Mailing Address)

City State Zip Birth Date

Employer City State Position/Title

Signature of Applicant Date

Student/Armed Services Membership:

Certified (Instructor/Commanding Officer) Signature Date (Please Print)

MEMBER DUES:*(Includes subscriptions to OPERATIONS RESEARCH, OR/MS TODAY, and the two meeting BULLETINS)

CODE RATE Full Member (M) (01) $30.00 Associate Member (AM) (02) 30.00 Student Member (SM) - First time joining Student Member SPECIAL RATE - (03) 15.00

$5.00 Retired Member (RM) (04) 15.00

ORSA JOURNALS-Reduced Member Rates Mem/Stu TRANSPORTATION SCIENCE (TR) $15.00/7.50

Volume 20, 1986 OPERATIONS RESEARCH LETTERS (ORL) 15.00

Volume 5, 1986 INTERFACES (INT) 15.00/7.50

Volume, 16,1986 MATHEMATICS OF OPERATIONS RESEARCH (MOR) 15.00/7.50

Volume 11, 1986 MARKETING SCIENCE (MKS) 20.00/10.00

Volume 5, 1986

TECHNICAL SECTIONS AND SPECIAL INTEREST GROUPS Business Applications/Corporate Planning (BAS) 22 $3.00 Manufacturing Management (MM-SIG) 23 3.00 Health Applications (HAS) 24 5.00/2.00 Military Applications (MAS) 25 3.00 Social Sciences Applications (SSA-SIG) 26 4.00/2.00 Transportation Science (TSS) 27 3.00 Computer Science (CSS) 28 2.00 Energy, Natural Resources and the Environment (EA-SIG) 29 2.00 Applied Probability (APS) 30 2.00 Decision Analysis (DA-SIG) 33 3.00/1.50

If you reside in a foreign country and would like to receive the OR joumal by AIR MAIL, please indicate $40.00 that choice here and include the additional postage in your check.

Please return check and application to: ORSA Business Office/Mount Royal & Guilford Avenues/Baltimore, Maryland 21202 USA. orsaapp



*4~ ~ ~~~

SITATISTICAL:

a review journal of the institute of mathematical statistics

EXECUTIVE EDITOR: Morris H. DeGroot, Carnegie-Mellon University EDITORS: David R. Brillinger, University of California, Berkeley

J. A. Hartigan, Yale UniversitY Ingram Olkin, Stanford University

On the occasion of its fiftieth anniversary, the Institute of Mathematical Statistics announces publication of Statistical Science, a new quarterly review journal in statistics and probability. Statistical Science will present the full range of contemporary statistical thought at a modest technical level accessible to the broad community of practitioners, teachers, researchers, and students in statistics and probability.

Featuring

Volume I Number I February 1986 * discussions of methodological and theoreti- Freedman . Navidi on cal topics of current interest and importance, Freedman & Navidi on

MODEL S FOR ADJUSTING THE CENSUS * surveys of substantive research areas with

Efron & Tibshirani on promising statistical applications, THE BOOTSTRAP

Le Cam on * evaluations of research papers in specific THE CENTRAL lIIMIT THEOREM areas of statistics and probability, AROUND 1935

Geisser on * discussions of classic articles from the THE COLLECTED WORKS OF literature with commentary on their impact GEORGE E. P. BOX on contemporary thought and practice,

Genest & Zidek on COMBINING PROBABIIITY * comprehensive book reviews, and DISTRIBUTIONS

Interviews with * interviews with distinguished statisticians DAVID BLACKWELL & T. W. ANDERSON and probabilists.

Statistical Science joins the Institute's distinguished journals, The Annals of Statistics and The Annals of Probability, in February 1986 and is included as a privilege of membership. Nonmember subscriptions are available to individuals and organizations. All subscriptions to the Annals include a subscription to Statistical Science for 1986. For additional information on how to receive Statistical Science, please write to the IMS Business Office.

IMS Business Office 3401 Investment Boulevard #7 Hayward, California 94545 (USA)



ttWorking women need life insurance, too. So I bought $100,000 of ORSA Members' Life Insurance..."

Contact Administrator, mtternu* O rganczto , n

~~~~~~~~~~~~~~~~~15 3r d Street N Wa___i

=~~~~~~~~~0 424983 ToIl re ~~~~~~~~~~~~~~~~~~~nWshigo ae 20_9683



ASSOCIATE EDITORS

Arjang A. Assad Philip Heidelberger Alexander H. G. Rinnooy Kan

University of Maryland IBM Erasmus University

Thomas E. Baker John C. Hershey Stephen M. Robinson Chesapeake Decision Sciences University of Pennsylvania University of Wisconsin-

Madison Egon Balas Edward P. C. Kao

Carnegie-Mellon University University of Houston-Central Donald B. Rosenfield

C. Bernard Barfoot Campus Arthur D. Little, Inc. Center for Naval Analyses Averill M. Law Richard E. Rosenthal

Jeremy A. Bloom University of Arizona Naval Postgraduate School General Public Utilities Service Hirofumi Matsuo Izzet Sahin

Corp. of Texas-Austin University of Wisconsin- Milwaukee

Rex V. Brown Decision Science Consortium Douglas M iller Lee W. Schruben

George Washington University Cornell University Hung-Po Chao

Electric Power Research Institute Amedeo R. Odoni J. George Shanthikumar Massachusetts Institute of University of California-Berkeley

Peter H. Farquhar Technology Carnegie-Mellon University C. M. Shetty

James B. Orlin Georgia Institute of Technology Awi Federgruen Massachusetts Institute of Douglas R. Shier

Columbia University Technology Clemson University Richard M. Feldman Michael L. Pinedo

Texas A&M Universitv Columbia University Jeffrey B. S Odney rUniversity of Ottawa

Robert Fourer Stephen M. Pollock Lawrence D. Stone

University of Michigan Metron Inc. Donald Goldfarb

M

Columbia University Evan L. Porteus Detlof von Winterfeldt Stanford University University of Southern California

Winfried K. Grassman University of Saskatchewan John W. Pratt John P. Weyant

Stephen C. Graves Harvard University Stanford University

Massachusetts Institute of Martin L. Puterman Michael Yannakakis Technology University of British Columbia Bell Laboratories

OR FORUM AND OR PRACTICE ASSOCIATE EDITORS

Dale 0. Cooper David S. P. Hopkins Hugh J. Miser Dale Cooper Consulting Stanford University Farmington, Connecticut

Mark J. Eisner Ralph L. Keeney James G. Root Exxon Research and University of Southern California GTE

Engineering Mark Lembersky Stephen A. Smith

Saul Gass Weyerhaeuser Co. University of Santa Clara University of Maryland

John Lastivica Thomas C. Varley Alan Gleit First National Bank Management Consulting and

Dowell Schlumberger, Inc. of Boston Research, Inc.

Clarence Haverly Judith S. Liebman Paul Wyman Haverly Systems University of Illinois Wyman Associates



Volume 34 March-April 1986 Number 2

IN THIS ISSUE 190 The Reconciliation of Decision Analyses 289 Dennis V. Lindley

OR PRACTICE Partial Information, Dominance, and Potential

A Survey of Practical Applications of Optimality in Multiattribute Utility Theory 296 Examination Timetabling Algorithms 193 Gordon B. Hazen

Michael W. Carter

VARI-METRIC: Improved Approximations for ARTICLES Multi-Indenture, Multi-Echelon Availability

Optimal Response to Oil Spills: The Strategic Models 311 Decision Case 203 Craig C. Sherbrooke

Harilaos N. Psaraftis, Geverghese G. Tharakan and Avishai Ceder TECHNICAL NOTES

Optimal Flows in Networks with Multiple SOurcemand Fwsinks,tworks with Appliatio Ole A Note on Shot-Noise and Reliabilitv Modeling 320 Sources and Sinks, wilth Applications to Oil Asi .Lmiead ihalL eou and Gas Lease Investment Programs 218 A

Awi Federgruen and Hienry Groenevelt The Complexity of the Optimal Searcher Path

Production Planning of Style Goods with High Problem 324 Setup Costs and Forecast Revisions 226 K. E. Trummel and J. R. Weisinger

Gabriel R. Bitran, Elizabeth A. Haas and Hirofumi Matsuo

LETTERS TO THE EDITOR Optimal Lot-Sizing Algorithms for Complex Product Structures 237 Comments on "On the Optimal Choice of Sizes"

Panayotis Afentakis and Bezalel Gavish by Peter Tryfos 328 David W. Pentico

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs 250 Comments on "On Normalizing C onstants in

Eva Tardos Queueing Networks" by P. G. Harrison 330

An N-Server Cutoff Priority Queue 257 Ernest Koenigsberg Christian Schaack and Richard C. Larson

The Bulk Service Queue with a General ERRATUM Control Strategy: Theoretical Analysis and a New Computational Procedure 267 Corcint"ShdlgJbswh

Exponentially Distributed Processing Times Warren B. Powell and Pierre Humblet and Intree Precedence Constraints on Two

Clearing Systems and (s, S) Inventory Systems Parallel Machines" 331 with Nonlinear Costs and Positive Lead Times 276 Michael Pinedo and Gideon Weiss

Shaler Stidham, Jr.

Cycle Times in Two-Stage Closed Queueing APPRECIATION TO REFEREES 332 Networks: Applications to Multiprogrammed Computer Systems with Virtual Memory 281

Hans Daduna CONTRIBUTORS 338



Date post:	08-Jan-2017
Category:	Documents
Upload:	truongdat
View:	214 times
Download:	2 times

Back Matter

Documents