Keyword index volumes 64–71 (1993)

European Journal of Operational Research 71 11993) 473-478 North-Holland

473

Keyword Index Volumes 64-71 (1993) Activity networks, (64) 199, (65) 274 Adaptive processes, (66) 27, (69) 83 Advertising effectiveness, (67) 321 Agency theory, (69) 143 Aggregate production, (65) 199 Aggregation, (64) 103, (70) 212 Aggregation technique, (69) 259 Agriculture, (67) 161, (69) 221 AHP, (67) 64 AIDS, (70) 167 Airfreight, (70) 159 Air transportation, (64) 138 Algebraic languages, (67) 25 Algorithm, (68) 344, (68) 422 Algorithms, (64) 61, (66) 259 Allocation, (66) 272 Analytical hierarchy process, (66) 291 Analytic hierarchy process, (65) 138, (68) 160, (70) 263 Analytic Hierarchy Process (AHP), (69) 200 Applications, (66) I, (68) 278, (69) I Applications of lranspor(alion prol)lem, (70) 335 Apl)l'oximalion algorithm. (()5) 247 Approximation algorithms. (70) 342 Approximation scheme, (64) 2S8 Arbitrage. ((')8) 304 Artificial Intelligence. (64) 21. (70) I, (71) 247 Artificial neural networks, (66) 27, (6~)) 83 Assembly line, (71) 353 Assignment, (70) 254. (71) 177, (71) 188 Assortment, (64) 423 Augmented Lagrangian multipliers, (69) 498 Automated guided vehicles, (71) 32 Availability (,joint), (68) 90 Backlogs, (64) 12 Backorder costs, (65) 175 Balking, (66) 113 Batch delivery, (70) 272 Batching, (66) 135 Batch processing, (68) 105 Batch production, (67) 358 Batch size, (70) 83 Beale's algorithm, (67) 126 Behavior, (67) I

Behaviour support, (70) 67 Benchmarks, (64) 278 Benders' decomposition, (67) 428, (67) 443 Bibliography. (68) 278 Bicriteria assignment. (68) 422 Bidimensional knapsack problem, dichotomic search, surrogate dual. (68) 413 Bi-direcfional flow. (71) 32 Bilevel linear programming. (67) 126 Binary trees, (64) 442 Blocking, (69) 467 Blocking phenomenon, (65) il8 Boolean matrix, (67) 405 Bottleneck assignment, (68) 422 BPERT, (68) 185 Branch-and-bound, (64) 249. (65) 147 Branch and bound, (65) 407, (68) 251, (70) 22g, (71) 130, (71) 334 Branch-and-bound algorithms. (65) 368 Broadcasting, (71) I Buffer, (60) 166 Bnfl'er allocation, (69) 450 Cancer risk, (h6) 36 Capacilaled facility location, (66) 3()5, (70) 150 Capacity assignment, (67) 428 Capacity planning, (67) 321 Capacity selection. (69) 373 Case study. (65) 159 Cash dividends. (68) 318 Cash flows. (68) 318 Cell formation. (69) 292 Cell size determination. (69) 373 Cellular layout. (69) 399 Celhllar manufacturing. (67) 405, (69) 312, (69) 33(), (69) 342, (69) 357. (69) 413, (69) 438 Celhllar nmnufacturing cell layout. (69) 284 Cellular Manufilcturing Sy~;tems,({)9) 450 Centre, ((')5) 400 CIv,ms, (68) 145 Chebychev norm. (68) 344 Chinese postman problem, (65) 218 Circuit groupi,:g,(67) 443 Classes of processors, (70) 316 Clique polytope, (69) 121

0377-2217/93/$06.00 © 1993, Elsevier Science Publishers B.V. All rights reserved

Closed queueing networks, (69) 250 Closed queuing networks, (67) 373 Cluster analysis, (64) 103, (69) 384 Coalitions, (64) 442, (64) 449 Coefficient of variation, (65) 235 Coherent structure, (69) 65 Collision detection, (65) 343 Combat model, (67) I I l Combat nomogram, (67) I I 1 Combinationaial analysis, (66) 392 Combinatorial analysis, (64) 410, (66) 353 Combinatorial optimization, (64) 278, (65) 68, (69) 238 Common due date, (70) 272 Communication, (70) 67 Communication networks, (67) 428, (67) 443 Communications, (66) IIR) Competitive location, (66) 372 Complexity, (70) !15, (70) 254 Complexity amdysis, 107) 248 Complexity results, (70) 350 Complexity status of regular performance m e a s u r e s . (71) 366 ('oml~ulalional analysis, (68) 4(X). ( 71 ) 17, 171) 7O Conlputational complexity, (64) 138, (6t)) ~)59 Computer networks. 171) I Computers, (68) 400 Computer software. (04) 354 Condorcet point, (66) 372 Construction, (69) 131 Container transportation, (65) 368 Continuous time lotsizing with time-prop portional demand, (69) 154 (,'ontrol. (67) 75. 171) 235 Controllal~le limes, (70) 335 Control variates. 171) 80 Convex cost, (64) 286 Convexity, (65) 270 Convex programming, (65) 40Z (7 ! ) 235 Coopeative games, (64) 442 Cooperative games, (64) 449 Coordinated transportation systems, (66) 341 Coordinalion, (67) 141 Corporate earnings, (68) 318 Cost-benefit analysis, (66) 392 Cost minimizing assignment, (68) 422

474 Costs, (64) 457 Cost trade-offs, (64) 83 Covering problems. (65) 20 C-programming. (67) 172 Crashing. (64) 286 Crew scheduling, (71) 303 Critical path. (64) 229, (67) 221, (71) 70 Cutting-plane, (69) 121 Cyclic scheduling. (70) 350 Damage counters. (65) 235 Data base management, (64) 21 Database management. (64) 370 Data envelopment analysis. (64) 61, (67) 332. (71) 379 Decision. (64) 384, (66) 216. (68) 236, (68) 374. (71) 398 Decision aid. (66) 184 Decision analysis. (70) 135 Decision making. (66) 72 Decisions under risk. (70) 135 Decision support systems. (68) 173. (70) 150. (71) 341 Decision theory. (65) 138, (66) 184. (66) 235. (67) 1. (67) 64. (69) 210. (70) 263 Decomposition. (67) 373 Degeneracy. (68) 427 Degrees of difficulty. (68) 427 Delivery dates. (64) 12 Departure process. (65) 247 Design. (67) 13, (71) 353 Deterministic inventory model. (64) 370 Development planning. (08) 100 Dift~rential ¢quafl ,-~s, (6~) 278 Direction bias, (6%*~287 Direct shipping. (64) 83 Di~aggregation, (64) 103 Dtscrtminant analysis, (t,7) 88 Olstances, (67) 287 Distributed computing systems, (67) 418 Distribution, (64) 457. (65) 362, (66) 313, (70) 31 Dominance cone, (64) 126 Dorn's duality, (65) 417 Dose-response relationship, (66) 36 Duality. (67) 136, (68) 379, (68) 427. (71) 61 Dueodate assignment, (70) 311 Due date assignment procedures. (68) 212 Dynamic, (71) 188 Dynamic events. (69) 424 Dynamic flow equilibrium, (71) 419 Dynamic programming. (64) 199, (64) 354, (05) 199. (66) 113. (67) IM. (67) 172. (67) 188. (68) 105, (68) i34, (71) 303, (71) 439 Ecoio~, (~4) 2 Economic analysis, (64) 354 Economic eft]ciency, (67) 321

Keyword Index

-

Volumes 64-71

Economic order quantity, (70) 104 Economics, (66) 89, (67) 161, (69) 177, (71) 45 Effective arrival rate, (67) 321 Effective capacity, (67) 321 Effective utilization factor, (67) 321 Efficiency estimation, (67) 332 Efficient chains, (66) 392 Election systems, (70) 254 Empirical statistics, (65) 278 Empty flow balancing, (65) 368 Energy., (64) 2, (69) 26, (71) 334 Entropy, (71) 45 Environment, (70) 16 Epidemiological model, (70) 167 Epistemology, (66) 161, (66) 168 Equilibrium, (66) 372, (71) 188 Equilibrium assignment, (71) 269 Evaluation of staffing alternatives, (67) 321 EVPI approach, (67) 344 Experimental design, (70) 289 Expert systems. (65) 292. (68) 278. (70) 1 Exponential distribution. (65) 118 Extended formulations. (71) 95 Facets, (67) 204 Facility expansion. (67) 321 Facility location. (65) 20, (66) 279 Facility siting. (65) 147 Failure-free operation time, (65) 259 Fatigue failures. (65) 235 Faultqolerant routing, (71) I Feedback queering networks, (7!) 353 Field theow, (69) 14 Finance. (67) 259, ({;7) 2t~7. (68) 304. (68) 318 Finite buffers, (68) 69 Finite queues. (65) 118 Fishing industry, (64) 338 Fixed job scheduling, (64) 138 Fixed job times, (70) 316 Fleet management, (65) 368 Flexible integrated cellular manufacturing, (69) 399 Flexible manufacturing. (69) 373 Flexible manufacturing systems, (67) 373. (69) 166, (69) 384, (69) 450, (70) 212 Flow balancing, (64) 68 Flow optimization, (71) 317 Flowshop, (64) 249 Flow shop, (69) 330 Flowshop, (69) 4f~7 Flow shop scheduling, (70) 342 Flowshops, openshops and jobshops, (70) 350 Flow time variance, (7{)) 289 FMS, (f~) I, (67) 387, (71) 17 Forecasting, (68) 291 Fractal curves, (69) 244

Fractional programming, (68) 352 Future research, (66) 1, (09) 1 Futures, (68) 304 Fuzzy clustering, (69) 284 Games. (69) 177. (71) 419. (71) 439 Generalized assignment, (64) 103 Generalized derivatives. (65) 327 General repair, (69) 75 Genetic algorithms. (70) 289 Geometric, (68) 400 Geometrical approximation. (68) 356 Geometric modelling, (65) 343 Geometric programming, (64) 354, (68) 427 Girting index, (70) 405 Glass industry, (68) 9 Global optimization, (65) 314 Goal programming, (67) 101, (68) 160, (70) 191, (71) 379 Goodsflow control, (70) 159 Gossiping, (71) 1 Government subsidies. (7 I) 454 Gradient methods, (65) 321, (66) 27 Graphs, (70) 229 Graph theory, (67) 405 Greedy heuristic, (71) 130 Grouped set-up, (70) 177 Group scheduling. (69) 467 Group technology, (67) 405. (69) 284. (69) 312, (69) 342, (69) 384. (69) 438 Growth phenomena, (69) 14 Guidepath, (71) 32 Hazardous material, (65) ,13 tleadway, (66) 113 Health care policy and management, (70) 167 Health services, (70) 191 Hegemonic cycles/structures, (69) 14 Heuristic, (67) 387, (70) 379 Heuristic algorithm, (69) 467 Heuristic algorithms, (70) 365 Heuristic optimization methods, (69) 65 He,ristic procedures. (65) 336 FIeur~stic reasoning, (65) 292 lte~:~%t~¢,~, *'~) 295, (64) 423. (65) 68, (66) 313, (66) 331. (67) 5Z (67) 443, (~,~) 105, (68) 3.~9. (68~ 400. (69) 238, (69) 292, (69) .~,4, (70) 43, (70) 229, (71) 17 Heuristic scheduling,, ~,04; I¢,~ Hierachical decoinposiiio~ (04) 312 Hierarchical decomposition, (70) 212 Historical measures, (71) 45 History, (65) 278 Horae position, (71) 32 Hypergraph, (66) 353

Keyword hzdex - Volumes 6 4 - 7 1

Implementation, (66) 216 Implied constraints, (71) 61 Impossibility zone, (67) 111 Imputations, (64) 449 Industrial competition, (68) 9 Information, (66) 72, (70) 199, (71) 39{,, (71) 419 Information economics, (69) 143 Information System-analysis and design, (70) 244 Inquiry system, (64) 21 Inspection, (68) 236, (68) 251, (68) 265 Integer, (65) 362 Integer goal programming, (66) 272 Integer linear programming, (69) 121 Integer programming, (64) 188, (65) 147, (65) 218, (66) 272, (67) 418, (68) 344, (6t~) 244, (69) 373, (71) 17, (71) 120, (71) 222 Integration, (67) 358, (69) 1 Intelligence structures, (69) 14 Intensity function, (68) 90 Interactive method, (64) 115 Interactive procedures, (71) 341 Interval arithmetic, (65) 314 Inventory, (64) 83, (65) 175, (66) 52, (66) 124, (68) 23, (68) 49, (68) 120, (68) 134, (69) 177, (70) 104, (70) 199, (71) 110 Inventory control, (67) 358 Investments, (67) 259 Iterative approximations, (70) 212 lterative SOR method, (68) 69 Jobbing production, (69) 399 Job sequencing, (66) 65 Job shop, (69) 187 Job-shop scheduling, (64) 156 Job shop scheduling, (68) 212 Jount replenishment problem, (64) 370 Judgement, (68) 291 Just-in-time, (66) 259 Knap sack, (64) 410 Knowledge base, (69) 357 Knowledge structures, (69) 14 Koch, (69) 244 Kondratiev cycles/structures, (69) 14 Kuhn-Tucker conditions, (67) 126 Labelling algorithms, (69) 97 LAD estimation, (67) 272 Lagrangean heuristic, (65) 383 Lagrangean multipliers, (70) 229 Lagrangean relaxation, (65) 187 Lagrangian duality, (65) 417 Lagrangian heuristic, (66) 305 Lagrangian method, (67) 172 Lagrangian relaxation, (67) 387, (69) 154 Lanchester's equation, (65) 278 Large scale programming, (64) 103

Layout, (64) 410 Lead time, (65) 96, (68) 185 Lead time allowance, (68) 212 Learning, (66) 27, (69) 83 Learning curves, (68) 334 Learning systems, (69) 14 Lifetime quantile, (65) 235 Likelihood ratio ordering, (65) 175 Linear and mixed binary integer programming, (70) 52 Linear fractional programming, (67) 136 Linear inequalities, (67) 204 Linear programming, (64) 68, (65) 147, (65) 343, (66) 353, (67) 75. (67) 88, (67) 136, (67) 443, (68) 356, (68) 379, (70) 126 Linear programming, (71) 61 Linear statistical models, (67) 88 Linear-time algorithm, (70) 391 Iv-norm, (67) 287 Local, (71) 120 Location, (65) 383, (65) 400, (70) 16 Location analysis, (65) 147 Location theory, (66) 305 Looped networks, (67) 248 Lot-sizing, (68) 134 LOt sizing, (71) 95 Lot-sizing problem, (65) 159 Lower bound, (64) 156 Low-income developing country, (68) 160 Machine grouping, (69) 357 Machine interference problem, (65) 259 Machine scheduling, (70) 432 Machine usage penalty time(ion, (70) 391 Machining, (65) 351 Maintenance, (69) 38 Make-to-order, (64) 12 Makeqo~order production, (69) 399 Make-toostock production. (69) 399 Management, (66) 235, (67) 75, (67) 161 Management science, (70) 83 Manufacturing, (64) 45, (65) 362, (67) 297, (68) 9, (68) 105, (69) 50 Manufacturing cells, (69) 424, (69) 482 Manufacturing industries, (64) 12, (66) 279, (68) 265, (69) 26, (69) 292 Marie's method, (69) 250 Marketing, (66) 2% (68) 9 Market response functions, (66) 27 Marker chains, (66) 124, (71) 70 Marker decision, (69) 265 Marker decision process, (70) 405 Marker decision processes, (67) 188 Marker decision programming, (64) 38, (65) 175, (69) 75 Marker processes, (68) 228, (69) 92, (71) 110 Matching behavior, (71) 454 Material handling, (71) 353 Material Handling System, (69) 166

475 Materials, (64) 423 Mathematical programming, (64) 61, (64) 363, (65) 292, (65) 351, (66) 291, (66) 341, (67) 52, (6."~ 242, (67) 387, (69) 154, (70) 1, (70) 425, (71) 61, (71) 154, (71) 177 Mathematical programming modeling systems, (67) 25 Matrices, (69) 107 Matrix generators, (67) 25 Matrix geometric form, (65) 118 Matrix structure, (64) 216 Mean, (69) 265 Measurement, (67) 332, (68) 318 Median, (65) 400 Medical history, (71) 45 Metamodels, (69) 424 Military, (65) 278, (69) 50 Milk, (69) 221 Minimal repair, (69) 75 Mixed-integer programming, (64) 338, (70) 150 Mixed integer programming, (71) 257 Mixed-model assembly lines, (66) 259 Modal choice, (71) 288 Model assessment, (66) 250 Model choice, (66) 36 Modeling, (66) 161, (66) 216, (66) 235, (68) 9 Modelling, (66) 184 Model management, (71) 398 Model validation, (66) 168 Moving averages, (67) 272 MRP, (68) 49 Muiticommodity Iocation~allocation moo dels, (65) 368 Multicommodity problems, (71) 398 Multicriteria. (66) 291 Multi criteria am~lysis, (6t~) 184 Mid(i-criteria analysis, (70) 16 Multi-echelon, (68) 49 Multi-level inventory system, (65) 96 Multilevel job shops, (68) 212 Multi-level location, (71) 130 Multi.machine scheduling, (70) 335 Multiobjective. (65) 33 Multiobjective programming, (68) 173 Multi-plant, (67) 141 Multiple criteria, (64) 384, (65) 58, (66) 148. (67) I, (68) 344. (68) 352, (70) 115 Multiple-criteria, (68) 379 Multiple criteria decision-making, (67) 101 Multiple criteria linear programming, (64) 126, (71) 341 Multiple criteria programming, (68) 356, (70) 244, (71) 205 Multiple objective (criteria) linear programming. (68) 374 Multiple objectives, (68) 344 Multiple organization processes, (70) 67

476 Multiple routings. (69) 292 Multi-project planning, (64) 312 Multi-server queues. (65) 270 Multivariate statistical models. (71)80 Multivariate statistics. (67) 101, (67) 332 Nash equilibrium. (71) 454 National decline. (69) 14 Necessary optimality conditions, (65) 327 Net present value. (64) 188, (65) 274 Network, (65) 33. (66) 372. (66) 392. (69) 97. (71) 188. (71) 419 Network decomposition. (71) 1 Network design. (71) 95 Network flows. (71) 398 Network planning. (70) 159 Network programming. (65) 218. (66) 279 Networks. (65) 44. (65) 400. (66) 148. (67) 52, (6q) 92. (71) 154, (71) 177 Networks with gains. (64) 68 Neural networks. (69) 342 r~ew aircraft systems. (66) 124 Newsboy problem, (68) 185 Nitrate pollution, (66) 36 Nondifferentiable optimization. (65) 327. (71) 439 Nonlinear d~namical systems, (68) 145 Nonlinear integer programming. (66) 259 Nonlinear mixed integer programming. (69) 399 Nonlinear mnltiobjectiv¢ programming. (64) 115 N(mlinear optimization, (65) 292. (60) 3¢) Nonlinear programming. (t)5) 321, (6,~) 351. (07) 13. (68) 265. (69) 83, (71) 61 Non=linear programming. (07) 272 Nonseparable, (67) 172 Nonserial dynamic programming. ((~7) 248 Noowait flowshop, (70) 365 NP=hard, (69) 467 Numerical analysis. (65) 321 Object orientation, (64) 327 Object oriented programming, ~69) 498 Offdine control, (67) 344 On°line control, (67) 344 Open queueing networks, (65) 118 Open shop, (70) 379 Open shop scheduling. (70) 391 Operational planning, (64) 363 Operational research, (66) 161. ((')9) 14 Operations t~search, (64) 354 OPT, (70) 12~ Optical disks, (04) 370 Optimal control, if)S) 199 Optimal control algorithm, (71) 317 Optimal policy, (70) 405 Optimal time scale, (65) 235 Optimisation, (66) 8% (t~) 236 Optimization, (64) 410. (65) -44, (65) 351, ( ~ ) 362, (56) 52, (66) iO0, (66) 148,

Keywonl Index

-

Voh#nes 64-71

(66) 279, (66) 392. (67) 242, (67) 418. (68) 374, (68) 400, (68) 427, (69) 50. ~691 75, (69) 92. (69) 107, (69) 131, (69) 221, (711 205, (711 334 Optimization prot, lems, (71) 288 Optimized production technology, (70) 126 Optimum configuration, (67) 321 Organization. (66) 72 OR/MS implementation, (70) 244 Osipov, (65) 278 Overflow process. (65) 247 Overlap relations, (64) 229 Packing. (68) 389 Pairwise comparison, (69) 210 Pairwise comparisons, (70) 263 Pairwise tradeoffs, (64) 126 Parallel machines. (70) 327, (70) 379 Parallel processing, (71) 366 Parallel programming, (67) 188 Parallel redundancy. (68) 90 Parametric analysis. (65) 351 Parametric Markov decision, (69) 265 Parametric programming, (67) 75 Pareto-optimal, (65) 33 Parking policies. (71) 269 Partition polyto~. (69) 121 Part=machine grouping. (69) 342 Patient volume. (67) 321 Patrolling repairman, (64) 45 Pattern recognition, (64) 21 PCB assembly. (6(}) 312 Penalty cost. (70) 104 Perlormance, (64) 45. (67) 373. (71) 379 Pertorman¢¢ bounds. (6~) 467. (70) 3t~5 Perlormance index, (66) 113 Pcrlormance measures, (70) 432 Perishable product, (70) 104 Perron=Frobenius Theorem, (70) 263 PERT, (64) 286, ( ~ ) 185 PERT networks, (71) 70 Perturbation analysis, (65) 270 Pest control, (64) 38 Petri nets, (69) 482 Philosophy, (66) 184, (66) 235 Philosophy of Operations Research, (66) 216 Philosophy of OR, (66) 204 Philosophy of Science, (66) 168 Phlelx~tomy laboratory, (67) 321 Plagues of Europe, (71) 45 Planning, (64) 295, (64) 423, (¢~6) IiX). (67) 387, (69) 131, (70) 150 Planning horizons, (t~) 89 Planning models. ( ~ ) 338 Pollution control, (64) 354 Polyhedral combinatorics, (67) 204 Polynomially solvable cases, (69) 107 Polynomial time algorithms, (65) 400 Polynomial-time algorithms, (701 316

Population constraints, (69) 250 Possibility zone, (67) 111 Power dispatch, (64) 2 Power system, (64) 2 Practice, (65) 278 Precedence constraint, (64) 249 Preemptive scheduling, (70) 316 Preference analysis, (65) 138 Preference programming, (69) 200 Preferences, (67) 1 Preventive maintenance, (69) 50 Price breaks, (70) 52 Pricing, (68) 1 Primal-dual approach, (69) 498 Principal/agent theory, (70) 83 Principle of optimality. (69) 97 Printed circuit boards, (70) 177 Priority rule, (70) 327 Probabilistic analysis, (65) 68 Probabilistic traveling salesman problem, (65) 68 Problem structuring, (66) 216 Process industry, (64) 363 Process planning, (67) 358, (69) 399 Process routing, (67) 358 Product density, (68) 9(I Product design, (65) 336 Product form approximation, (69) 250 Production, (64) 83, (66) 259, (67) 332, (68) 23, (68) 69, (68) 228 Production conditions, (69) 399 Production control, (67) 344 Pa)duction functions. (¢~9) I Production management, (69) 373 Production ordering system, (70) 199 Production planning, (64) 12, (65) 187, ((~7) 141, (68) 134, (68) 3,t4 Production planning and control, (67) 207 Production scheduling, (65) 187 Profit-projections, (67) 321 Programming: multiple criteria, (67) 64 Programming: network, (70) 31 Progress functions, (68) 334 Project cost curve, (64) 286 Project management, (64) 216, (¢~71 221, (68) 185 Project ~heduling, (64) 229, (64) 295, (64) 312 Pseudolinearity, (67) 278 Pseudo polynomial algorithm, (64) 258 Public service agency administration. (66) 341 Purchasing. (68) 173. (68) 185. (70) 52 Quadratic assignment, (65) 407 Quadratic assignment problem, (65) 336 Quadratic programming, (65) 417, (67) 126 Quality control, (71) 353 Quasi-birth-death process, (65) 118, (68) 6(}

Keyword hule~" - Volumes 6 4 - 7 1

Quasiconvex first order approximation, (65) 327 Quasi-Hessian, (67) 278 Quasisubdifferential, (65) 327 Queueing, (69) 413 Queueing loss network, (65) 247 Queueing networks, (70) 212 Queue length, (66) 113 Queues, (67) 242, (68) 69, (68) 228 Queuing analysis, (67) 321

Random, (69) 244 Random environment, (65) 259 Randomized policy, (69) 265 Ratio-scale matrices, (69) 210 Real-time systems, (69) 50 Reciprocal matrices, (70) 263 Recognition, (69) 107 Reference point method, (68) 374 Regression, (66) 27, (68) 265, (69) 221 Regression analysis, (66) 36 Relational database, (64) 327 Reliability, (68) 6% (68) 228, (68) 236, (69) 38, (69) 65 Reliability and efficiency, (65) 314 Reliability bounds, (69) 55 Reliability (interval), (68) 90 Reliability theory, (69) 55 Renege. (67) 321 Reneging, (66) 113 Repairahles, (66) 135 Repeliliv¢ conlrol, ((~6) 8t) Repetitive manufacturing, (69) 330, (70) 350 Replacement policy. (69) 75 Research, (66) 353 Research and development, (68) 145, (71) 454 Resource allocation. (64) 199, (64) 295, (67) 242, (68) 160, (71) 17, (71) 110, (7 !) 235 Resource-constrained project scheduling, (64) 168 Resource-constrained schedv.I;ng, (70) 43 Resource economics, (71) 439 Resource pricing, (64) 168 Response surface methodology, (69) 166 Retailing, (64) 457, (68) 1 Retrials, (65) 247 Revenue amdysis, (67) 321 Review, (66) 1, (69) 1 Risk, (67) 221 Risk measurement, (67) 267 River water quality, (64) 354 Road transportation, (71) 205 Role conflict, (64) 216 Rolling scheduling, (66) 89

Routing, (64) 432, (65) 218, (67) 428, (71) I

Runga-Kutta, (66) 124 Safety Stock, (65) 96, (68) 49 Sample path analysis, (65) 270 Satellites, (66) 100 Saturation phenomena, (69) 14

Scenarios, (68) 291 Scheduling, (64) 188, (64) 249, (64) 278, (65) 274, (66) 135, (66) 259, (67) 204, (69) 92, (69) 107, (69) 131, (69) 187, (69) 330, (69) 438, (70) 115, (70) 150, (70) 159, (70) 177, (70) 289, (70) 304, (70) 311, (70) 327, (70) 365, (70) 379, (71) 325, (71) 334, (71) 366 Scientific knowledge, (66) 168 Selection and sequencing, (70) 425 Sensitivity, (68) 379 Sensitivity analysis, (69) 75 Sequence dependent scheduling, (70) 177 Sequenching, (68) 251 Sequencing of robot moves, (69) 482 Sequential, (67) 358 Series-parallel, (64) 249 Service level, (68) 49 Set covering, (71) 303 Setup, (69) 413 Set-up costs, (66) 65 Setup reduction, (69) 312 Shallow knowledge, (71) 247 Shortest path, (65) 33, (66) 65, (69) 97 Shortest path problem with obstacles, (64) 156 Side-payments, (64) 449 Signalling theory, (69) 143 Signal optimization, (71) 222 Simihlrity coefficients, (69) 284 Simplex algorithm, (67) 126 Simpson point, (66) 372 Simulated annealing, (66) 291, (68) 389, (69) 238, (70) 43 Simulation, (64) 83, (65) 247, (66) 135, (69) 166, (69) 424, (69) 450, (71) 80, (71) 353 Single machine, (70) 115, (70) 304, (70) 311, (70) 425 Single machine scheduling, (64) 258 Single-machine scheduling, (70) 272 Single machine system, (70) 289 Social, (66) 235 Societal evolution, (69) 14 Societal life cycles, (69) 14 Sociology of science, (66) 168 Software engineering modelling, (64) 327 Spares, (66) 124 Sports, (67) 13 Stability/instability features, (69) 14 Standard software, (70) 159 Statistical analysis, (67) 321 Statistical estimation, (67) 267

477 Statistical techniques, (67) 88 Statistics: Distributions, (67) 259 Steady state, (66) 124 Stochastic, (65) 33, (65) 199. (69) 413, (71) 379 Stochastic job shops, (70) 212 Stochastic model, (65) 96 Stochastic networks, (67) 221 Stochastic optimization. (71) 353 Stochastic process, (67) 161, (68) 90 Stochastic processes, (64) 45, (68) 23, (71) 439 Stochastic programming, (64) 432 Stochastic scheduling, (70) 405, (70) 425 Storage, (68) 389 Strategic decision support, (70) 167 Strategic planning, (68) 291, (71) 341 Strategy, (68) 9 Structural change, (69) 14 Structure functions, (69) 55 Subdivision method, %5) 314 Submodularity property, (71) 130 Superposition process, (65) 247 Supply, (66) 52, (69) 221 System analysis, (68) 334 System capacity, (67) 321 System characteristics, (67) 321 System dynamics, (65) 199, (70) 167 System inspection, (69) 65 System reliability, (65) 235 Systems, (66) 72, (68) 23, (69) 38, (71) 235 Systems analysis, (69) 14 Systems management, (69) 14 Systems theory, (69) 14 Tardiness, (69) 187. (70) 304 Telecommunication, (65) 247 Telcconlmtlnications. (71 ) 34 I Theory, (66) 1. (6{}) I Theory of constraints, (70) 126 Time varying traffic. (67) 428 Time windows, (66) 331 TOC, (70) 126 Toll highway projects, (71) 205 Trade-off pairs, (68) 422 Traffic, (71) 188 Traffic assignment models, (71) 205 Traffic control, (71) 222, (71) 247 Traffic networks. (71) 317 Traffic services. (66) 272 Transient, (66) 124 Transportation. (65) 44, (66) 331, (71) 154, (71) 177, (71) 235, (71) 247. (71) 269, (71) 419 Transportation problem, (65) 58 Transportation programming, (66) 353 Transportation: road, (70) 31 Transport demand forecasting. (71) 288 Transputers, (67) 188 Traveling salesman problem, (65) 218. (69) 107

478 Travelling salesman problem. (66) 65 Tree algorithms. (65) 20 Trim-loss, f64) 410 Trim loss, (64) 423 Uncertainty. (64) 363. (68) 291 Unidirectional flow, (71) 32 Urban planning, (71) 257 Utility theory, (67) 259, (70) 135

Validation. (66) 161. (66) 216. (66) 250 Validation in OR, (66) 204

Keyword Index - Volumes 6 4 - 7 1

Variable durations, (64) 229 Variance, (69) 265 Variance reduction techniques, (71) 80 Variational inequality, (71) 188 Vehicle fleet composition, (66) 313 Vehicle routine, (66) 313 Vehicle routing and scheduling, (66) 331, (~) 341 Vendor selection, (68) 173, (70) 52

Water transportation, (71) 325 Weak convergence, (65) 259 Weighted tardiness, (64) 168 Weights, (67) 1 Workload balancing, (69) 312 Worst case analysis, (69) 384, (70) 365 Worst-case analysis, (69) 467, (70) 342, (70) 379