Back Matter

Back MatterSource: Operations Research, Vol. 38, No. 3 (May - Jun., 1990), pp. 564-566Published by: INFORMSStable URL: http://www.jstor.org/stable/171371 .

Accessed: 09/05/2014 08:42

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.204 on Fri, 9 May 2014 08:42:56 AMAll use subject to JSTOR Terms and Conditions

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

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

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


CONTRIBUTORS

Omar Ben-Ayed is a lecturer in Quantitative Methods at the University of Tunis, Tunisia. He received a B.S. in Quantitative Methods from the University of Sfax, an M.S. in Applied Mathematics and a Ph.D. in

Business Administration from the University of

Illinois. His work on the application of bilevel linear

programming to the highway network design problem has appeared in Transportation Research and Revue

Tunisienne.

Charles Blair is a professor in the Department of

Business Administration at the University of Illinois.

He is currently involved with applications of complex?

ity theory to various problems.

Sid Browne is Assistant Professor of Management Science at the Graduate School of Business, Columbia

University, and Uri Yechiali is a professor in the

Department of Statistics at Tel-Aviv University. This

paper is an outgrowth of their collaboration while

Professor Yechiali visited N.Y.U. and supervised Pro?

fessor Browne's doctoral dissertation. Their work was

motivated by an optimization problem associated with

polling systems.

Gehan Corea is an Operations Research Analyst with the Research and Development Group at SAS Insti? tute Inc. This paper illustrates the development of

numerically stable algorithms based on Markov chain

techniques for computing the distribution ofthe min? imum routing cost in stochastic networks, and was motivated by the absence of an exact solution method for this measure. This research provided the starting ground for his doctoral dissertation under the direc? tion of Professor Kulkarni. Dr. Corea's research inter? ests are stochastic networks, reliability systems, sto? chastic scheduling and retrial queues.

James S. Dyer is the Foster Parker Centennial Profes? sor of Management and Finance at the University of Texas at Austin. Richard N. Lund is President of MDI

Management Consulting and specializes in multiple criteria business problems. He was formerly an inter? nal consultant for a major oil company where his

applications of decision analysis included marketing and exploration; his current interests are the evalua? tion of human resources for large corporations. John B. Larson is Assistant Professor of Operations Man?

agement at Indiana University, and his current re-

search interests include developing extensive form

algorithms for solving partially observable Markov decision processes. V. Kumar is Assistant Professor of

Marketing, Melcher Faculty Research Scholar, and Director of Marketing Research Studies at the Uni?

versity of Houston. Robert P. Leone is Professor of

Marketing at the University of Texas at Austin. This

paper is an outgrowth of a combination of empirical work by Dyer, Lund and Larson, and empirical and theoretical work by Kumar and Leone. The empirical work involved developing a linear model to prioritize oil and gas exploration plays. The theoretical support is provided in Kumar's Ph.D. dissertation on linear

approximation modeling.

Andre Girard is an associate professor at INRS-

Telecommunications, University of Quebec. Tele-

communication network planning and optimization are his research interests.

A. C. Georgiou, see P.-C. G. Vassiliou.

Xue Dao Gu is a professor at the Academy of Posts and Telecommunications Sciences, Beijing, China. His research interests are optimization and network

planning.

Dan Hamblin leads an economics consulting firm. He

manages R&D planning projects, and builds models that predict new, competing technology potentials, when adoption is constrained or enhanced by policy, and when operating costs depend on time of use. Jeannie Johnson is a systems engineer in the Federal and Electronic Systems Division of General Electric

Corporation. She specializes in real-time software ap? plications to communications and electronic systems testing. Judith Killen is Proposal Development Officer at Winrock International Institute for Agricultural Development. She directs proposal preparation for

competitively bid, international development con-

tracts, and teaches proposal writing and marketing to technical professionals from developing countries.

Arie Harel is Assistant Professor of Quantitative Stud? ies at the Graduate School of Management, Rutgers University, Newark, N.J. He holds B.Sc. and M.Sc.

degrees from Ben-Gurion University and a M. Phil. and a Ph.D. from Columbia University. His research includes modeling and analysis of stochastic produc? tion and queueing systems.

564



Contributors / 565

Alain Haurie is Professor at Universite de Geneve and

a member of GERAD, Ecole des HEC, Montreal. His

research interests are game theory, dynamic program?

ming, control theory, technoeconomic planning

models, energy modeling and manufacturing sys? tems. Gilles Savard was a Ph.D. candidate at Ecole

Polytechnique de Montreal when the note was written.

He is now Professor in the Department of Mathemat-

ics at the College Militaire Royal de St-Jean, Canada, and a member of GERAD. He is currently working on bilevel programming, energy modeling and decom-

position-coordination algorithms. Douglas J. White

is Professor in the Department of Decision Theory at

University of Manchester, GB. His research interests

include Markov decision processes, vector optimiza? tion and heuristic programming.

Lee A. Herrbach is affiliated with AT&T Bell Labo-

ratories, Naperville, Illinois as a Member of Technical

Staff.

Jeannie Johnson, see Dan Hamblin.

Keebom Kang is Adjunct Professor in the Department of Operations Research, Naval Postgraduate School.

His research includes simulation methodology/appli-

cation, and stochastic modeling. Bruce Schmeiser is

Professor in the School of Industrial Engineering, Purdue University. His research interests are the

probabilistic and statistical aspects of digital com?

puter stochastic simulation, including input modeling, random-variate generation, output analysis and vari?

ance reduction. This paper extends part of Professor

Kang's Ph.D. dissertation completed at Purdue

University.

Judith Killen, see Dan Hamblin.

Charles Knessl is Assistant Professor of Mathematics

and Charles Tier is Professor of Mathematics at

the University of Illinois at Chicago. Bernard J.

Matkowsky is Professor of Applied Mathematics and

Mathematics at Northwestern University. Zeev

Schuss is Professor of Applied Mathematics at Tel-

Aviv University. Among their research interests are

asymptotic and perturbation analyses of queueing models. Their collaboration has resulted in several

papers applying these methods to a variety of queueing models.

Vidyadhar G. Kulkarni is Associate Professor in the

Department of Operations Research, University of

North Carolina, Chapel Hill. His paper with G. Corea

is part of his research on networks with random are

weights. His contributions on related topics such as

shortest paths, longest paths, and spanning trees in

networks with random are weights have appeared in Operations Research, Stochastic Models and

Networks.

V. Kumar, see James S. Dyer.

John B. Larsen, see James S. Dyer.

Robert P. Leone, see James S. Dyer.

Richard N. Lund, see James S. Dyer.

Joseph Y.-T. Leung is Professor of Computer Science

at the University of Texas at Dallas. He works in the

areas of combinatorial optimization and algorithms, with a particular interest is scheduling theory.

Thomas Magnanti is the George Eastman Professor of

Management Science, co-director of the Leaders

of Manufacturing Program, and co-director of the

OR Center at MIT. Rita Vachani is a member of

the technical staff at GTE Laboratories, Waltham, Massachusetts. This paper grew out of Rita Vachani's

doctoral dissertation and forms part of the authors'

ongoing research in the use of polyhedral methods to

solve capacitated network design problems.

Lorne G. Mason is a professor at INRS-Telecommu-

nications, University of Quebec. His research interests

are in the application of optimization and control

theory to problems in telecommunication network

design, planning management and control. Cur?

rently he is involved in broadband network design and

analysis.

Bernard J. Matkowsky, see Charles Knessl.

N. A. Papadakis, see A. N. Perakis.

A. N. Perakis is Associate Professor in the Department of Naval Architecture and Marine Engineering, Uni?

versity of Michigan, and Associate Research Scientist

at the Transportation Research Institute. He is inter-

ested in the application of probabilistic modeling and

optimization in marine transportation, and has

worked in the areas of optimal fteet deployment and

optimal ship weather routing since 1982. Since 1984, Professor Perakis has worked closely with Dr. N. A.

Papadakis in both areas, and was his Ph.D. thesis

supervisor. This paper is an outgrowth of the first part of Dr. Papadakis' dissertation. Dr. Papadakis is cur?

rently a postdoctoral research associate at MIT.



566 / Contributors

Colm A. O'Cinneide is Associate Professor of Statistics

at the University of Arkansas, Fayetteville, currently

visiting the Quantitative Business Analysis Depart? ment at Louisiana State University. He is studying

phase-type distributions and stochastic models based

on finite-state Markov chains. This paper focuses on

some of the complications that arise in going from

univariate phase-type distributions to the multivariate

case. It is largely based on a common theme in his

research: given partial information about a Markov

chain, what can be deduced about that chain?

Richard A. Sandbothe is Assistant Professor of Oper? ations Research Management at the State University of New York at Binghamton. His research interests

include production planning and scheduling, inven?

tory control, lot size models, and the evaluation of

manufacturing performance. This paper was part of a

doctoral dissertation written under the direction of

Gerald L. Thompson.

Gilles Savard, see Alain Haurie.

Herbert E. Scarf is the Sterling Professor of Econom-

ics at Yale University. Prior to joining Yale, he was

at The Rand Corporation and in the Department of

Statistics at Stanford University. His research interests

have included inventory theory, game theory, and

methods for computing the fixed points of a contin?

uous mapping. His current research is the study of

indivisibilities in production and algorithms for inte?

ger programming problems.

Michael H. Schneider is Assistant Professor in the

Department of Mathematical Sciences at Johns

Hopkins University. His research includes nonlinear

and combinatorial optimization, parallel computing,

graph theory and neural networks. Papers related to

the matrix balancing research described in this Journal

will appear (or have appeared) in Mathematics of

Operations Research, Mathematical Programming, and Linear Algebra and Its Applications.

Bruce Schmeiser, see Keebom Kang.

Zeev Schuss, see Charles Knessl.

Gerald L. Thompson is IBM Professor of Systems and

Operations Research in the Graduate School of In? dustrial Administration, Carnegie-Mellon University. His interests include large-scale linear and quadratic

programming, combinatorial optimization and math? ematical economics. A recent focus has been in solving combinatorial optimization problems on parallel computers.

Charles Tier, see Charles Knessl.

Rita Vachani, see Thomas Magnanti.

Randolph Nelson is Research Staff Member at the

IBM T. J. Watson Research Center, Yorktown

Heights, N.Y. His paper is based on investigation into the performance of timeshared scheduling. His

research interests are in computer performance

methodology.

P.-C. G. Vassiliou is a professor and A. C. Georgiou is a part-time faculty member in the Statistics and

Operations Research Section, Mathematics Depart?

ment, University of Thessaloniki, Greece. Their paper

grew out of Georgiou's doctoral dissertation. Their

research interests include nonhomogeneous Markov

systems, and this is the first paper in a series to study the novel aspect of controlling statistical equilibrium.

They presented some results of this research at the

17th European Meeting of Statisticians.

Douglas J. White, see Alain Haurie.

Uri Yechiali, see Sid Browne.

Stavros A. Zenios is Milken Foundation Assistant Professor of Decision Sciences at The Wharton

School, University of Pennsylvania. His research is in

parallel optimization for problems with network struc? tures and their applications. His interest in matrix

balancing problems was motivated by work he did for the World Bank on the estimation of social accounting matrices. Related papers on parallel optimization will appear in the ORSA Journal on Computing and

Annals of Operations Research.



OPERATIONS RESEARCH EDITORIAL POLICY

Operations Research publishes quality operations research and management science work of interest to the OR practitioner and researcher in three substantive

categories: methods, data based operational science, and the practice of OR. The Journal seeks papers re?

porting 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, history, policy, prac? tice, future, and arenas of application of operations research.

Complete studies that contain data, computer experi? ments, and model validation, and that integrate 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.

In addition to the regular ARTICLES section, there are three special sections: OR PRACTICE 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 Area Editor. The OR FORUM section publishes papers on history, policy, analyses of current and future trends, and related subject

matter. TECHNICAL NOTES contains brief articles on all of the topics covered by the Journal. For more infor? mation on subject coverage and editorial policy, see the Editorial and Area Editor statements published in the

January-February 1989 issue. All papers published in Operations Research are criti-

cally refereed. Initial refereeing of clear, concise, well written manuscripts normally takes about four months for papers of average length; generally a shorter time is needed for notes.

Decisions to publish manuscripts in Operations Re? search 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 context, importance, and possible fields of application ofthe material covered? Is it clearly, concisely, accurately and logically written? Could it benefit from condensation or expansion? Is its character clear from the 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?

It is to be understood that the final decision concerning publication rests with the Editor.

INSTRUCTIONS FOR CONTRIBUTORS

GENERAL CONSIDERATONS

Authors should submit four, double-spaced typewritten copies of manuscripts directly to the appropriate Area Editor. The copy must be clearly legible. Also needed are: a copyright transfer agreement, a statement of con?

tribution, and a cover letter. Papers not in the fields covered by the Area Editors (listed on the inside front cover of each issue) should be sent to

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

for assignment. 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 copy? right to ORSA. The form for this agreement is printed in most issues of this journal and is also available from the

Managing 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 manu?

script, is necessary under the 1978 U.S. Copyright Law in order for ORSA to continue disseminating operations research results as widely as possible.

Manuscripts will not be returned to an author unless

specifically requested, or unless reviewers have provided annotations that will be of use to the author.

The text should be arranged as follows: title page, abstract, introduction, main sections, appendix, acknowl-

edgment, and references. The appendix and acknowledgment need not be present.

Observe the following points in preparing manuscripts.



(Papers not conforming closely to these instructions will be returned to their authors for appropriate revisions.)

1. Statement of Contribution. Beginning in 1989, a statement of contribution is required for each submitted

paper. The form will appear in nearly every issue of the Journal and should be completed and submitted at the time a paper is sent to an Area Editor. The purpose of this statement is to aid area editors and reviewers in

determining if the paper meets its stated objectives. Once a paper is accepted for publication, this statement will serve as the basis for the In This Issue column.

When preparing this statement, include the following: Why is the topic that is addressed in the paper important? What specific contributions does the paper make to

operations research? What do you believe is the basis for

publication? Provide a brief assessment of the near and

long-term implications ofthe contribution.

Keep the statement brief, preferably fitting into the

space allocated on the printed form. Try not to overflow the page, however, a longer statement may be submitted if you believe that such an explanation is necessary. The statement should be expository and contain no mathe? matical notation. Attach one copy ofthe completed form to the submission. Failure to complete this item will

delay the start of the review process. 2. Readability. The abstract and the introduction of

every paper must be free of unnecessary jargon and

clearly readable by any ORSA member. These sections should be written in an expository style that will be

comprehensible to readers who are not technical experts in the subject matter.

3. Title Page. Each paper should have a title page that contains the authors' names and affiliation addresses. The usual acknowledgments should be placed in a separate section.

4. Abstract. Preface each article with a self-contained, one paragraph abstract that summarizes the problem and the principal results and conclusions. It should not con? tain formulas, references or abbreviations, nor exceed 200 words.

5. Introduction. The introduction must clearly state the problem, the results to be found in the paper and their significance to the OR community. It should not contain equations or mathematical notation. The intro? duction does not have a section heading or a number.

6. Main Sections. The main sections of the paper must be readable, the level of the mathematics and/or the terminology appropriate to the topic, and the material

logically presented. Begin section numbering and head-

ings with these sections.

7. Style. The message ofyour 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,

Howard Mumford Jones, and Lyle G. Boyd (New York:

McGraw-Hill, 1961). While the Editor and staff will correct minor lapses from good style in your manuscript, they cannot undertake wholesale revisions of poorly writ? ten papers. There is no a priori limit to the number of

pages for a paper; however, conciseness and clarity of

presentation are important publication criteria. 8. Spacing and Format. Double space manuscripts

throughout, including the abstract, subsidiary matter (list of captions, for example), and references. No line-printed computer printouts will be considered for publication. In

general, keep figures and tables to a minimum that is consistent with adequate presentation of the textual information.

Each page of the manuscript should be numbered. Indent the first line of each paragraph. Spelling and

hyphenation will follow Websters Third New Interna? tional Dictionary (unabridged).

9. Footnotes. Operations Research does not use foot?

notes; incorporate subsidiary material that would other? wise appear in footnotes in the main text, possibly in

parentheses or brackets, or place it in a Notes section at the end of the text, before the Acknowledgment and References. Designate notes by using superscript numerals placed in serial order throughout the text.

10. Acknowledgment. Place acknowledgments of

presentation, support and assistance in a final section that precedes the References, not on the title page.

11. 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 last name of the first author. Do not number the reference list. Double space this final section.

For journal references, give the author, year of pub? lication, title, journal name, volume, and pages?for example:

Flood, M. M. 1962. New Operations Research Poten- tials. Opns. Res. 10, 423-436.

For book references, give the author, year of publica? tion, title, publisher, city, and state?for example:

Morse, P. M., and G. E. Kimball. 1951. Methods of Operations Research. John Wiley, New York.

For references to working papers or dissertations cite the author, title, type of document, department, univer?

sity, and location, for example:



Rosenwein, M. 1986. Design and Application of Solution Methodologies to Optimize Problems in

Transportation Logistics. Ph.D. Dissertation. Depart? ment of Decision Sciences, University of Pennsylvania, Philadelphia.

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

fractions, e.g., a/(\ ? b) rather than- ; 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, and shown in a clearly inferior or superior position. The letter 1 and the numeral 1 and the letter O and the numeral 0, which are identical on most keyboards, should be iden? tified. Symbols and Greek letters should be identified

clearly: On their first occurrence, label unusual or ambig- uous symbols by marginal notes. The difference between

upper and lower case letters should be clear.

Display only those mathematical expressions that must be numbered for later reference or that need to be em-

phasized. Number displayed equations consecutively throughout the paper; do not number equations by sec? tion numbers. Appendix equations can be labeled Al, A2, etc. The numbers should be placed in parentheses to the right of the equation.

13. Reporting Computational Experience. In reporting computational experience on the efficiency of algo? rithms follow the guidelines given in Operations Re?

search, Volume 29, No. 2, "Reporting Computational Experience in Operations Research."

14. Tables. Tables should be numbered with roman

numerals, have a title, and be referred to sequentially in the text. Column headings should be brief and not use

abbreviations, if possible. Do not use vertical rules. The use of footnotes is encouraged; designate these by lower case letters. The submission of original tables suitable for

reproduction is not necessary; all tables will be typeset for consistency. Each table should be on a separate sheet and not interleaved in the text.

15. Figures. Line drawings should be prepared in black ink or preferably via a laser printer or plotter on white bond or vellum paper. For best results, fit the figure onto a 8'/2 X 11 inch sheet with at least a 1 inch margin all-around. Original drawings will be required on acceptance of a paper. Copies are sufficient for reviewers.

Lettering should be done on a computer, with a me- chanical lettering set or its equivalent. The figure should be of sufficient size so that after photoreduction, letters and numbers are legible.

Do not clutter the figure with information that makes it difficult to read. All details on the figures should be checked carefully because correction on galley proofs necessitates reshooting.

Each figure must be cited and will be placed in the order mentioned in the text. Each figure must have a

caption and a number (arabic). Do not place the caption on the original of the figure?these go on a separate list of captions. Do not differentiate between illustrations and figures.

Lines must be sufficiently thick to reproduce well, and decimal points, periods and dots must be sufficiently large to allow for reduction. The same type of lettering should be used for all figures. The figure and the lettering should be in proportion so that both can accommodate reduction. Do not use different sized type within a figure.

16. Subject Classification Scheme for the OR/MS Index. Determine the appropriate subject classifications

(up to 3) and accompanying descriptive phrases for all work submitted. A complete list of categories appears at the back of most issues; refer to the revised scheme as it

appears in Volume 37, No. 1 (January-February 1989) and in subsequent issues. 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 ofthe paper that is impor? tant but not apparent in the title.) The length of each

phrase, including phrases 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 and phrases must either appear on the title page of the manuscript (this is the preferred method), or authors may use the form provided (see the bottom half ofthe Copyright Transfer Agreement).

Do not repeat the subject classifications from the sub?

ject categories. The accompanying phrase should help to

further clarify the paper within a subject category. 17. Reprints. Operations Research does not have pa?

per 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, vol?

ume, number, year, intended purpose or use ofthe article

(book, journal, abstract, anthology, etc.) and estimated sale price of the work. Permission must first be obtained from the author(s) and 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 cov? ered 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.



STATEMENT OF CONTRIBUTION

Each time a paper is submitted to Operations Research, it should be accompanied by a Statement of Contribution.

The purpose of this statement is to help the area editor and the referees determine if a paper meets the stated

objectives. After a paper is accepted for publication, this statement will serve as the basis for the Tn This Issue"

column. This column appears in each issue of the Journal and precedes the presentation of articles. Prior to

acceptance, this statement will become part of a paper's file and will accompany the paper during the review

process.

When preparing this statement, include the following: Why is the topic addressed in your paper important? What specific contributions does the paper make to OR? What do you believe is the basis for publishing your

paper. Finally, provide a brief assessment of the near and long-term implications of your contribution.

Provide an answer to each question, preferably using the form provided below. If your statement overflows the

one paragraph space provided, use additional pages. Attach one copy of the completed statement, along with a

Copyright Transfer Agreement and Subject Classifieation form, to your submission. If you fail to complete the

Statement of Contribution, it may delay the start of the review process.

AUTHORS_

TITLE_

STATEMENT.



OPERATIONS RESEARCH

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 ofthe 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 ofthe 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

CATEGORY

DESCRIPTIVE

PHRASE

1.

2.

3.



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 Analysis of algorithms

Computational complexity Data structures Suboptimal algorithms

Communications Computers/computer

science Artificial intelligence Data bases Microcomputers Software System design/operation

Cost analysis Decision analysis

Applications Inference Multiple criteria Risk Sequential Systems Theory

Dynamic programming/ optimal control

Applications Deterministic Markov

Finite state Infinite state

Models SemiMarkov

Economics Econometrics Input-output analysis

Education systems Operations Planning

Engineering Environment Facilities/equipment

planning Capacity expansion Design Layout Location

Continuous Discrete Stochastic

Maintenance/replacement Finance

Asset pricing Capital budgets Capital rationing Corporate finance Depreciation Investment Investment criteria Management Portfolio Securities Taxation Working capital

Financial institutions Banks Brokerage/trading

Financial institutions (continued)

Insurance Investment

Forecasting Applications ARIMA processes Delphi technique Regression Time series

Games/group decisions Bargaining Bidding/auctions Cooperative Differential Gambling Nonatomic Noncooperative Stochastic Teams Voting/committees

Government Agencies Defense Elections Energy policies Foreign policy Programs Regulations Services Tax policy

Health care Ambulance service Blood bank Diagnosis Epidemiology Hospitals Pharmaceutical Treatment

Industries Agriculture/food Chemical Communications/journalism Computer/electronic Electric Hotel/motel Lumber/wood Machinery Mining/metals Petroleum/natural gas Pharmaceutical Recreation/sports Real estate Textiles/apparel Transportation/shipping

Information systems Analysis and design Decision support systems Expert systems Management

Inventory/production Applications Approximations/heuristics Multi-item/echelon/stage Operating characteristics

Inventory/production (continued)

Perishable/aging items Planning horizons Policies

Disposal/issuing Maintenance/replacement Marketing/pricing Review/lead times

Scale-diseconomies/smoothing Scale-diseconomies/lot-sizing Sensitivity analysis Uncertainty

Deterministic Stochastic

Judicial/legal Crime Crime prevention Law Penal system

Labor Libraries Manufacturing

Automated systems Performance/productivity Strategy

Marketing Advertising and media Buyer behavior Channels of distribution Choice models Competitive strategy Estimation/statistical

techniques Industrial marketing International marketing Marketing mix Measurement New products Pricing Product policy Promotion Retailing and wholesaling Salesforce Scaling methods Segmentation

Mathematics Combinatorics Convexity Functions Fixed points Piecewise linear Matrices Sets Systems solution

Military Cost effectiveness Defense systems Force effectiveness Logistics Personnel Search/surveillance Stochastic duels Tactics/strategy Targeting

Military (continued)

Warfare models Natural resources

Energy Land development Water resources

Networks/graphs Applications Distance algorithms Flow algorithms Generalized networks Heuristics Matchings Multicommodity Stochastic Theory Traveling salesman Tree algorithms

Organizational studies Behavior Decision making Design Effectiveness/performance Goals Information Leadership Manpower planning Motivation/incentives Personnel Productivity State-owned Strategy Structures

Philosophy of modeling Planning

Community Corporate Government Urban

Population Family planning

Probability Applications Clearing processes Crossing problems DifFusion Distribution comparisons Distributions Entropy Markov processes Random walk Renewal processes Regenerative processes Stochastic model

applications Production/scheduling

Applications Approximations/heuristic Cutting stock/trim Flexible manufacturing/

line balancing Learning Planning



Production/scheduling (continued)

Sequencing Deterministic

Single machine Multiple machine

Stochastic Professional

Addresses Comments on Humor/satire Journal policies Obituaries OR/MS education OR/MS implementation OR/MS philosophy OR/MS policy/standards

Programming Complementarity Fractional Geometric Infinite dimensional Integer

Algorithms Benders/decomposition Branch-and-bound Cutting plane/facet

generation Group Heuristic Relaxation/subgradient

Applications Nonlinear Theory

Interval Linear

Algorithms Applications Large scale systems Parametric Theory

Programming (continued)

Multiple criteria Nondifferentiable Nonlinear

Algorithms Applications Theory Unconstrained

Quadratic Stochastic

Project management CPM GERT PERT Resource constraints VERT

Queues Algorithms Applications Approximations Balking and reneging Batch/bulk Birth-death Busy period analysis Cyclic DifFusion models Feedback Limit theorems Markovian Multichannel Networks Nonstationary Optimization Output process Priority Simulation Statistical inference Tandem Transient results

Recreation and sports

Reliability Availability Coherent structures Failure models Inspection Life distributions Maintenance/repairs Multistate systems Quality control Redundancy/spares Replacement/renewal System safety Shock models

Research and development Innovation Project selection

Search and surveillance Simulation

Applications Design of experiments Efficiency Languages Random variable

generation Statistical analysis System dynamics

Space program Statistics

Analysis of variance Bayesian Censoring Cluster analysis Correlation Data analysis Design of experiments Estimation Nonparametric Pattern analysis Sampling Time series

Technology

Transportation Automobile Costs Freight/materials handling Fuel Mass transit Models

Assignment Network Location Traffic

Safety/injuries Scheduling

Personnel Vehicles

Taxis/limousines Travel

Mode/route choice Vehicle routing

Utility/preference Applications Estimation Multiattribute Theory Value theory



THE MINDS OF THE

FUTURE ARE TURNING

TO ORSA ...

Join the Operations Research Society

of America today!

If your chosen career involves operations research, then why not get involved in the Operations Research

Society of America, ORSA is the oldest and largest professional and scientific society in the United

States dedicated to the advancement of OR. Thousands of operations research professionals and

academicians have already realized the opportunities for networking, information exchange, and

camaraderie that exist with membership in ORSA. Join them today and get involved with the future

of"OR".

ATTENTION MEMBERS: To become involved in your field, join a technical section, special interest

group, or geographical section. Or contact the ORSA Business Office for a list of committees. We

need YOW

? Yes, I want to be involved in my chosen profession, operations research. I have enclosed the

appropriate dues payment as checked below. (Calendar year Jan. - Dec. 1990)

? Associate Member ($30) ? Student Member ($15)*

*Firstyear of Student Membership is $5. ? I am already a member. I would like information on opportunities for further involvement in ORSA.

? Enter my subscription to the journals checked below. I Have enclosed the appropriate payment.

MEMBER STUDENT*

? Journal on Computing ? Transportation Science

? Mathematics of OR

? Interfaces

? Marketing Science

? Operations Research Letters

? Stochastic Models* *Non U.S. residents please add $9.00

TOTAL PAID_._

NAME_.___

ADDRESS_._

CITY_STATE_ ZIR.

COMPANY NAME_

JOB TITLE___,_,_

TELEPHONE NO._._

*STUDENTS: Include faculty certification of student status with payment

I certify that this individual is at least a half-time student.

Professor_,_ Institution_._

Make checks payable to: ORSA Business Office, Mount Royal & Guilford Avenues, Baltimore, MD 21202 (301) 528-4146

9045



INVITE A FRIEND

First year student membership is only $5.00!

? Please enroll me as a new Associate/Student member

January to December 1990 * Membership includes a subscription to the Operations Research Journal,

OR/MS Today Newsletter, and much more!

ORSA PUBLICATIONS - Reduced Student Rates

D ORSA Journal on Computing 10.00 ? Transportation Science 7.50 D Interfaces 8.50 ? Mathematics of Operations Research 8.50 ? Marketing Science 12.50 ? Student Communications -0-

Total Paid

Name

Please remit payment to:

The Operations Research Society of America Mt. Royal & Guilford Avenues

Baltimore, MD 21202



The Operations Research Society of America introduces its new videotape?

"OPERATIONS RESEARCH + YOU = AN EXCITING CAREER"

Introduce students to career opportunities in

operations research! The videotape is available for $7.99 through the ORSA Business Office.

*Maryland residents add 5% tax (.40).

For more information contact:

THE OPERATIONS RESEARCH SOCIETY OF AMERICA Mt. Royal and Guilford Avenues

Baltimore, MD 21202

(301)528-4146



Second International Conference on Industrial and Applied Mathematics

ICIAM 91

?PSV JEHUH

?L .^??'V !!?

??? ^Bi.iJHr:iH Conference Topics

Presentations are solicited in all areas of applied and compu? tational mathematics, computer science, applied probability and statistics, scientific computing, and applications in engineer? ing and the biological, chemical, and physical sciences.

Sponsoring Societies

Gesellschaft fiirAngewandte Mathematik und Mechanik

Institute of Mathematics and Its Applications

Societa Italiana di Matematica Applicata e Industriale

Socieie de Mathematiques Appliquees et Industrielles

Society for Industrial and Applied Mathematics

With the cooperation of: Institut National de Recherche

en Informatique et en Automatique

HostedbySIAM

Local Attractions

Washington D.C. is a world

capital and an international

city. ICIAM 91 participants will have opportunities dur?

ing the conference to visit gov? ernment buildings, museums, and more than 100 well-known historic sites. Travelers to

Washington may enjoy the

city's stately memorials, the Smithsonian complex of 14 mu? seums and galleries (includ? ing the Air and Space Mu- seum), the Capitol Building, and the White House.

These are just a few of the historic sites, 80% of which offer free admission and are

open to the public seven days a week.

CALL FOR PAPERS

MinisymposJa Proposals

The ICIAM 91 Program Committee invites you, as a

potential organizer, to submit a proposal fora minisymposium.

A mirdsymposiiim is a session of 3-5 speakers focus-

ing on a single topic. Sessions may be scheduled for two or three hours. The organizer of a minisymposium invites the speakers and decides on the topics they are to address, If you would like to orgardze a minisymposium, you must submit a proposal on an ICIAM minisymposium form. Acceptance of proposals will be by decision of the ICIAM 91 Program Committee,

To obtain a form and guidelines for submittirtg a

mirdsymposium proposal, please check the appropriate box on the reply form and return it to SIAM promptly.

Deadline date pr minisymposia proposals: July 31,1990

Contributed Papers/Poster Presentations

Participate in ICIAM 91 by submitting a paper, which

you may present in a contributed paper session or as a

poster presentation. Authors will have approxunately 15 minutes to pres?

ent contributed papers, with an additional 5 minutes for

questions- Alternatively, they may elect posfeer presenta? tions, interactive diseussions with individuals irtterested in their work iUustrated with ffip charts and/or other vis? ual aids.

If you desire to contribute a paper or a poster presentation, you must submit a summary not exceeding 75 words on an ICIAM 91 contributed paper/poster presentation form* Papers will be reviewed by the program committee,

To obtain a form and guidelines for submitting a

paper, please check the appropriate box on the reply form and return it to SIAM promptly.

Deadlim date for suvmmimt ofwntributed paper/poster pres? entation forms: September 30, 2990

Registration Information and Announcements

To obtain future announcements, an invited speaker list, and ICIAM 91 program/registration informa? tion, complete the reply form below

and return it to SIAM promptly.

If you have questions about ICIAM 91, write to: ICIAM 91 Conference Manager c/o SIAM 3600 University City Science Center Philadelphia, PA 19104-2688, USA

E-mail: [email protected] Fax (Telecopy): (215)386-7999 Telephone: (215)382-9800

H Reply Form

Complete and return to: ICIAM 91 Conference Manager c/o SIAM, 3600 University City Science Center, Philadelphia, PA 19104-2688, USA

Please send me the following: Q Abstract form for a contributed

presentation or poster presentation Q Minisymposium proposal form Q Advaece registration material Q Preliminary program O Exhibitorkit

Fill in your name and address below or attach a separate sheet of paper if you need more space. Please print: Name._

Affiliation_

Dept._ Address

City__ State_ . Zip_ Country_

Phone^_)_ Fax( ) E-mail

T_ CCXC91"?R_J



Find out what leading economists in the decision

sciences have to say...

Contributions to Operations

Research and Economics

edited by Bernard Cornet and

Henry Tulkens

These original contributions by leading economists in the

decision sciences - operations research, game theory, econo-

metrics, and mathematical economics - show how the interac-

tions between each of these disciplines can enrich them all. 561 pp., 87 illus. $50.00

Contributors: Robert Aumann, Paul Champsaur, Wemer

Hildenbrand, Bernard Cornet, Roger Guesnerie, John

Roberts,Thomas Magnanti, John Mitchell, Michael Todd, Michael Ball, Wei-guo Liu, William Pulleyblank, Olivier

Janssens de Bisthoven, Etienne Loute, Adrian Pagan, David

Hendry, Jean-Frangois Richard, Anton Barten, Jean-Pierre

Florens, Michel Mouchart, Peter Kooiman, Pierre Malgrange The MIT Press 55 Hayward Street

Cambridge, MA 02142

ANNOUNCEMENT

Schedule of Future ORSA / TIMS Meetings

1990

1991

1991

1992

October 28-31 philadelphia, pa Chairman Benjamin Lev Department of Management 100 Institute Road Worcester Polytechnic Institute Worcester, MA 01609

Contributed paper deadline: May 1, 1990

WYNDHAM HOTEL

NASHVILLE, TN OPRYLAND HOTEL MAY 12-15 Chairman Michael Beasley Dover Elevator Corporation P.O. Box 6400 Home Lake, MS 38637

Tentative contributed paper deadline: November 9, 1990

NOVEMBER 3-6 ANAHEIM, CA HILTON Chairman Carlton Scott Graduate School of Management

april 26-29 Chairman Bill Swart Industrial Engineering Department University of Central Florida

Authors wishing to present a paper should use the form in the Call for Papers which is mailed to all members of ORSA and TIMS. Additional copies of the Call for Papers may be obtained about eight months before each meeting from: Driscoll & Associates, 12 Rockcrest Circle, Rockville, MD 20851, (301) 738-7903. All questions regarding the meeting should be addressed to the General Chairperson of that meeting.

University of California

ORLANDO, FL

Irvine, CA 92717

MARRIOTT WORLD CENTER



Our Term Life Insurance Plan is custom-

designed for members of our profession. What's

more, each policy can then be tailored to suit

your individual needs. As these needs change, so can the policy?and it can stay with you no

matter how often you change jobs. Our group purchasing power helped us to

negotiate top quality insurance, at a very low

price. To take advantage of this benefit of member?

ship, call 1-800-424-9883 for further

details (in Washington, D.C. call 457-6820).

ORSA INSURANCE

Designed by Members.

For Members. The ORSA Life Plan is underwritten by New York Life

Insurance Company, New York, New York 10010 on form number GMR.



ASSOCIATE EDITORS

Agha Iqbal Ali University of Massachusetts

Egon Balas Carnegie-Mellon University

Karl Heinz Borgwardt Universitaet Augsburg

Michael Carter University of Toronto

Teodor Crainic University ofQuebec, Montreal

Jacques Desrosiers GERAD, Ecole des HEC

Gregory Dobson University of Rochester

A. Federgruen Columbia University

Robert D. Foley Georgia Institute of Technology

Robert Fourer Northwestern University

Terry L. Friesz University of Pennsylvania

Yigal Gerchak University of Waterloo

Stanley Gershwin Massachusetts Institute of Technology

Donald Goldfarb Columbia University

Alan J. Goldman Johns Hopkins University

Winfried K. Grassmann University of Saskatchewan

Steven Hackman Georgia Institute of Technology

Philip Heidelberger IBM T. J. Watson Research

Center Peter Jackson

Cornell University Mark E. Johnson

Georgia Institute of Technology

Edward Kaplan Yale University

W. David Kelton University of Minnesota

Peter C. Kiessler Clemson University

Paul R. Kleindorfer University of Pennsylvania

Vijay Krishna Harvard Business School

Hau L. Lee Stanford University

Thomas M. Liebling Ecole Polytechnique Federale

de Lausanne Timothy Lowe

University oflowa Hirofumi Matsuo

University ofTexas at Austin Donald C. McNickle

University of Canterbury Douglas R. Miller

George Mason University Rolf H. Mohring

Technische Universitaet, Berlin Barry Nelson

Ohio State University Henry Nuttle

North Carolina State University Amedeo R. Odoni

Massachusetts Institute of Technology Michael L. Pinedo

Columbia University Hasan Pirkul

Ohio State University Stephen M. Pollock

University ofMichigan Evan L. Porteus

Stanford University Alexander H. G. Rinnooy Kan

Erasmus University

Donald B. Rosenfield Massachusetts Institute of Technology

Leslie David Servi G TE Laboratories

J. George Shanthikumar University of California, Berkeley

C. M. Shetty Georgia Institute of Technology

David B. Shmoys Massachusetts Institute of Technology

Marius M. Solomon Northeastern University

Ralph E. Steuer University of Georgia

Lawrence D. Stone Metron, Inc.

Charles S. Tapiero Hebrew University

Henk Tijms Vrije Universiteit

Devanath Tirupati University ofTexas at Austin

Roger Tobin GTE Laboratories

Mark Turnquist Cornell University

Alan R. Washburn Naval Postgraduate School

Chelsea C. White III University of Virginia

Laurence A. Wolsey CORE

N. Keith Womer University of Mississippi

Martin A. Wortman Texas A&M University

Paul H. Zipkin Columbia University

OR PRACTICE ASSOCIATE EDITORS

James Bookbinder University of Waterloo

Thomas M. Cook American Airlines, Inc.

Dale O. Cooper Dale Cooper Consulting

Mark J. Eisner Exxon Company International

Saul Gass University of Maryland

Alan Gleit Citicorp Mortgage, Inc.

Clarence Haverly Haverly Systems

David S. P. Hopkins Stanford University

Ernest Koenigsberg University of California, Berkeley

John Lastivica First National Bank ofBoston

Mark Lembersky Innovis Interactive Technologies

Marc Mangel University of California, Davis

Peter A. Morris Applied Decision Analysis, Inc.

James G. Root Westport, Connecticut

Stephen A. Smith University ofSanta Clara

Thomas C. Varley Management Consulting and

Research, Inc. Albert C. Williams

Rutgers University Paul Wyman

Wyman Associates

The Journal of the Operations Research Society of America



OPERATIONS RESEARCH

Volume 38 May-June 1990 Number 3

CONTENTS

IN THIS ISSUE

OR FORUM

Mathematical Programming and Economic

Theory Herbert E. Scarf

OR PRACTICE

A Decision Support System for Prioritizing Oil and Gas Exploration Activities

James S. Dyer, Richard N. Lund, John B. Larsen, V. Kumar and Robert P. Leone

ARTICLES

Optimizing Simulation for Policy Analysis in a Residential Energy End-Use Model

Daniel M. Hamblin, Jeannie C. Johnson and Judith Killen

Multilocation Facility Modernization: Models and Heuristics

L. G. Mason, A. Girard and X. D. Gu

Deterministic Minimal Time Vessel Routing Nikiforos A. Papadakis and Anastassios N. Perakis

A Comparative Study of Algorithms for Matrix Balancing

Michael H. Schneider and Stavros A. Zenios

A Strong Cutting Plane Algorithm for Production Scheduling With

Changeover Costs T. L. Magnanti and R. Vachani

A Forward Algorithm for the Capacitated Lot Size Model With Stockouts

Richard A. Sandbothe and Gerald L. Thompson

Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time

Lee A. Herrbach and Joseph T.-T. Leung

374 Scheduling Deteriorating Jobs on a Single Processor 495

Sid Browne and Uri Yechiali

Convexity Properties of the Erlang Loss 377 Formula 499

Arie Harel

An Analytical Approach to the M/G/2 Queue 506

C. Knessl, B. J. Matkowsky, Z. Schuss and 386 C. Tier

On the Limitations of Multivariate Phase-

Type Families 519 Colm Art O'Cinneide

397

412

426

439

456

474

Minimum Cost Routing on Stochastic Networks 527

G. A. Corea and V. G. Kulkarni

Asymptotically Attainable Structures in

Nonhomogeneous Markov Systems 537 P.-C. G. Vassiliou and A. C. Georgiou

TECHNICAL NOTES

Graphical Methods for Evaluating and

Comparing Confidence-interval Procedures 546 Keebom Kang and Bruce Schmeiser

A Note On: An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem 553

A. Haurie, G. Savard and D. J. White

Computational Difficulties of Bilevel Linear

Programming 556 Omar Ben-Ayed and Charles E. Blair

Heavy Traffic Response Times for a Priority Queue With Linear Priorities 560

Randolph D. Nelson

CONTRIBUTORS 564

Cover Illustration: An extremal using the

boundary ofthe constraint set. From 487 "Deterministic Minimal Time Vessel Routing''

by Papadakis and Perakis, page 433.

The Journal of the Operations Research Society of America



Date post:	09-Jan-2017
Category:	Documents
Upload:	hakhuong
View:	214 times
Download:	2 times

Back Matter

Documents