ebook img

Operations Research 1991: Vol 39 Index PDF

15 Pages·1991·4.3 MB·English
by  
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Operations Research 1991: Vol 39 Index

INDICES TO VOLUME 39: 1991 AUTHOR INDEX a Bean, James C., John R. Birge, John Mittenthal and Charles E. Noon, Matchup Scheduling With Multiple Aboudi, Ronny. and George L. Nemhauser, Some Resources, Release Dates and Disruptions, 470-483 Facets for an Assignment Problem With Side Bean, James C., see Noon and Bean, 623-632 Constraints, 244-250 Bertsimas, Dimitris J., and Garrett Van Ryzin, A Adler, I., and S. Cosares, A Strongly Polynomial Stochastic and Dynamic Vehicle Routing Problem in Algorithfmo r a Special Class of Linear Problems, the Euclidean Plane, 601-615 955-960 Birge, John R., see Bean et al., 470-483 Ahmadi, Reza H., and Christopher S. Tang, An Boender, C. G. E., R. J. Caron, J. F. McDonald, A. H. Operation Partitioning Problem for Automated G. Rinnooy Kan, H. E. Romeijn, R. L. Smith, J. Assembly System Design, 824-835 Telgen and A. C. F. Vorst, Shake-and-Bake Ahmadi, Reza H., and Hirofumi Matsuo, The Line Algorithmfso r Generating Uniform Points on the Segmentation Problem, 42-55 Boundary of Bounded Polyhehra, 945-954 Altinkemer, Kemal, and Bezalel Gavish, Paralle/ Boros, Endre, see Prekopa and Boros, | 19-129 Savings Based Heuristicfso r the Delivery Problem, Boxma, O. J., and G. A. P. Kindervater, A Queueing 456-469 Network Model for Analyzing a Class of Branch-anda- Aneja, Y. P., see Prasad, Nair and Aneja, 407-414 Bound Algorithms on a Master-Slave Architecture, Anily, S., and A. Federgruen, Structured Partitioning 1005-1017 Problems, 130-149 Bradley, Gordon A., see Kent et al. (OR Practice), Anily, S, and A. Federgruen, Capacitated Two-Stage 13-27 Multi-Item Production/Inventory Model With Joint Burd, Stephen D., and Suleiman K. Kassicieh, Decision Setup Costs, 443-455 Supporfto r Supercomputer -icquisition (OR Practice), Anily, Shoshana, Multi-Item Replenishment and 366-377 Storage Problem (MIRSP): Heuristics and Bounds, Burns, Richard N., see Emmons and Burns, 484-495 233-243 Buss, A. H., see Jacobson, Buss and Schruben, 917-924 Aragon, Cecelia R., see Johnson et al., 378-406 Arkin, Esther M., and Robin O. Roundy, Weighted- Cc Tardiness Scheduling on Parallel Machines With Proportional Weights, 64-81 Carpenter, Tamra J., see Lustig, Mulvey and Avenhaus, R., H. P. Battenberg and B. J. Falkowski, Carpenter, 757-770 Optimal Data Verification Tests, 341-348 Caron, R. J., see Boender et al., 945-954 Carraway, Robert L., see Chambers et al., 639-647 Chambers, Robert J., Robert L. Carraway, Timothy J. Lowe and Thomas L. Morin, Dominance and Back, Harry B., see Keefer, Smith and Back (OR Decomposition Heuristics for Single Machine Practice), 28-41 Scheduling, 639-647 Bajgier, Steve M., Hazem D. Maragah, Michael S. Changyu, Wang, see Qingzhen et al. (OR Practice), Saccucci, Andrew Verzilli and Victor R. Prybutok, 194-205 Introducing Students to Community Operations Chen, Bintong, see Kraay, Harker and Chen, 82-99 Research Through the Use of a City Neighborhood as Chen, C. K., see Hooker, Garfinkel and Chen, 100-118 a Living Laboratory (OR Forum), 701-709 Chuanjiang, Wang, see Qingzhen et al. (OR Practice), Balas, Egon, and Matthew J. Saltzman, An Algorithm 194-205 for the Three-Index Assignment Problem, 150-161 Corner, James L., and Craig W. Kirkwood, Decision Baltic, Tony, see Hof and Baltic (OR Practice), 543-552 Analysis Applications in the Operations Research Bannister, C. H., and R. J. Kaye, A Rapid Method for Literature, 1970-1989 (OR Practice), 206-219 Optimization of Linear Systems With Storage, Cosares, S., see Adler and Cosares, 955-960 220-232 Cyert, Richard M., Knowledge and Economic Bare, B. Bruce, see Kent et al. (OR Practice), 13-27 Development (OR Forum), 5-8 Battenberg, H. P., see Avenhaus, Battenberg and D Falkowski, 341-348 Baughman, Martin L., see Kwun and Baughman, Dietrich, Brenda L., A Taxonomy of Discrete 798-806 Manufacturing Systems (OR Practice), 886-902 1030 INDICES TO VOLUME 39: 1991 AUTHOR INDEX a Bean, James C., John R. Birge, John Mittenthal and Charles E. Noon, Matchup Scheduling With Multiple Aboudi, Ronny. and George L. Nemhauser, Some Resources, Release Dates and Disruptions, 470-483 Facets for an Assignment Problem With Side Bean, James C., see Noon and Bean, 623-632 Constraints, 244-250 Bertsimas, Dimitris J., and Garrett Van Ryzin, A Adler, I., and S. Cosares, A Strongly Polynomial Stochastic and Dynamic Vehicle Routing Problem in Algorithfmo r a Special Class of Linear Problems, the Euclidean Plane, 601-615 955-960 Birge, John R., see Bean et al., 470-483 Ahmadi, Reza H., and Christopher S. Tang, An Boender, C. G. E., R. J. Caron, J. F. McDonald, A. H. Operation Partitioning Problem for Automated G. Rinnooy Kan, H. E. Romeijn, R. L. Smith, J. Assembly System Design, 824-835 Telgen and A. C. F. Vorst, Shake-and-Bake Ahmadi, Reza H., and Hirofumi Matsuo, The Line Algorithmfso r Generating Uniform Points on the Segmentation Problem, 42-55 Boundary of Bounded Polyhehra, 945-954 Altinkemer, Kemal, and Bezalel Gavish, Paralle/ Boros, Endre, see Prekopa and Boros, | 19-129 Savings Based Heuristicfso r the Delivery Problem, Boxma, O. J., and G. A. P. Kindervater, A Queueing 456-469 Network Model for Analyzing a Class of Branch-anda- Aneja, Y. P., see Prasad, Nair and Aneja, 407-414 Bound Algorithms on a Master-Slave Architecture, Anily, S., and A. Federgruen, Structured Partitioning 1005-1017 Problems, 130-149 Bradley, Gordon A., see Kent et al. (OR Practice), Anily, S, and A. Federgruen, Capacitated Two-Stage 13-27 Multi-Item Production/Inventory Model With Joint Burd, Stephen D., and Suleiman K. Kassicieh, Decision Setup Costs, 443-455 Supporfto r Supercomputer -icquisition (OR Practice), Anily, Shoshana, Multi-Item Replenishment and 366-377 Storage Problem (MIRSP): Heuristics and Bounds, Burns, Richard N., see Emmons and Burns, 484-495 233-243 Buss, A. H., see Jacobson, Buss and Schruben, 917-924 Aragon, Cecelia R., see Johnson et al., 378-406 Arkin, Esther M., and Robin O. Roundy, Weighted- Cc Tardiness Scheduling on Parallel Machines With Proportional Weights, 64-81 Carpenter, Tamra J., see Lustig, Mulvey and Avenhaus, R., H. P. Battenberg and B. J. Falkowski, Carpenter, 757-770 Optimal Data Verification Tests, 341-348 Caron, R. J., see Boender et al., 945-954 Carraway, Robert L., see Chambers et al., 639-647 Chambers, Robert J., Robert L. Carraway, Timothy J. Lowe and Thomas L. Morin, Dominance and Back, Harry B., see Keefer, Smith and Back (OR Decomposition Heuristics for Single Machine Practice), 28-41 Scheduling, 639-647 Bajgier, Steve M., Hazem D. Maragah, Michael S. Changyu, Wang, see Qingzhen et al. (OR Practice), Saccucci, Andrew Verzilli and Victor R. Prybutok, 194-205 Introducing Students to Community Operations Chen, Bintong, see Kraay, Harker and Chen, 82-99 Research Through the Use of a City Neighborhood as Chen, C. K., see Hooker, Garfinkel and Chen, 100-118 a Living Laboratory (OR Forum), 701-709 Chuanjiang, Wang, see Qingzhen et al. (OR Practice), Balas, Egon, and Matthew J. Saltzman, An Algorithm 194-205 for the Three-Index Assignment Problem, 150-161 Corner, James L., and Craig W. Kirkwood, Decision Baltic, Tony, see Hof and Baltic (OR Practice), 543-552 Analysis Applications in the Operations Research Bannister, C. H., and R. J. Kaye, A Rapid Method for Literature, 1970-1989 (OR Practice), 206-219 Optimization of Linear Systems With Storage, Cosares, S., see Adler and Cosares, 955-960 220-232 Cyert, Richard M., Knowledge and Economic Bare, B. Bruce, see Kent et al. (OR Practice), 13-27 Development (OR Forum), 5-8 Battenberg, H. P., see Avenhaus, Battenberg and D Falkowski, 341-348 Baughman, Martin L., see Kwun and Baughman, Dietrich, Brenda L., A Taxonomy of Discrete 798-806 Manufacturing Systems (OR Practice), 886-902 1030 Author Index: 1991 / 1031 Doverspike, R. D., Algorithmfso r Multiplex Bundling Hochbaum, Dorit S., and Ron Shamir, Strongly in a Telecommunications Network, 925-944 Polynomial Algorithms for the High Multiplicity Scheduling Problem, 648-653 E Hodges, James S., Six (Or So) Things You Can Do With a Bad Model (OR Forum), 355-365 Emmons, Hamilton, and Richard N. Burns, Off-Day Hof, John, and Tony Baltic, A Multilevel Analysis of Scheduling With Hierarchical Worker Categories, Production Capabilities of the National Forest System 484-495 (OR Practice), 543-552 Evans, James R., see Rogers et al., 553-582 Hooker, J. N., R. S. Garfinkel and C. K. Chen, Finite Dominating Sets for Network Location Problems, a 100-118 Hum, Sin Hoon, and Rakesh K. Sarin, Simultaneous Falkowski, B. J., see Avenhaus, Battenberg and Product-Mix Planning, Lot Sizing and Scheduling at Falkowski, 341-348 Bottleneck Facilities, 296-307 Federgruen, A., see Anily and Federgruen, | 30-149; 443-455 Federgruen, A., see Zheng and Federgruen, 654-665 Ittimakin, Prawit, Stationary Waiting Time Field, Richard C., see Kent et al. (OR Practice), 13-27 Distribution of aQ ueue in Which Customers Require Fleming, Philip J., and Burton Simon, Jnterpolation a Random Number ofS ervers, 633-638 Approximations of Sojourn Time Distributions, 251-260 J Fossett, Christine A., Dale Harrison, Harry Weintrob Jacobson, S. H., A. H. Buss and L. W. Schruben, and Saul I. Gass, An Assessment Procedurfeo r Driving Frequency Selectiofno r Frequency Domain Simulation Models: A Case Study (OR Practice), Simulation Experiments, 917-924 710-723 Jiang, J., and S. P. Sethi, A State Aggregation Approach to Manufacturing Systems Having Machine G States With Weak and Strong Interactions, 970-978 Gallagher, Mark A., and Elizabeth J. Kelly, A New Joneja, Dev, Multi-Echelon Assembly Systems With Methodologfyo r Military Force Structure Analysis Nonstationary Demands: Heuristics and Worst Case (OR Practice), 877-885 Performance Bounds (Technical Note), 512-518 Johnson, David S., Cecilia R. Aragon, Lyle A. Garfinkel, R. S., see Hooker, Garfinkel and Chen, McGeoch and Catherine Schevon, Optimization by 100-118 Simulated Annealing: An Experimental Evaluation; Gass, Saul I., see Fossett et al. (OR Practice), 710-723 Part II, Graph Coloring and Number Partitioning, Gavish, Bezalel, see Altinkemer and Gavish, 456-469 378-406 Glasserman, Paul, Structural Conditionfso r Perturbation Analysis Derivative Estimates: Finite K Time Performance Indices, 724-738 Goldberg, Jeffrey, and Ferenc Szidarovszky, Methods Kao, Edward P. C., see Ittimakin and Kao, 633-638 for Solving Nonlinear Equations Used in Evaluating Kassicieh, Suleiman K., see Burd and Kassicieh (OR Emergency Vehicle Busy Probabilities, 903-916 Practice), 366-377 Green, Linda, Peter Kolesar and Anthony Svoronos, Kaye, R. J., see Bannister and Kaye, 220-232 Some Effects of Nonstationarity on Multiserver Keefer, Donald L., F. Beckley Smith, Jr. and Harry B. Markovian Queueing Systems, 502-511 Back, Development and Use of aM odeling System to Aid a Major Oil Company in Allocating Bidding Capital (OR Practice), 28-41 H Kella, Offer, Optimal Manufacturing of a Two Product Hakimi, S. Louis, see Labbe and Hakimi, 749-756 Mix, 496-501 Hall, Nicholas G., and Marc E. Posner, Earliness- Kelly, Elizabeth J., see Gallagher and Kelly (OR Tardiness Scheduling Problems, I: Weighted Practice), 877-885 Deviation of Completion Times About A Common Kent, Brian, B. Bruce Bare, Richard C. Field and Due Date, 836-846 Gordon A. Bradley, Natural Resource Land Hall, Nicholas G., Wieslaw Kubiak and Suresh P. Management Planning Using Large-Scale Linear Sethi, Earliness-Tardiness Scheduling Problems, IT: Programs: The USDA Forest Service Experience With Deviation of Completion Times About a Restrictive FORPLAN (OR Practice), 13-27 Common Due Date, 847-856 Kindervater, G. A. P., see Boxma and Kindervater, Harker, Patrick T., see Kraay, Harker and Chen, 82-99 1005-1017 Harrison, Dale, see Fossett et al. (OR Practice), Kirkwood, Craig W., see Corner and Kirkwood (OR 710-723 Practice), 206-219 1032 / INpIcEs TO VOLUME 39: 1991 Klein, Rachelle S., and Hanan Luss, Minimax Resource McGeoch, Lyle A., see Johnson et al., 378-406 Allocation With Tree Structured Substitutable McGinnis, Leon F., see Lofgren, McGinnis and Tovey, Resources, 285-295 992-1004 Kolesar, Peter, see Green, Kolesar and Svoronos, Mercure, Helene, see Labbe, Laporte and Mercure, 502-511 616-622 Kolstad, Charles D., and Lars Mathiesen, Computing Michelot, C., see Lefebvre, Michelot and Plastria, Cournot-Nash Equilibria, 739-748 437-442 Kouvelis, Panagiotis, and Hau L. Lee, Block Angular Mittenthal, John, see Bean et al., 470-483 Structures and the Loading Problem in Flexible Mitra, Debasis, and Isi Mitrani, Analysis of a Kanban Manufacturing Systems, 666-676 Disciplinfeo r Cell Coordination in Production Lines, Kraay, David, Patrick T. Harker and Bintong Chen, IT: Stochastic Demands, 807-823 Optimal Pacing of Trains in Freight Railroads: Mitrani, Isi, see Mitra and Mitrani, 807-823 Model Formulation and Solution, 82-99 Moinzadeh, Kamran, and Charles P. Schmidt, An Kubiak, Wieslaw, see Hall, Kubiak and Sethi, 847-856 (S-1,S) Inventory System With Emergency Orders, Kwun, Y. H., and Martin L. Baughman, Joint Optimal 308-321 Planning of Industrial Cogeneration and Moodie, Douglas R., see McClain and Moodie Conventional Electricity Systems, 798-806 (Technical Note), 857-860 Morin, Thomas L., see Chambers et al., 639-647 L Morrison, Donald G., and David C. Schmittlein, How Labbe, Martine, and S. Louis Hakimi, Market and Many Forecasters Do You Really Have? Mahalanobis Locational Equilibriufmo r Two Competitors, Provides the Intuition for the Surprising Clemen and 749-756 Winkler Result (Technical Note), 519-523 Labbe, Martine, Gilbert Laporte and Héléne Mercure, Mosheiov, Gur, V-Shaped Policiefso r Scheduling Capacitated Vehicle Routing on Trees, 616-622 Deteriorating Jobs, 979-991 Labbe, Martine, Jacque-Francois Thissé and Richard Mulvey, John M., see Lustig, Mulvey and Carpenter, E. Wendell, Sensitivity Analysis in Minisum Facility 757-770 Location Problems, 961-969 Laporte, Gilbert, see Labbe, Laporte and Mercure, 616-622 Nagurney, Anna, Equilibrium Modeling, Analysis and Lee, Hau L., see Kouvelis and Lee, 666-676 Computation: The Contributions of Stella Dafermos Lefebvre, O., C. Michelot and F. Plastria, Sufficient (OR Forum), 9-12 Conditionfso r Coincidence in Minisum Multifacility Nair, K. P. K., see Prasad, Nair and Aneja, 407-414 Location Problems With a General Metric, 437-442 Nelson, Barry L., see Yang and Nelson, 583-591 Little, John D. C., Operations Research in Industry: Nemhauser, George L., see Aboudi and Nemhauser, New Opportunities in a Changing World (OR 244-250 Forum), 531-542 Noon, Charles E., see Bean et al., 470-483 Lofgren, Christopher B., Leon F. McGinnis and Craig Noon, Charles E., and James C. Bean, A Lagrangian A. Tovey, Routing Printed Circuit Cards Through an Based Approach for the Asymmetric Generalized Assembly Cell, 992-1004 Traveling Salesman Problem, 623-632 Lovejoy, William S., Computationally Feasible Bounds Oo for Partially Observed Markov Decision Processes, 162-175 Ozekici, Suleyman, and Stanley R. Pliska, Optimal Lowe, Timothy J., see Chambers et al., 639-647 Scheduling of Inspections: A Delayed Markov Model Luss, Hanan, see Klein and Luss, 285-295 With False Positives and Negatives, 261-273 Lustig, Irvin J., John M. Mulvey and Tamra J. P Carpenter, Formulating Two-Stage Stochastic Programfso r Interior Point Methods, 757-770 Posner, Marc E., see Hall and Posner, 836-846 Plante, Robert D., see Rogers et al., 553-582 Plastria, F., see Lefebvre, Michelot and Plastria, Maragah, Hazem D., see Bajgier et al. (OR Forum), 437-442 701-709 Pliska, Stanley R., see Ozekici and Pliska, 261-273 Mathiesen, Lars, see Kolstad and Mathiesen, 739-748 Prasad, V. Rajendra, K. P. K. Nair and Y. P. Aneja, Matsuo, Hirofumi, see Ahmadi and Matsuo, 42-55 Optimal Assignment of Components to Parallel-Series McClain, John O., and Douglas R. Moodie, A and Series-Parallel Systems, 407-414 Comment on ‘Buffer Space Allocation in Automation Prekopa, Andras, and Endre Boros, On The Existence Assembly Lines’ (Technical Note), 857-860 of a Feasible Flow in a Stochastic Transportation McDonald, J. F., see Boender et al., 945-954 Network, 119-129 Author Index: 1991 / 1033 Prybutok, Victor R., see Bajgier et al. (OR Forum), Thisse, Jacque-Francois, see Labbe, Thissé and 701-709 Wendell, 961-969 Thomas, Lawrence Dale, Commonality Analysis Using Q Clustering Methods (Technical Note), 677-679 Qingzhen, Zhao, Wang Changyu, Zhang Zhimin, Zhang Thomas, Lyn C., and Alan R. Washburn, Dynamic Yunxiang and Wang Chuanjiang, The Application of Search Games, 415-422 Operations Research in the Optimization of Tovey, Craig A., see Lofgren, McGinnis and Tovey, Agricultural Production (OR Practice), 194-205 992-1004 Vv Rinnooy Kan, A. H. G., see Boender et al., 945-954 Van de Panne, Cornelis, Decentralization for Romeijn, H.'E., see Boender et al., 945-954 Multidivision Enterprises, 786-797 Rogers, David F., Robert D. Plante, Richard T. Wong Van Dijk, Nico M., Truncation of Markov Chains With and James R. Evans, Aggregation and Disaggregation Applications to Queueing, 1018-1026 Techniques and Methodology in Optimization, Van Ryzin, Garrett, see Bertsimas and Van Ryzin, 553-582 601-615 Roundy, Robin O., see Arkin and Roundy, 64-81 Vera, Jorge, see Weintraub and Vera, 776-785 Ss Verzilli, Andrew, see Bajgier et al. (OR Forum), 701-709 Saccucci, Michael S., see Bajgier et al. (OR Forum), Vorst, A. C. F., see Boender et al., 945-954 701-709 Saltzman, Matthew J., see Balas and Saltzman, WwW 150-161 Washburn, Alan R., see Thomas and Washburn, Sarin, Rakesh K., see Hum and Sarin, 296-307 415-422 Schevon, Catherine, see Johnson et al., 378-406 Wein, Lawrence M., Brownian Networks With Schmidt, Charles P., see Moinzadeh and Schmidt, Discretionary Routing, 322-340 308-321 Weintraub, Andrés, and Jorge Vera, A Cutting Plane Schmittlein, David C., see Morrison and Schmittlein Approach for Chance Constrained Linear Programs, (Technical Note), 519-523 776-785 Schruben, L. W., see Jacobson, Buss and Schruben, Weintrob, Harry, see Fossett et al. (OR Practice), 917-924 710-723 Sethi, S. P., see Jiang and Sethi, 970-978 Wendell, Richard E., see Labbe, Thisse and Wendell, Sethi, Suresh P., see Hall, Kubiak and Sethi, 847-856 961-969 Shamir, Ron, see Hochbaum and Shamir, 648-653 White, John A., An Existence Theorem for OR/MS Shulman, Alexander, An Algorithm for Solving (OR Forum), 183-193 Dynamic Capacitated Plant Location Problems With Wolff, Ronald W., On Finite Delay-Moment Conditions Discrete Expansion Sizes, 423-436 in Queues, 771-775 Simon, Burton, see Fleming and Simon, 251-260 Wong, Richard T., see Rogers et al., 553-582 Smith, F. Beckley, Jr., see Keefer, Smith and Back (OR bi Practice), 28-41 Smith, R. L., see Boender et al., 945-954 Yang, Wei-Ning and Barry L. Nelson, Using Common Sounderpandian, Jayavel, Value Functions When Random Numbers and Control Variates in Multiple- Decision Criteria Are Not Totally Substitutable, Comparison Procedures, 583-591 592-600 Yu, Po. L., Habitual Domains, 869-876 Svoronos, Anthony, see Green, Kolesar and Svoronos, Yunxiang, Zhang, see Qingzhen et al. (OR Practice), 502-511 194-205 Szidarovszky, Ferenc, see Goldberg and Szidarovsky, Z 903-916 T Zheng, Yu-Sheng, and A. Federgruen, Finding Optimal (s, S) Policies is About as Simple as Evaluating a Tamaki, Mitsushi, A Secretary Problem With Uncertain Single Policy, 654-665 Employment and Best Choice of Available Zhimin, Zhang, see Qingzhen et al. (OR Practice), Candidates, 274-284 194-205 Tang, Christopher S., see Ahmadi and Tang, 824-835 Zipkin, Paul H., Computing Optimal Lot Sizes in the Telgen, J., see Boender et al., 945-954 Economic Lot Scheduling Problem, 56-63 1034 / INDICES TO VOLUME 39: 1991 SUBJECT INDEX The subject index conforms to the categories established in The OR/MS Index, 1952-1976, 1976-1981 and 1982-1987. The 1952-1976 cumulative index was compiled by Kneale T. Marshall and F. Russell Richards, the 1976-1981 cumulative index was compiled by Jon W. Tolle and Richard E. Stone, and the 1982-1987 cumulative index was compiled by Jon W. Tolle. The indices were published in 1978, 1983 and 1988 by the Institute of Management Sciences and the Operations Research Society of America. A Dynamic programming/optimal control Jiang, J., stochastic, continuous time, 970-978 Accounting Ozekici, S., semi-Markov inspection scheduling Avenhaus, R., inspector leadership game, 341-348 model, 261-273 Agriculture Qingzhen, Z., optimization of production structure, 194-205 E Analysis of algorithms Economics Anily, S., worst case bounds, 233-243 Cyert, R. M., addresses, 5-8 Lofgren, C. B., complexity, bounds, and heuristic Nagurney, A., solution of equilibrium problems, 9-12 performance, 992-1004 Engineering Artificial intelligence Thomas, L. D., systems optimization, 677-684 Burd, S. D., artificial intelligence, 366-377 c = Communications Facilities/equipment planning Doverspike, R. D., telecommunications transmission Doverspike, R. D., capacity expansion of networks, 925-944 telecommunications equipment, 925-944 Computers/computer science Kwun, Y. H., industrial cogeneration and Boxma, O. J., master-slave architecture, 1005-1017 conventional electricity systems, 798-806 Colin, J. Y., task allocation on distributed memory Labbé, M., competitive location, 749-756 processors, 680-684 Shulman, A., multiperiod facilties location planning, Hochbaum, D. S., strongly polynomial algorithms, capacity expansion, 423-436 648-653 Facilities/equipment planning, continuous location Lefebvre, O., coincidence properties in minisum D multifacility location, 437-442 Decision analysis Facilities/equipment planning, location Avenhaus, R., data verification occurring in Labbé, M., minisum facility location model, 961-969 accounting, 341-348 Forecasting Morrison, D. G., theory, 519-523 Morrison, D. G., applications, 519-523 Yu, P. L., high-stake decision making and conflict resolution, 869-876 G Decision analysis, applications Corner, J. L., survey of applications, 206-219 Games/group decisions Keefer, D. L., allocation of capital in bidding for Kolstad, C. D., noncooperative and differential, leases, 28-41 739-748 Dynamic programming Games/group decisions, bidding/auctions Lovejoy, W. S., partially observed Markov decision Keefer, D. L., bidding systems for offshore oil and gas processes, 163-175 leases, 28-41 Dynamic programming, applications Games/group decisions, gambling Tamaki, M., the secretary problem; the marriage Thomas, L. C., active sonar search, 415-422 problem, 274-284 Games/group decisions, noncooperative Dynamic programming, determinist:. Avenhaus, R., arms control and others, is formulated Bannister, C. H., rapid, exact dynamic programming, as, 341-348 220-232 Labbé, M., two-stage games, 749-756 Hall, N. G., earliness and lateness costs, 836-846 Government Dynamic programming, Markov Burd, S. D., government, 366-377 Lovejoy, W. S., Bayesian programming and infinite Government, defense state Markov models, 163-175 Fossett, C. A., use of combat models, 710-723 Subject Index:1991 / 1035 H McClain, J. O., buffer storage capacity allocation, 857-860 Health care, ambulance service Marketing Goldberg, J., evaluating busy probabilties, 903-9 16 Little, J. D. C., measurement, 531-542 Health care, diagnosis Izekici, S., stochastic model for optimal medical Mathematics Mitra, D., fixed points, 807-823 screening, 261-273 Mathematics, combinatorics Johnson, D. S., number partitioning heuristics, 378-406 Industries Mathematics, fixed points Cyert, R. M., addresses, 5-8 Goldberg, J., fixed point methods for nonlinear Little, J. D. C., general, 531-542 equations, 903-916 Industries, electric Military Kwun, Y. H., joint optimal planning with industrial Hodges, J. S., warfare models, 355-365 cogenerators, 798-806 Military, antisubmarine warfare Information systems Thomas, L. C., active sonar search, 415-422 Burd, S. D., management, 366-377 Military, cost effective Inventory/production Gallagher, M. A., force tradeoff analysis, 877-885 Ahmadi, R. H., manufacturing and automated Military, force effectiveness systems, 824-835 Gallagher, M. A., conventional and nuclear force Anily, S., storage space requirement in automated capability assessment, 877-885 warehouses, 233-243 Military, targeting Hum, S. H., product-mix planning, 296-307 Gallagher, M. A., generic targets for large-scale Joneja, D., multi-echelon assembly systems, 512-518 conventional analysis, 877-885 Kella, O., deterministic, single machine, 496-501 Mitra, D., approximations, heuristics and policies, 807-823 Natural resources Moinzadeh, K., emergency replenishment, 308-321 Hof, J., multilevel analysis of the National Forest Inventory/production, deterministic models System, 543-552 Anily, S., EOQ with annual linear cost for storage Networks/graphs space, 233-243 Aboudi, R., matchings, 244-250 Inventory/production, multi-item Ahmadi, R. H., heuristics, 824-835 Zipkin, P. H., economic lot scheduling, 56-63 Bertsimas, D. J., stochastic, traveling salesman, Inventory/production, multi-item, echelon stage 601-615 Anily, S., policies for two-stage capacitated multi-item Hooker, J. N., location on networks, 100-118 models, 443-455 Labbé, M., location, 749-756 Inventory/production, policies Nagurney, A., equilibrium modeling and Moinzadeh, K., order for order policy, 308-321 computation, 9-12 Zheng, Y., efficient algorithm for optimal (s, S) Prékopa, A., stochastic transportation networks, policy, 654-665 119-129 Inventory/production, stochastic Networks/graphs, flow algorithms Zheng, Y., efficient algorithm for optimal (s, S) Hochbaum, D. S., greedy algorithms for policy, 654-665 transportation, 648-653 Networks/graphs, heuristics ‘ Doverspike, R. D., network design optimization, 925- 944 Labor Johnson, D. S., graph coloring heuristics, 378-406 Emmons, H., manpower scheduling, 484-495 Networks/graphs, matchings Balas, E., three-dimensional, 150-161 Networks/graphs, traveling salesman Manufacturing Noon, C. E., generalized TSP model, 623-632 Dietrich, B. D., taxonomy of systems; review of .e] models, 886-902 Lofgren, C. B., process planning for circuit card Organizational studies assembly, 992-1004 Van de Panne, C., decision making and design, Manufacturing, automated systems 786-797 Ahmadi, R. H., populating printed circuit boards, Organizational studies, manpower planning 42-55 Emmons, H., scheduling, 484-495 1036 / INDICES TO VOLUME 39: 1991 OR/MS education Production/scheduling, hierarchical planning Bajgier, S.M ., community OR/MS, 701-709 Jiang, J., manufacturing with unreliable machines, 970-978 Production/scheduling, planning P Ahmadi, R. H.,formation of dedicated lines, 42-55 Philosophy of modeling Professional Yu, P. L., habitual domains in decision making and Cyert, R. M., addresses, 5-8 problem solving, 869-876 Hodges, J. S., comments on, 355-365 Planning, government Little, J. D. C., address, 531-542 Kent, B., comprehensive planning for national forests, White, J. A., addresses, 183-193 13-27 Professional, OR/MS implementation Probability Kent, B., forest service implementation of operations Bertsimas, D. J., stochastic model, 601-615 research effort, 13-27 Mitra, D., stochastic model applications, 807-823 Professional, OR/MS philosophy Prékopa, A., applications of sharp probability Yu, P. L., expanding and enriching OR habitual inequalities, 119-129 domains for success, 869-876 Probability, Markov processes Programming Jiang, J., hierarchical control of Markov process Bean, J. C., infinite dimensional, 470-483 driven systems, 970-978 Boxma, O. J., analysis of parallel branch-and-bound Probability, stochastic model, applications algorithms, 1005-1017 Izekici, S., optimal inspection schedule model, Labbé, M., sensitivity analysis, 961-969 261-273 Shulman, A., dynamic programming, Lagrangian Production/scheduling relaxation, 423-436 Ahmadi, R. H., approximations/heuristics, 42-55 Programming, integer Arkin, E. M., weighted-tardiness scheduling with Aboudi, R., applications and cutting plane proportional weights, 64-8 | algorithms, 244-250 Bannister, C. H., optimal utilization of storage, Altinkemer, K., Langrangian relaxation for delivery 220-232 problems, 456-469 Bean, J. C., approximations, heuristic; applications, Kouvelis, P., algorithms, 666-676 470-483 Programming, integer, algorithms Colin, J. Y., scheduling with interprocessor Balas, E., primal heuristics, 150-161 communication delays, 680-684 Programming, integer, relaxation/subgradient Emmons, H., manpower scheduling, 484-495 Noon, C. E., efficient relaxation, 623-632 Hall, N. G., deterministic sequencing; single machine, Programming, linear 836-846 Bannister, C. H., fast optimization of linear systems, Hochbaum, D. S., sequencing, deterministic, single 220-232 machine, 648-653 Lustig, I. J., techniques for stochastic linear Hum, S. H., bottleneck facilities, 296-307 programs, 757-770 Joneja, D., heuristics with error bounds, 512-518 Programming, linear, algorithms Kella, O., deterministic, single machine, 496-501 Adler, I., strong polynomality, 955-960 Kouvelis, P., flexible manufacturing; planning, Klein, R. S., minimax algorithm for substitutable 666-676 resources, 285-295 Kraay, D., scheduling of rail traffic, 82-99 Programming, linear, applications Mosheiov, G., deterministic sequencing, single Kent, B., linear programming and forest planning, machine, 979-991 13-27 Wein, L. M., routing and sequencing in a stochastic Programming, linear, integer job shop, 322-340 Rogers, D. F., aggregation/disaggregation and Production/scheduling, applications surrogate programming, 553-582 Klein, R. S., allocation of manufacturing resources, Programming, nonlinear applications 285-295 Kraay, D., heuristic for large-scale, mixed integer Production/scheduling, approximations/heuristics convex programs, 82-99 Chambers, R. J., single machine sequencing, 639-647 Programming, nonlinear convex Rogers, D. F., large-scale models, 553-582 Weintraub, A., chance constrained programming, Production/scheduling, deterministic 776-785 Chambers, R. J., dominance and decomposition Programming, quadratic heuristics, 639-647 Zipkin, P. H., application to production scheduling, Hall, N. G., single machine sequencing, 847-856 56-63 Subject Index: 1991 / 1037 Programming, stochastic Ss Lustig, I. J., solution by interior point methods, 757-770 Search and surveillance Thomas, L. C., active sonar search, 415-422 Q Simulation Queues Fossett, C. A., assessment of models, 710-723 Anily, S., structured set partitioning problems; Glasserman, P., gradient estimation techniques, algorithms, 130-149 724-738 Boxma, O. J., fluid flow approximations, 1005-1017 Jacobson, S. H., design of experiments; factor Glasserman, P., sample path analysis and screening; frequency domain methods, 917-924 optimization, 724-738 Simulation, applications Ittimakin, P., random number of servers; waiting Johnson, D. S., optimization by simulated annealing, time distribution, 633-638 378-406 Wein, L. M., Brownian models of network scheduling Simulation, random variable generation problems, 322-340 Boender, C. G. E., generating aymptotically uniform Wolff, R. W., effect of arrival process on delay points on the boundary of a polytope, 945-954 moments; regeneration, 771-775 Simulation, statistical analysis Queues, approximations Yang, W., variance reduction, 583-591 Fleming, P. J., interpolation approximations, Statistics 251-260 Keefer, D. L., statistical models for winning in Goldberg, J., nonlinear equation approximation offshore lease bidding, 28-41, models, 903-916 Yang, W., multiple comparisons, 583-591 Queues, limit theorems Statistics, cluster analysis Fleming, P. J., \ight traffic and heavy traffic, 251-260 Rogers, D. F., aggregation process, 553-582 Queues, Markovian Thomas, L. D., variance methods, 677-679 Van Dijk, N. M., truncations, 1018-1026 T Queues, multichannel Markovian Green, L., effects of nonstationarity, 502-511 Transportation Queues, networks Bertsimas, D. J., vehicle routing, 601-615 Adler, I., generalized, exploiting special structure, Kraay, D., control of freight railroad traffic, 82-99 955-960 Laporte, G., vehicle routing, 616-622 Queues, nonstationary Nagurney, A., formulation and solution of Green, L., behavior as a function of nonstationarity, multimodal problems, 9-12 502-511 Transportation, vehicle routing Queues, optimization Noon, C. E., routing with alternatives, 623-632 Balas, E., subgradient optimization with facet defining cutting planes, 150-161 U Queues, simulation Utility/preferences, applications McClain, J. O., finite storage capacity in tandem Corner, J. L., survey of applications, 206-219 queues, 857-860 Utility/preference, multiattribute Queues, tandem Sounderpandian, J., maximin and minisum value McClain, J. O., finite storage capacity allocation, functions, 592-600 857-860 Utility/preference, value theory Van Dijk, N. M., finite approximations, 1018-1026 Sounderpandian, J., axiomatic derivation of value functions, 592-600 R Reliability Vv Prasad, V. R., optimal allocation of components in reliability systems, 407-414 Vehicle routing Prékopa, A., availability analysis in power systems, Altinkemer, K., heuristics for vehicle routing, 119-129 456-469 CONTENTS, VOLUME 39: 1991 Number 1 January-February 1991 IN THIS ISSUE Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem OR FORUM Paul H. Zipkin Weighted-Tardiness Scheduling on Parallel Knowledge and Economic Development Machines With Proportional Weights Richard M. Cyert Esther M. Arkin and Robin O. Roundy Equilibrium Modeling, Analysis Optimal Pacing of Trains in Freight and Computation: The Contributions of Railroads: Model Formulation and Solution Stella Dafermos David Kraay, Patrick T. Harker and Anna Nagurney Bintong Chen Finite Dominating Sets for Network Location OR PRACTICE Problems J. N. Hooker, R. S. Garfinkel and Natural Resource Land Management C. K. Chen Planning Using Large-Scale Linear Programs: On the Existence of a Feasible Flow in a The USDA Forest Service Experience With FORPLAN Stochastic Transportation Network Andras Prékopa and Endre Boros Brian Kent, B. Bruce Bare, Richard C. Field and Gordon A. Bradley Structured Partitioning Problems S. Anily and A. Federgruen Development and Use of a Modeling System to Aid a Major Oil Company in Allocating An Algorithm for the Three-Index Bidding Capital Assignment Problem Egon Balas and Matthew J. Saltzman Donald L. Keefer, F. Beckley Smith, Jr., and Harry B. Back Computationally Feasible Bounds for Partially Observed Markov Decision ARTICLES Processes William S. Lovejoy The Line Segmentation Problem Reza H. Ahmadi and Hirofumi Matsuo CONTRIBUTORS Number 2 March-April 1991 IN THIS ISSUE 180 OR PRACTICE The Application of Operations Research in OR FORUM the Optimization of Agricultural Production Zhao Qingzhen, Wang Changyu, An Existence Theorem for OR/MS Zhang Zhimin, Zhang Yunxiang and John A. White Wang Chuanjiang

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.