EUROPEAN JOURNAL OF OPERATIONAL RESEARCH LSEVIER European Journal of Operational Research 96 (1997) 672-678 Keyword Index Volumes 88-95 (1996) Accuracy, (81) 306 Assembly shops, (93) 34 Branch and Bound, (92) 573 Active and non-delay schedules, (90) 320 Asset pricing, (95) 623 Branch-and-bound algorithm, (92) 326 Active set methods, (92) 166 Asset valuation, (91) 214 Branch and bound method, (90) 238, (91) Activity nets, (90) 376 Assignment, (94) 16 203, (94) 548 Adaptive processes, (88) 165, (93) 602 Assignment problem, (90) 536 Branch-and-cut, (93) 224 Adaptive relaxation factor, (88) 622 Asymmetric graphs, (95) 411 Branching processes with state dependent Adaptive smoothing, (94) 106 Asymmetric information, (81) 411 immigration, (95) 167 Additional delay, (92) 125 Attribute sampling, (90) 383 Brand choice, (93) 346 Advertising, (95) 511 Augmented model, (89) 618 Business failures, (90) 487 Affine-scaling primal algorithm, (89) 193 Autocorrelation, (94) 194 Agency theory, (89) | Automatic graph drawing, (90) 303 Aggregation, (94) 467 Automatic plant layout, (89) 135 Callable bonds, (91) 264 Aggregation operator, (89) 445 Axiomatic, (90) 78 Capacitated facility location, (88) 490 Agricultural marketing, (94) 321 Capacitated systems, (95) | Agriculture, (90) 102 Capacity, (89) 237 AHP, (93) 550 Capacity expansion, (81) 395, (95) 89 AI techniques, (89) 135 Backbone communication network, (93) 98 Capacity management, (92) 83 Algorithm, (88) 404, (89) 423, (92) 368 Banking, (81) 338, (95) 24 Capacity planning, (81) 386, (89) 302 Algorithmic probability, (88) 152 Banzhaf value, (95) 451 Case-based reasoning, (93) 511 Algorithms, (89) 366, (94) 87 Bargaining, (88) 348 Cash flow, (88) 504 Allocation, (89) 1, (89) 642 Base stock policies, (95) 1 Causality, (89) 34 Allocation: Resource, (94) 626 Batch delivery, (93) 49, (94) 203 CCR model, (90) 451 All-units discounts, (92) 219 Batches, (90) 200 Cellular manufacturing, (95) 566 Alternatives, (92) 537 Batching, (91) 56, (94) 277, (95) 374 Central banks, (90) 547 Ambiguity, (95) 139 Batch size, (88) 304, (88) 446 - Chance constrained programming, (88) 257 Anaerobic digestion, (88) 251 Belief networks, (94) 488 Changeover scheduling, (91) 456 Analytic center, (94) 206 Best compromise solution, (89) 185 Chaos, (93) 155 Analytic Hierarchy Process, (88) 42, (89) Beta-binomial, (95) 511 Check-out services, (92) 83 247, (90) 473, (91) 27, (93) 611, (95) Bicriteria scheduling, (95) 356 Chromatic scheduling, (92) 474 656 Bilinear programming, (90) 102, (94) 384 Classification, (88) 358, (92) 637 Analytic solution, (92) 166 Binary interdependence, (92) 182 Cluster analysis, (93) 402 AND/OR-graph search, (94) 548 Bin packing, (95) 191 Coal allocation, (95) 62 Applications, (90) 334, (94) 87 Bipartite graphs, (90) 303 Coefficient of variation, (94) 477 Approximate eigenvector method, (95) 656 Bipartite matching, (88) 348 Column generation, (91) 543 Approximation, (88) 231, (94) 284, (95) Biprocessor task, (94) 242 Combinations, (92) 528 211 Blast furnace process, (89) 34, (90) 85 Combinatorial analysis, (95) 631 Approximation scheme, (88) 69 Blocking phenomenon, (91) 481 Combinatorial optimisation, (94) 392 Arbitrage, (93) 205 Blocking probability, (89) 127 Combinatorial optimization, (89) 135, (89) Arbitrage pricing theory, (88) 23 Boolean programming, (95) 420 564, (91) 573, (92) 387, (92) 474, (92) Arbitration, (88) 348 Bounded dynamic programming, (88) 101 493, (92) 573, (93) 317 Arms control, (90) 383 Bounded rationality, (91) 284 Combining forecasts, (94) 505 Artificial Intelligence, (92) 550, (93) 230, Branch and bound, (81) 367, (81) 386, (90) Combining ranked forecasts, (94) 505 (94) 488 26, (90) 102, (90) 227, (90) 285, (90) Common due date, (93) 49, (94) 203 Asexual reproduction, (93) 490 303 Communication, (81) 395 Aspiration levels, (89) 193 Branch-and-bound, (88) 50, (88) 182, (90) Communication channels, (94) 271 Assembly line balancing, (81) 367 334, (92) 310, (93) 224 Communication delays, (94) 252, (94) 271 0377-2217/97/$15.00 © 1997 Elsevier Science B.V. All rights reserved EUROPEAN JOURNAL OF OPERATIONAL RESEARCH LSEVIER European Journal of Operational Research 96 (1997) 672-678 Keyword Index Volumes 88-95 (1996) Accuracy, (81) 306 Assembly shops, (93) 34 Branch and Bound, (92) 573 Active and non-delay schedules, (90) 320 Asset pricing, (95) 623 Branch-and-bound algorithm, (92) 326 Active set methods, (92) 166 Asset valuation, (91) 214 Branch and bound method, (90) 238, (91) Activity nets, (90) 376 Assignment, (94) 16 203, (94) 548 Adaptive processes, (88) 165, (93) 602 Assignment problem, (90) 536 Branch-and-cut, (93) 224 Adaptive relaxation factor, (88) 622 Asymmetric graphs, (95) 411 Branching processes with state dependent Adaptive smoothing, (94) 106 Asymmetric information, (81) 411 immigration, (95) 167 Additional delay, (92) 125 Attribute sampling, (90) 383 Brand choice, (93) 346 Advertising, (95) 511 Augmented model, (89) 618 Business failures, (90) 487 Affine-scaling primal algorithm, (89) 193 Autocorrelation, (94) 194 Agency theory, (89) | Automatic graph drawing, (90) 303 Aggregation, (94) 467 Automatic plant layout, (89) 135 Callable bonds, (91) 264 Aggregation operator, (89) 445 Axiomatic, (90) 78 Capacitated facility location, (88) 490 Agricultural marketing, (94) 321 Capacitated systems, (95) | Agriculture, (90) 102 Capacity, (89) 237 AHP, (93) 550 Capacity expansion, (81) 395, (95) 89 AI techniques, (89) 135 Backbone communication network, (93) 98 Capacity management, (92) 83 Algorithm, (88) 404, (89) 423, (92) 368 Banking, (81) 338, (95) 24 Capacity planning, (81) 386, (89) 302 Algorithmic probability, (88) 152 Banzhaf value, (95) 451 Case-based reasoning, (93) 511 Algorithms, (89) 366, (94) 87 Bargaining, (88) 348 Cash flow, (88) 504 Allocation, (89) 1, (89) 642 Base stock policies, (95) 1 Causality, (89) 34 Allocation: Resource, (94) 626 Batch delivery, (93) 49, (94) 203 CCR model, (90) 451 All-units discounts, (92) 219 Batches, (90) 200 Cellular manufacturing, (95) 566 Alternatives, (92) 537 Batching, (91) 56, (94) 277, (95) 374 Central banks, (90) 547 Ambiguity, (95) 139 Batch size, (88) 304, (88) 446 - Chance constrained programming, (88) 257 Anaerobic digestion, (88) 251 Belief networks, (94) 488 Changeover scheduling, (91) 456 Analytic center, (94) 206 Best compromise solution, (89) 185 Chaos, (93) 155 Analytic Hierarchy Process, (88) 42, (89) Beta-binomial, (95) 511 Check-out services, (92) 83 247, (90) 473, (91) 27, (93) 611, (95) Bicriteria scheduling, (95) 356 Chromatic scheduling, (92) 474 656 Bilinear programming, (90) 102, (94) 384 Classification, (88) 358, (92) 637 Analytic solution, (92) 166 Binary interdependence, (92) 182 Cluster analysis, (93) 402 AND/OR-graph search, (94) 548 Bin packing, (95) 191 Coal allocation, (95) 62 Applications, (90) 334, (94) 87 Bipartite graphs, (90) 303 Coefficient of variation, (94) 477 Approximate eigenvector method, (95) 656 Bipartite matching, (88) 348 Column generation, (91) 543 Approximation, (88) 231, (94) 284, (95) Biprocessor task, (94) 242 Combinations, (92) 528 211 Blast furnace process, (89) 34, (90) 85 Combinatorial analysis, (95) 631 Approximation scheme, (88) 69 Blocking phenomenon, (91) 481 Combinatorial optimisation, (94) 392 Arbitrage, (93) 205 Blocking probability, (89) 127 Combinatorial optimization, (89) 135, (89) Arbitrage pricing theory, (88) 23 Boolean programming, (95) 420 564, (91) 573, (92) 387, (92) 474, (92) Arbitration, (88) 348 Bounded dynamic programming, (88) 101 493, (92) 573, (93) 317 Arms control, (90) 383 Bounded rationality, (91) 284 Combining forecasts, (94) 505 Artificial Intelligence, (92) 550, (93) 230, Branch and bound, (81) 367, (81) 386, (90) Combining ranked forecasts, (94) 505 (94) 488 26, (90) 102, (90) 227, (90) 285, (90) Common due date, (93) 49, (94) 203 Asexual reproduction, (93) 490 303 Communication, (81) 395 Aspiration levels, (89) 193 Branch-and-bound, (88) 50, (88) 182, (90) Communication channels, (94) 271 Assembly line balancing, (81) 367 334, (92) 310, (93) 224 Communication delays, (94) 252, (94) 271 0377-2217/97/$15.00 © 1997 Elsevier Science B.V. All rights reserved Keyword Index Communications, (94) 261, (95) 427 Currency, (90) 547 Discrete systems, (89) 668 Comparative evaluations, (95) 356 Customer retention, (91) 427 Discretized pairwise comparison (DPC) ma- Comparative performance, (93) 346 Customer satisfaction, (91) 427 trix, (95) 656 Comparative studies, (89) 408 Customer service, (89) 269, (95) 73 Discriminant analysis, (93) 582, (94) 112 Comparison of fuzzy numbers, (95) 649 Customer support services, (92) 83 Distribution, (88) 215, (94) 1 Compatibility matrix, (94) 186 Cutting, (92) 193 Distributions, (92) 254 Compensation, (89) | Cutting and packing problems, (94) 548 Dominance cone, (95) 390 Competition, (88) 215, (90) 589, (95) 89 Cutting-plane /Facet-generation algorithm, Drama, (92) 603 Competitiveness, (90) 514 (95) 671 Duality, (88) 537, (88) 572, (89) 212 Completion time variance, (91) 118 Cutting plane method, (94) 206 duality, (91) 634 Complexity, (89) 172, (89) 423, (91) 495, Cutting stock, (88) 69, (95) 631 Duality, (94) 167, (95) 522 (92) 148, (94) 97, (94) 252, (94) 271 Cutting stock problem, (91) 543, (93) 522 Due date, (88) 336 Complexity index, (81) 347, (90) 376 Cyclic scheduling, (91) 471 Dynamic, (94) 292 Compromise solution, (92) 512 Dynamic programming, (88) 50, (88) 69, Computational analysis, (89) 164, (91) 176, Dantzig—Wolfe decomposition, (91) 587 (88) 88, (88) 328, (88) 446, (89) 53, (91) 471, (92) 310 Data analysis, (94) 321 (90) 45, (90) 599, (91) 38, (91) 74, (91) Computational complexity, (91) 611 Data envelopment analysis, (88) 525, (89) 553, (92) 135, (92) 387, (94) 87, (95) Computational finance, (81) 315 473, (90) 142, (90) 461, (92) 352, (94) 299 Computational geometry, (92) 368 439, (95) 390 Dynamic programming algorithm, (93) 49 Computation of bounds, (89) 53 Data Envelopment Analysis, (88) 583, (90) Dynamic setup cost reduction, (90) 182 Computer attributes, (95) 439 553, (95) 491 Dynamic vehicle routing, (95) 167 Computer backup strategy, (81) 411 Data Envelopment Analysis (DEA), (89) Computers, (95) 420 482, (90) 451 Earliness / tardiness, (91) 190 Conditional subgradients, (88) 382 Data quality, (93) 346 Early /tardy, (94) 292 Conflict, (92) 603 Data structure, (90) 1 Earthwork allocation, (93) 148 Conflict analysis, (90) 619 Data uncertainty, (94) 362 Ecology, (88) 251 Congestion, (93) 110 DEA, (90) 461 Econometric, (95) 522 Congestion management, (92) 83 DEA-Multiplicative model, (88) 525 Economic manufacturing quantity, (89) 593 Connectivity, (95) 155 Decision analysis, (89) 427, (93) 550, (95) Economic order quantity, (92) 219 Constant service times, (92) 99 139 Economics, (89) 226, (89) 581, (90) 547, Constrained Facet Analysis (CFA), (89) 482 Decision-making, (89) 70 (90) 566, (94) 626, (95) 89 Constrained optimization, (90) 56 Decision opportunities, (92) 537 Economics of regulation, (88) 28 Constraint qualification, (88) 537 Decision support, (90) 413, (92) 458 Edge coloring, (94) 242 Constraint satisfaction, (90) 269 Decision support systems, (89) 70, (93) 387, Education, (94) 16 Contingent claims analysis, (91) 214 (93) 511, (94) 16 Efficiency, (90) 451, (90) 553 Continuous improvement, (88) 203 Decision support sytem, (88) 428 Efficient set, (94) 143 Continuous pairwise comparison (CPC) ma- Decision theory, (92) 135, (94) 292 Elimination tests, (92) 214 trix, (95) 656 Decision tree, (93) 628, (95) 284 Embedded Markov chain, (88) 614 Continuous resource, (94) 302 Decision trees, (94) 405 Emergency planning, (90) 413 Continuous review, (95) 241 Decking, (95) 631 Emergency vehicles, (93) 110 Continuous review policies, (91) 440 Decomposition property, (92) 125 Emerging markets, (90) 566 Convex fuzzy relation, (92) 649 Defence studies, (90) 609 Empirical data models, (90) | Convex hull problem, (92) 352 Degeneracy graphs, (95) 155 Energy, (88) 88 Convex programming, (88) 382, (91) 634 Delayed vacations, (92) 125 Environment, (90) 102, (90) 395 Coordination, (89) 70, (89) 570 Demand, (92) 254 Environmental variables, (90) 553 Correlation, (89) 570 Descent, (90) 200 EOQ model, (95) 313 Coscheduling, (94) 215 Description, (92) 417 Equilibrium distribution, (92) 112 Cost allocation, (89) 237 Design, (89) 581, (94) 186 Equilibrium traffic model, (91) 507 Cost—benefit, (90) 625 Deteriorating items, (92) 302 European Union, (94) 439 Cost benefit analysis, (95) 284 Deterioration, (95) 604 Evolutionary systems design, (93) 602 Cost minimization, (95) 313 Deterministic, (89) 516 Evolution program, (94) 618 Coupled-task jobs, (90) 13 Deterministic and stochastic demands, (88) Exact algorithm, (88) 328 Credit period, (91) 528 504 Exact algorithms, (91) 553 Credit scoring, (95) 24 Deterministic optimization, (94) 618 Exact eigenvector method, (95) 656 Crew scheduling, (94) 517 3-D graph model, (90) 619 Exact methods, (90) 238 Critical path programming, (88) 320 Diagnostic tests, (93) 155 Excess capacity, (95) 89 Cross-efficiency, (90) 461 Diffusion models, (93) 476 Exchange rate, (81) 306, (95) 325 Cross-evaluation, (90) 461 Direct rating, (94) 467 Exhaustive service discipline, (92) 125 Crossing arcs minimization, (90) 303 Discounted freight cost, (91) 528 Experimental design, (88) 413 CRP, (88) 287 Discount purchase, (92) 219 Experimental investigation, (90) 320 Cumulative sum procedures, (95) 641 Discounts, (92) 266 Experimentation, (89) 408 674 Keyword Index Expert systems, (92) 458, (94) 405, (94) Gaming, (95) 299 Heuristic solutions, (94) 582 488 Gang-scheduling, (94) 215 Hierarchical network design problem, (92) Exponential fitness, (94) 618 General equilibrium, (93) 205 214 Exponential smoothing methods, (94) 106 Generalized assignment probiem, (91) 600 Higher education, (89) 18 Extended addition of fuzzy intervals, (92) Generalized good designs, (89) 618 High performance computation, (89) 366 512 Generalized job shop scheduling, (89) 355 Hop constraints, (95) 178 Extended formulation, (95) 671 Generalized mutation, (93) 490 Hub location, (94) 582 Extensive facility, (95) 592 Generalized pseudoinverse, (93) 611 Hydroelectric energy planning, (89) 53 Extent analysis, (95) 649 Generalized resource-constrained project External cost and quality measures, (93) scheduling, (89) 355 ' Imbalance, (89) 341 449 Genetic algorithm, (90) 200, (92) 387, (93) Immediate selection, (90) 238 Extrapolation methods, (95) 641 121 Imperfect maintenance, (94) 425 Genetic algorithms, (88) 165, (90) 577, (94) Imperfect production systems, (91) 517 Facilities, (90) 56, (91) 495, (94) 97 349, (94) 392, (95) 356 Implementation, (92) 458 Facility layout, (89) 556 Genetic Algorithms, (92) 493 Implied constraints, (88) 537 Feasibility testing, (88) 578 Genetic programming, (92) 402 Incentive compatibility, (89) 226 Feedback Nash equilibrium solution, (90) Geographical information systems, (90) 413 Incentives, (90) 625 599 Geometric design, (92) 193 Incremental discounts, (92) 219 Feedback traders, (91) 284 Geometric scales, (94) 467 Independent set, (92) 342 Finance, (81) 338, (88) 23, (90) 566, (90) 577, (91) 214, (91) 229, (91) 274, (93) GERT networks, (91) 481 Inductive learning networks, (93) 387 Global, (95) 325 Industrial experimentation, (88) 203 173, (93) 185, (95) 623 Global convergence, (93) 490 Inequality, (94) 439 Financial markets, (91) 284 Finite buffer, (88) 592 Globalization, (90) 514 Inequality relation in fuzzy constraints, (92) Fixed income, (91) 264 Global preference, (89) 185 512 Global search, (93) 317 Inflation, (89) 313 Flexible manufacturing, (91) 56 Goal programming, (94) 16, (94) 439 Influence diagram, (93) 628 Flexible manufacturing cells, (95) 566 Government, (94) 626 Information economics, (92) 615 Flexible manufacturing systems, (92) 474, Graph, (89) 423 Information structures, (92) 615 (95) 566 Graph algorithms, (89) 564 Information systems, (89) 380 Flexible manufacturing systems (FMS), (95) Graph colouring, (90) 285 Informativeness, (92) 615 344 Graph theory, (91) 565, (94) 97, (95) 411 Infrequent trading, (88) 23 Flow-capturing, (90) 427 Greenhouse gas, (88) 28 Innovation, (94) 626 Flow shop, (89) 172, (90) 214, (95) 356 Flow shop scheduling, (90) 227, (90) 238 Grid, (95) 427 Input and output, (90) 238 Group decision making, (95) 264 Inspection, (89) 302, (90) 383, (95) 344 Flow-shop scheduling, (91) 160 Group method of data handling (GMDH), Inspection sequencing, (95) 344 Forbidden regions, (90) 56 (93) 387 Integer linear programming, (93) 522 Forecast horizon, (91) 456 Group problem, (88) 578 Integer programming, (88) 550, (91) 573, Forecasting, (81) 306, (88) 428, (90) 577, (92) 528, (94) 505 Group Technology, (92) 637 (92) 148, (92) 342, (93) 300, (94) 87, Fractional goals, (92) 157 Guaranteed service, (89) 246 (94) 384, (94) 582, (95) 178, (95) 231, Fractional programming, (89) 212 (95) 537, (95) 631, (95) 671 Integration, (88) 446 Frame, (92) 352 Heads and tails, (90) 238 Interactions, (81) 315 Frontier projection operator, (88) 583 Health care, (93) 449 Interactive approach, (89) 185 Fundamental theorem of GA, (93) 490 Fuzzy AHP, (95) 649 Health services, (88) 428, (93) 369 Interactive criteria, (89) 445 Fuzzy decision process, (92) 649 Hedging, (93) 185, (95) 522 Interactive methods, (95) 115 Fuzzy goal programming, (92) 157 Heuristic, (90) 56, (91) 99, (93) 34, (93) Interactive programming, (89) 408 Fuzzy integral, (89) 445 224, (93) 300, (94) 292 Interest rates, (93) 205 Fuzzy majority, (95) 264 Heuristic algorithm, (88) 563 Interest-rate sensitive instruments, (91) 235 Fuzzy measure, (89) 445 Heuristic algorithms, (89) 108 Interior point algorithm, (94) 206 Heuristics, (81) 395, (88) 114, (88) 139, Interior point algorithms, (89) 193 Fuzzy multi-objective linear programming, (95) 62 (88) 490, (88) 516, (89) 86, (89) 400, Interior-point algorithms, (89) 202 Fuzzy preference, (95) 264 (89) 564, (90) 1, (90) 13, (90) 45, (90) Interior point methods, (90) 395 Fuzzy regression, (92) 417 349, (90) 427, (91) 124, (91) 160, (91) Internal cost and quality measures, (93) 449 Fuzzy set, (95) 62, (95) 611 176, (91) 495, (91) 553, (91) 565, (91) International, (95) 623 Fuzzy sets, (92) 512, (92) 628, (92) 637, 600, (92) 214, (92) 281, (92) 387, (93) Interval number, (94) 594 61, (93) 135, (93) 271, (93) 536, (94) Interval scales, (91) 27 (93) 75, (93) 88, (95) 264 Fuzzy solution, (92) 157 87, (95) 537 Inventory, (89) 302, (89) 313, (89) 326, Heuristic search, (88) 464, (88) 475, (89) (89) 341, (90) 115, (90) 171, (91) 528, Games, (90) 115, (92) 603 135, (92) 493 (92) 239, (92) 254, (92) 266, (94) 29, Game theory, (81) 411, (88) 550, (90) 383, Heuristics, Manufacturing, (95) 476 (94) 122, (94) 527, (95) 53, (95) 2ii, (90) 599, (93) 331, (95) 451 Heuristic solution procedure, (93) 121 (95) 241, (95) 299, (95) 604, (95) 611 Keyword Index Inventory control, (88) 446 Linear vector semi-infinite optimization, Matrix-geometric solution, (89) 147 Inventory /production, (89) 259 (94) 610 Matroidal knapsack, (95) 201 Inventory routing, (88) 504 Linguistic variables, (92) 628 Matroids, (95) 201 Inventory systems, (92) 302 Local search, (88) 139, (89) 108, (90) 26, Maximal Clique problem, (95) 671 Inverse problems, (91) 634 (92) 493 Maximal covering location problem, (88) Investment, (95) 284 Local Search, (94) 43 114 Investment analysis, (93) 173 Local search heuristics, (90) 200 Maximum likelihood estimation, (94) 505 Investment valuation, (81) 315 Location, (90) 56, (90) 78, (91) 495, (93) MC2?-simplex method, (89) 618 110, (93) 230, (93) 469, (95) 592 Mean completion time, (94) 302 JIT, (88) 101 Location—allocation, (90) 420 Mean flow time, (94) 310 Job completion time, (91) 203 Location theory, (94) 66 Mean queue length, (88) 614 Job shop, (90) 214, (90) 252, (90) 269 Logarithmic least squares, (93) 611 Mean squared error, (88) 304 Jobshop, (93) 34 Logistics, (94) 1, (95) 325 Mean tardiness, (89) 100, (93) 61 Job shop scheduling, (91) 99 Look-ahead analysis, (88) 622 Mechanism design, (81) 411 Joint economic order quantity, (92) 219 Loss probability, (88) 592 Median, (90) 78 Judgement, (81) 306, (92) 528 Lot size, (91) 528 Media planning, (95) 511 Just-in-time, (93) 68, (95) 38 Lotsize, (94) 561 Medicine, (93) 369 Kanban systems, (89) 147 Lot sizing, (89) 86, (89) 269 Merger, (88) 42 Karush—-Kuhn-Tucker conditions, (88) 537 Lot-sizing, (91) 517, (92) 266, (92) 281, Metaheuristics, (92) 493, (92) 573 K-cardinality subgraph, (93) 224 (95) 73 M/G/1 queue, (92) 125 K-cardinality tree, (93) 224 Lot sizing models, (92) 219 Military, (90) 609 Kirkwood’s algebraic method, (93) 628 Lower and upper semi-continuity, (94) 610 Minimal repair, (94) 425 K-means, (93) 346 Lumpy demand, (89) 593 Minimax, (93) 185 Knapsack, (91) 553 Lyapunov stability, (89) 668 Mini-max problem, (91) 565 Knapsack problem, (89) 609, (92) 310 Minimizing mean squared deviation, (88) Knapsack problems, (88) 578 Machine—component matrix, (93) 88 328 Knowledge acquisition, (94) 405 Machine sharing, (91) 56 Minimum guarantees, (91) 235 Knowledge-based systems, (92) 458 Machine suitability, (93) 88 Minimum tardy, (89) 100 Kuratowski convergence, (94) 610 Machining economics, (92) 63 Mixed integer linear bilevel programming, Machining parameters, (94) 335 (88) 563 Labeling algorithm, (88) 586 Maintenance, (91) 74, (92) 63, (95) 577 Mixed integer linear programming, (95) 284 Lagrangean methods, (92) 326 Maintenance, Age replacement, (90) 171 Mixed integer programming, (88) 490, (93) Lagrangean relaxation, (88) 114, (88) 382, Makespan, (93) 34, (94) 242, (94) 252 582 (94) 517 Manufacturing, (89) 259, (89) 496, (92) 63, Mixed-integer programming, (94) 154 Lagrange multipliers, (89) 642 (94) 335, (95) 325 Mixed-model production, (94) 179 Lagrangian and surrogate relaxation, (91) Manufacturing families, (92) 637 Model analysis, (93) 387 600 Manufacturing industries, (89) 609, (89) 642 Modeling, (89) 581, (94) 626, (95) 577 Lagrangian relaxation, (88) 550 Manufacturing systems, (91) 56 Modeling framework, (90) 362 Large scale convex optimization, (94) 206 Marginal distribution, (94) 194 Modelling, (81) 338, (88) 215, (88) 231, Latin American airline industry, (88) 525 Market entry, (94) 453 (88) 428, (90) 420, (90) 609, (91) 14, Lattice (tree) methods, (91) 214 Marketing, (88) 13, (89) 1, (90) 115, (93) (92) 193, (93) 173, (94) 335 Leadtime, (95) 374 346, (93) 476 Modified policy iteration, (88) 622 Lead time management, (89) 269, (95) 73 Marketing and manufacturing defensive Monotone cost, (88) 345 Lead time policies, (89) 259 strategies, (94) 453 Monotonicity, (90) 625 Learning, (88) 404, (91) 284 Markov chains, (89) 147 Monte Carlo simulation, (94) 618 Learning algorithms, (93) 428 Markov decision process, (92) 281 Most productive scale size, (89) 473 Learning curve, (93) 476 Markov decision processes, (89) 53, (95) Multiattribute utility, (88) 251 Leasing, (81) 315 404 Multicommodity flows, (95) 178 Linear decision rules, (91) 89 Markov decision programming, (91) 74 Multicommodity Network flows, (92) 37 Linearization, (92) 310 Markovian arrival process, (88) 599 Multi criteria analysis, (89) 408 Linear-plus-linear-fractional objective func- Markov processes, (88) 622, (89) 277, (95) Multicriteria analysis, (93) 536 tion, (89) 212 577 Multi-criteria analysis, (94) 467 Linear programming, (81) 411, (88) 320, Markov-type transition, (92) 649 Multi criteria analysis, (94) 599 (88) 358, (90) 71, (92) 28, (92) 37, (92) Martingale approach, (91) 274 Multicriteria decision making, (89) 445 352, (93) 148, (93) 244, (93) 582, (94) Mass production, (94) 179 Multicriteria optimization, (89) 202 112, (94) 582, (94) 594, (95) 155, (95) Matching, (90) 536, (93) 331 Multicriteria preference analysis, (94) 321 231 Mathematical programming, (88) 165, (89) Multicriteria problems, (94) 66 Linear programming relaxation, (91) 543 380, (90) 514, (91) 507, (92) 550, (93) Multidimensional scaling (MDS), (95) 439 Linear programming relaxations, (95) 178 582, (94) 143, (94) 561 Multi-echelon, (89) 341 Linear-quadratic models, (91) 89 Mathematical Programming, (92) 512 Multi-echelon inventory, (92) 69 Linear search, (95) 663 Matrix-geometric method, (88) 599 Multiechelon inventory systems, (91) 440 676 Keyword Index Multi-echelon inventory systems, (95) | Nonsmooth optimization, (88) 382, (93) 185 Penalty functions, (94) 143 Multi-echelon system, (95) 241 NP-completeness, (94) 242 Perfect equilibrium, (89) 570 Multi-index transportation problems, (95) 62 NP-hardness, (89) 172 Performance evaluation, (89) 147, (91) 481 Multi-level, (89) 86 NT-policy, (88) 599 Performance indicators, (89) 18 Multiobjective Linear Programming Numerical analysis, (81) 315 Performance measures, (93) 449 (MOLP), (89) 202 Periodic loading, (88) 287 Multiobjective linear programming, (93) 602 Objective qualification, (88) 537 Periodic review, (95) 1, (95) 241 Multiobjective optimization, (95) 115 Objectives, (92) 537 Periodic review policies, (92) 69 Multiobjective programming, (94) 594 Objective space analysis, (88) 368 Perturbation realization, (91) 1 Multi-person game, (90) 536 Obnoxious facility, (95) 592 Phase type distribution, (88) 599 Multiple choice integer programming, (88) One-dimensional cutting stock, (95) 191 Phase-type distributions, (90) 156 182 Open queueing network, (92) 99 Pictorial specification method, (91) 14 Multiple criteria, (89) 457, (92) 166, (92) Openshop, (93) 34 Piecewise linear approximation, (89) 53, 628, (93) 550 Optimal control, (89) 127, (93) 476 (95) 404 Multiple criteria linear programming, (88) Optimal maintenance policy, (94) 425 Pig iron dynamics, (90) 85 368 Optimisation, (88) 139, (93) 300, (94) 517, Planned lead time, (88) 287 Planning, (89) 642, (91) 74, (91) 623 Multiple input /output decision making, (95) (95) 420, (95) 549 491 Optimization, (88) 165, (88) 257, (88) 320, PLSP, (89) 86 Multiple modes, (94) 377 (88) 413, (89) 237, (89) 277, (89) 366, Policy improvement, (92) 649 Multiple objective linear programming, (89) (89) 642, (91) 471, (92) 193, (92) 402, Policy iteration, (95) 404 193 (93) 522, (94) 97, (94) 134, (94) 143, Politics, (92) 603 Multiple solutions, (95) 191 (94) 349, (94) 477, (95) 511 Polygon containment, (92) 368 Multiprocessors, (89) 366 Optimum-degeneracy graphs, (95) 155 Polynomial algorithm, (94) 242, (94) 310 Multiprocessor scheduling, (90) 214 Option pricing, (91) 229 Population constraint, (92) 99 Multiprocessor task, (94) 231 Options, (81) 315, (91) 250 Portfolio and consumption policy, (91) 274 Multiprocessor tasks, (94) 215 Order determination, (90) 85 Portfolio management, (91) 264 Multi-stage manufacturing systems, (95) 549 Order splitting, (95) 53 Portfolios of insurances and investments, Multivariate statistics, (88) 358 Ordinal preference of outcomes, (93) 620 (88) 257 Ordinal stochastic dominance, (93) 620 Portfolio strategy, (91) 250 Nash component, (89) 570 Organisational environment, (89) 70 Postoptimization, (91) 507 Natural gas distribution, (88) 88 Orthogonal information systems, (92) 615 Potential, (95) 451 Natural resources, (89) 53 Out-degrees, (95) 411 Potential basis, (95) 451 Negotiation, (93) 536 Out-of-kilter algorithm, (88) 586 Potentially good designs, (89) 618 Neighborhood search, (90) 227 Outranking method, (89) 457 Potentials, (91) 1 Nesting, (92) 368 Overhead, (94) 261, (95) 427 Power functions, (94) 467 Network, (89) 176, (90) 427 Practice, (89) 581 Network complexity measure, (81) 347 Packing, (92) 193 Precedence constraint, (94) 231 Network design, (90) 26, (94) 362 Packing problems, (88) 165 Precedence constraints, (94) 242, (94) 252, Network programming, (89) 564, (92) 37, PAC leaming, (94) 405 (94) 271 (92) 214, (95) 476 Pairwise comparison, (93) 611 Precedence graph, (95) 427 Network reduction, (81) 347 Pairwise comparisons, (94) 467 Prediction, (92) 417 Networks /graphs, (90) 334 Parallel algorithms, (89) 525, (89) 556, (92) Preemption, (90) 334 Neural nets, (89) 581, (90) 577, (93) 369 573 Preference modelling, (95) 115 Neural networks, (89) 556, (92) 528, (93) Parallel computation, (94) 231 Preferences, (88) 251 230, (93) 244, (93) 271, (93) 288, (93) Parallel computing, (93) 244 Press distribution, (90) 1 317, (93) 331, (93) 346, (93) 387, (93) Parallel coordinates, (90) 142 Preventive maintenance, (94) 425 402, (93) 428, (93) 511, (95) 24 Parallel machines, (89) 172 Price-directive decomposition, (91) 587 Neural Networks, (93) 300 Parallel machine scheduling, (94) 277, (94) Pricing, (88) 13, (90) 115, (90) 589, (91) Neural network training, (93) 358 302 528, (92) 266, (93) 476 New products, (93) 476 Parallel processing, (94) 215 Primal partitioning, (92) 37 Newsboy problem, (94) 29 Parallel shop, (89) 516 Principal—agent, (90) 625 New ventures, Decision support system, (9G) Parametric analysis, (89) 176 Priority rules, (90) 320 473 Parametric Linear Programming, (89) 609 Probabilistic programming, (90) 395 Nonconvex programming, (94) 167 Parametric programming, (92) 148, (92) 368 Probabilistic reasoning, (94) 488 Nondominated efficient frontier, (95) 390 Part coding, (92) 637 Probabilistic voting, (95) 264 Nonlinear integer programming, (92) 326, Part feature, (93) 88 Probability generating function, (88) 614 (95) 38 Partial order, (92) 649 Problem generator, (90) 376 Nonlinear problem, (94) 87 Path-following primal—dual algorithm, (89) Problem restructuring, (93) 602 Non-linear programming, (81) 386 202 Process design, (94) 186 Nonlinear programming, (88) 537, (88) 572, Pattern layout, (92) 368 Process planning, (88) 446 (90) 420, (92) 37, (93) 358 PCB assembly, (91) 124 Process switching, (91) 517 Keyword Index Product design, (92) 28 Queues, (89) 326, (92) 112 Routing-grouping problem, (91) 587 Production, (88) 69, (89) 302, (89) 326, Queuing, (88) 152 Routing problem, (93) 98 (90) 115, (91) 38, (92) 474, (93) 68, r-separation, (92) 342 (93) 476, (94) 122, (95) 313, (95) 522 Radar, (90) 13 Run-length distribution, (95) 641 Production and work force smoothing, (91) Rail freight transportation, (90) 26, (94) 43 89 Random algorithms, (95) 411 Salesforce, (89) 1 Production-delivery system, (89) 593 Random approach, (95) 191 Sample derivatives, (91) 1 Production line, (92) 1 Random disturbance, (95) 390 Scalarizing functions, (89) i193 Production line design, (89) 496 Ranking, (90) 461, (90) 514 Schedule, (91) 203 Production line systems, (91) 481 Rating, (90) 514 Scheduling, (81) 367, (88) 336, (88) 404, Production planning, (89) 86, (89) 355, (91) Rational choice, (92) 603 (88) 550, (89) 86, (90) 13, (90) 200, 89, (92) 281, (94) 561 Ratio scale, (91) 27 (90) 214, (90) 252, (90) 269, (91) 124, Production policies, (90) 182 R&D, (95) 284 (91) 190, (92) 628, (93) 34, (93) 288, Production possibility set, (95) 491 Recursivity, (91) 553 (94) 16, (94) 122, (94) 215, (94) 231, Production process, (94) 179 Reduced game, (95) 451 (94) 252, (94) 261, (94) 292, (95) 38, Production /scheduling, (88) 328 Redundancy, (92) 352 (95) 344, (95) 427, (95) 537 Production systems, (95) 577 Regression, (93) 230 Scheduling problem, (88) 516 Programming, (88) 50, (90) 334 Relative efficient frontier (DEA efficient Scheduling theory, (88) 231, (89) 516, (91) Programming multiple criteria, (93) 565 surface), (95) 491 176, (93) 68, (93) 75, (94) 271, (94) Programming nonlinear, (93) 565 Relative entropy, (94) 505 284, (94) 302, (94) 349 Project control, (95) 278 Relaxation, (95) 201 Scheduling with due dates, (91) 99 Project management, (88) 50, (88) 320, (89) Relaxations, (88) 490 Schema analysis, (93) 490 355, (89) 525, (90) 334, (95) 211, (95) Reliability, (93) 98, (94) 425, (95) 178 Score function, (88) 413 284 Remanufacturing, (95) 313 Search, (95) 663 Project management and scheduling, (94) Renewal, (94) 179 Search theory, (92) 135 377 Renewal processes, (90) 156 Segmentation, (93) 346 Project planning, (81) 347, (95) 278 Renewal theory, (94) 425 Self organizing maps, (93) 402, (93) 428 Project scheduling, (89) 400, (89) 525, (90) Reordering lead time, (91) 440 Selten component, (89) 570 349, (90) 362, (95) 278 Repairman, (89) 164 Semaphore queue, (92) 99 Project segmentation, (95) 278 Replacement, (91) 74 Sensitivity analysis, (88) 413, (90) 451, (94) Project selection, (94) 87 Reservoir management, (89) 53, (95) 404 167 Promotion, (95) 299 Resource allocation, (81) 411, (88) 320, Sequencing, (88) 345, (91) 99, (93) 300, Pruning, (94) 405 (89) 400, (90) 285, (90) 349, (93) 536, (94) 87 Pseudo-invexity, (88) 572 (94) 284, (94) 453, (95) 284 Sequencing units on assembly lines, (88) Public policy, (88) 231 Resource-constrained project scheduling, 101 Public sector production, (90) 553 (90) 320 Serial and parallel scheduling method, (90) Public service, (90) 536 Resource-constrained scheduling, (90) 214 320 Purchasing, (90) 142, (94) 122, (95) 53, Resource constraints, (88) 50, (90) 334, (90) Service, (89) 341, (91) 427, (92) 239, (95) (95) 299 362, (94) 377 537 Resource uncertainty, (88) 88 Service center management, (89) 246 Retailing, (88) 13 Service design, (88) 152 Quadratic Assignment Problem, (88) 139 Retum on quality (ROQ), (91) 427 Service level, (95) 241 Quadratic assignment problem, (89) 556, Retums to scale, (88) 583, (89) 473 Service levels, (91) 440, (95) 1 (92) 402, (94) 384 Revelation principle, (89) 226 Service productivity, (91) 427 Quadratic cost partition, (94) 154 Right-hand side, (92) 148 Service quality, (91) 427 Quadratic programming, (91) 619, (92) 166, Rigid and flexible contingency plans, (89) Service systems, (89) 277, (92) 83 (93) 469, (94) 134, (94) 167, (95) 231, 618 Set covering, (94) 392 (95) 420 Risk analysis, (81) 338, (93) 173 Setups, (91) 56 Qualitative variables, (90) 473 Risk management, (93) 173 Set-up time, (90) 200 Quality, (91) 38, (93) 476, (94) 179, (94) Road traffic control, (92) 550 Shadow prices and resource prices, (89) 618 477, (95) 549 Road transportation, (93) 230 Shifting bottleneck heuristic, (90) 252 Quality control, (92) 615, (95) 641 Roadway grades, (93) 148 Shortages, (89) 313 Quantity discounts, (95) 611 Robustly efficient production frontiers, (88) Simplex method, (88) 537, (89) 176 Queueing, (88) 592, (89) 164, (89) 226, 525 Simulated annealing, (88) 516, (89) 135, (89) 237, (89) 246, (89) 269, (89) 277, Robustness, (90) 451 (90) 26, (90) 200, (91) 99, (91) 124, (89) 496, (92) 1, (95) 73, (95) 374 Robust optimization, (94) 362 (92) 402, (93) 61, (93) 522 Queueing models, (92) 83 Robust solutions, (92) 28 Simulated Annealing, (92) 493, (94) 43 Queueing network, (88) 586, (89) 147 Rough sets, (95) 264 Simulation, (81) 338, (88) 304, (88) 413, Queueing networks, (81) 386 Route planning, (90) | (89) 341, (90) 13, (90) 171, (90) 413, Queueing theory, (93) 110 Routing, (88) 446, (89) 226, (90) 45, (91) (91) 27, (92) 550, (95) 344 Queue length, (92) 125 623, (93) 121, (93) 135 Single machine, (88) 345, (90) 200, (91) 190, (94) 87 678 Keyword Index Single machine scheduling, (89) 100, (93) Subset choice, (92) 182 Trust region subproblem, (94) 167 49, (93) 61, (94) 203, (94) 277 Substitution rates, (94) 467 Two-dimensional cutting, (91) 553 Single machine scheduling problem, (92) Supply chain, (94) 1 Two-dimensional maximum neuron model, 387 Synergy allocation, (88) 42 (89) 556 Single-pass scheduling and sampling, (90) Synthesizing priorities, (93) 550 Two-moment approximation, (88) 592 320 System development, (92) 458 Two-stage guillotine cutting, (91) 543 Single-period inventory problem, (94) 29 System Dynamics, (90) 609 Slack time, (88) 336 Systems, (90) 547, (92) 239 Uncertainty, (88) 28, (89) 427 Smoothing parameters, (94) 106 Systems dynamics, (89) 668 Unit-linked policy, (91) 235 Social choice, (95) 264 Unit periods of waiting, (93) 121 Social cohesion, (94) 439 Taboo search, (91) 124 Unit time operations, (94) 310 Spanning forest, (91) 565 Tabu Search, (88) 563, (90) 26, (90) 200, Unsupervised learning, (93) 402 Spanning tree, (89) 423 (91) 160, (92) 493, (93) 317, (94) 43, Upper and lower bounds, (92) 99 Spare, (90) 171 (94) 349, (94) 582 Urban administration, (90) 71 Spatial voting game, (95) 264 Tabu search techniques, (88) 516 Utility functions, (95) 115 Special ordered sets, (88) 182 Tactical planning, (94) 43 Utility theory, (92) 182, (94) 599 Spectral analysis, (89) 34 Taguchi penalty function, (94) 477 Spectral decomposition, (93) 611 Task scheduling, (89) 366 Vacation models, (88) 614 Standardised objective function, (94) 179 Term structure, (93) 205 Validation, (92) 458 State space modeling, (89) 34 Third Council Directive of EC, (88) 42 Valuation network, (93) 628 Statistical analysis, (90) 487 Three-dimensional assignment problems, Value-focused thinking, (92) 537 Statistical inference, (94) 43 (91) 611 Value iteration, (88) 622 Statistical optimization, (93) 550 Threshold risk, (88) 257 Value of information, (92) 615 Statistical process control, (88) 203 Tight schedules, (94) 377 Value-preserving, (91) 274 Statistical regression, (92) 417 Time /cost trade-off, (88) 50 Values, (92) 537 Statistics, (92) 254, (94) 179 Time dependence, (90) 45 Variable sampling, (90) 383 Statistics: Empirical, (92) 254 Time series, (8!) 306, (90) 566, (93) 155, Variance of the sample mean, (88) 304 Statistics: regression, (93) 369 (94) 194 Variance reduction, (94) 477 Steady state, (89) 164 Timetabling, (91) 619, (92) 474, (93) 271 Variational inequality, (91) 274 Steady-state probability, (88) 614 Time windows, (90) 1, (91) 190 VARMAX-processes, (90) 85 Stochastic, (95) 167 Tool allocation, (94) 335 Vector optimization problems, (89) 185 Stochastic dominance, (95) 139 Tool replacement, (92) 63 Vehicle routing, (90) 1, (91) 573 Stochastic efficiency, (95) 390 Total completion time, (94) 242 Vehicle routing problem, (88) 464, (88) 475, Stochastic gradient descent optimization, Total quality, (88) 203 (89) 108, (93) 135 (93) 244 Total relevant cost, (90) 182 Vehicle scheduling, (93) 121 Stochastic modeling, (89) 259 Tournaments, (95) 411 Vendor negotiations, (90) 142 Stochastic modelling, (91) 481 Trading, (90) 536 Virtual waiting time, (92) 125 Stochastic models, (89) 127 Traffic engineering, (92) 550 Visual interactive modelling (VIM), (91) 14 Stochastic optimization, (88) 586, (89) 53, Trailers, (93) 135 Visual interactive simulation (VIS), (91) 14 (94) 618 Transaction costs, (91) 250, (93) 185 Volatility, (93) 205 Stochastic processes, (89) 246, (89) 326, Transfer line, (92) 1 Voting, (90) 461, (95) 264 (92) 135 Transformation of variables, (93) 620 V-shaped, (88) 345 Stochastic program, (88) 28 Transmission—telecommunication networks, V-shape property, (91) 118 Stochastic scheduling, (91) 118 (91) 587 Stochastic vehicle routing, (88) 3 Transportation, (90) 45, (90) 427, (93) 148, Warranty policies, (90) 156 Stock cutting, (92) 368 (93) 469 Waste disposal, (95) 313 Stock-dependent demand rate, (95) 604 Transshipment problem, (89) 176 Waste management, (90) 71 Stock index futures, (95) 623 Traveling salesman problem, (90) 45, (93) Waste waters, (88) 251 Stock price, (90) 566 121 Weibull distribution, (94) 43 Strategic planning, (88) 215, (95) 89 Travelling Salesman Problem, (88) 139 Weighted lateness, (88) 336 Strongly NP-hard, (94) 203 Tree, (93) 224 Well-posedness, (94) 610 Strong-valid inequalities, (93) 224 Tree induction, (93) 511 Workforce assignment, (90) 285 Subgradient methods, (88) 382 Trees, (94) 261, (95) 178 Work-in-process, (95) 374 Subgraph, (93) 224 Triangular fuzzy mumbers, (95) 649 Submodular function, (94) 154 Trim problem, (95) 631 Zero—one quadratic programming, (92) 310 EUROPEAN JOURNAL OF OPERATIONAL RESEARCH LSEVIER European Journal of Operational Research 96 (1997) 679-696 Author Index Volumes 88—95 (1996) Aarts, E.H.L., see Nuijten, W.P.M. 90 (1996) 269 Abd El-Ghaffar, F.S., see Hussein, M.L. 89 (1996) 185 Abel, A. and P. Korhonen, Using aspiration levels in an interactive interior multiobjective linear programming algorithm 89 (1996) 193 Achuthan, N.R., L. Caccetta and S.P. Hill, A new subtour elimination constraint for the vehicle routing problem 91 (1996) 573 Adamopoulos, G.I. and C.P. Pappis, A fuzzy-linguistic approach to a multi-criteria sequencing problem 92 (1996) 628 Adamopoulos, G.I. and C.P. Pappis, Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method 88 (1996) 336 Adan, I.J.B.F., W.A. van de Waarsenburg and J. Wessels, Analyzing E,| E,|c queues 92 (1996) 112 Adenso-Diaz, B., An SA/TS mixture algorithm for the scheduling tardiness problem 88 (19965)1 6 Agrawal, M.K., S.E. Elmaghraby and W.S. Herroelen, DAGEN: A generator of testsets for project activity nets 90 (1996) 376 Ahire, S.L. and C.P. Schmidt, A model for a Mixed Continuous-Periodic Review One-Warehouse, N-Retailer inventory system 92 (1996) 69 Ahuja, R.K., J.L. Batra, S.K. Gupta and A.P. Punnen, Optimal expansion of capacitated transshipment networks 89 (1996) 176 Akella, R., see Gurnani, H. 89 (1996) 302 Aksoy, Y., T.W. Butler and E.D. Minor, III, Comparative studies in interactive multiple objective mathematical programming 89 (19964)0 8 Akturk, M.S. and S. Avci, Tool allocation and machining conditions optimization for CNC machines 94 (1996) 335 Al-Fawzan, M., see Ben-Daya, M. 93 (1996) 61 Al-Olayan, A.S., see Kabir, A.B.M.Z. 90 (1996) 171 Al-Rabeh, A.H., see Selim, S.Z. 90 (1996) 420 Al-Turki, U.M., J. Mittenthal and M. Raghavachari, A dominant subset of V-shaped sequences for a class of single machine sequencing problems 88 (1996) 345 Albers, S., Optimization models for salesforce compensation 89(1996) 1 Alfa, A.S. and I. Frigui, Discrete NT7-policy single server queue with Markovian arrival process and phase type service 88 (1996) 599 Alpaydin, E., i.K. Altinel and N. Aras, Parametric distance functions vs. nonparametric neural networks for estimating road travel distances 93 (1996) 230 Altnel, i.K., see Alpaydin, E. 93 (1996) 230 Altman, A., M. Amann, G. Klaassen, A. Ruszczyfiski and W. Schépp, Cost-effective sulphur emission reduction under uncertainty 90 (1996) 395 Amado, L. and P. Barcia, New polynomial bounds for matroidal knapsacks 95 (1996) 201 Amann, M., see Altman, A. 90 (1996) 395 Amiri, A. and H. Pirkul, Primary and secondary route selection in backbone communication networks 93 (1996) 98 Anderson, E.J., Mechanisms for local search 88 (1996) 139 Aras, N., see Alpaydin, E. 93 (1996) 230 Arbel, A. and S.S. Oren, Using approximate gradients in developing an interactive interior primal—dual multiobjective linear programming algorithm 89 (1996) 202 Arcelus, F.J. and M.A. Rahim, Reducing performance variation in the canning problem 94 (1996) 477 Arenales, M.N., see Morabito, R. 94 (1996) 548 Arteola-Risa, A., Integrated multi-item production—-inventory systems 89 (1996) 326 Arshanapalli, B.G. and O.K. Gupta, Optimal hedging under output price uncertainty 95 (1996) 522 Aspinwall, E.M., see Bennett, J.C. 95 (19964)6 7 Atan, T.S. and R. Pandit, Auxiliary tool allocation in flexible manufacturing systems 89 (1996) 642 0377-2217 /97/$15.00 © 1997 Elsevier Science B.V. All rights reserved 680 Author Index Athanassopoulos, A.D., Assessing the comparative spatial disadvantage (CSD) of regions in the European Union using non-radial data envelopment analysis methods 94 (19964)3 9 Au, G. and R.J. Paul, Visual interactive modelling: A pictorial simulation specification system 91 (1996) 14 Avci, S., see Akturk, M.S. 94 (1996) 335 Avenhaus, R., M. Canty, D.M. Kilgour, B. von Stengel and S. Zamir, Inspection games in arms control 90 (1996) 383 Averbakh, I. and O. Berman, Locating flow-capturing units on a network with multi-counting and diminishing retums to scale 91 (1996) 495 Ayllén, F.G., J. Galan, A. Marin and A. Menéndez, Price-directive decomposition applied to routing in telecommuni- cation networks 91 (1996) 587 Babad, Y.M., M. Dada and A.N. Saharia, An appointment-based service center with guaranteed service 89 (1996) 246 Babu, A.J.G. and N. Suresh, Project management with time, cost, and quality considerations 88 (1996) 320 Bacinello, A.R. and F. Ortu, Fixed income linked life insurance policies with minimum guarantees: Pricing models and numerical results 91 (1996) 235 Badinelli, R.D., Approximating probability density functions and their convolutions using ¢:thogonal polynomials 95 (1996) 211 Badri, M.A., A two-stage multiobjective scheduling model for [faculty—course—time] assignments 94 (1996) 16 Bagchi, A., N. Bhattacharyya and N. Chakravarti, LP relaxation of the two dimensional knapsack problem with box and GUB constraints 89 (19966)0 9 Balachandran, K.R. and S. Radhakrishnan, Cost of congestion, operational efficiency and management accounting 89 (1996) 237 Balakrishnan, P.V.S., M.C. Cooper, V.S. Jacob and P.A. Lewis, Comparative performance of the FSCL neural net and K-means algorithm for market segmentation 93 (1996) 346 Balkhi, Z.T. and L. Benkherouf, A production lot size inventory model for deteriorating items and arbitrary production and demand rates 92 (1996) 302 Bampis, E., A. Giannakos and J.-C. Konig, On the complexity of scheduling with large communication delays 94 (1996) 252 Bampis, E., F. Guinand and D. Trystram, Minimizing the overhead for some tree-scheduling problems 94 (1996) 261 Bampis, E., J.-C. Konig and D. Trystram, Minimizing the schedule length for a parallei 3D-grid precedence graph 95 (1996) 427 Bandopadhyaya, L., see Gupta, R. 95 (1996) 231 Banker, R.D., H. Chang and W.W. Cooper, Equivalence and implementation of alternative methods for determining retums to scale in data envelopment analysis 89 (1996) 473 Banker, R.D., I. Bardhan and W.W. Cooper, A note on returns to scale in DEA 88 (1996) 583 Banville, C., see Landry, M. 92 (1996) 443 Baourakis, G., N.F. Matsatsinis and Y. Siskos, Agricultural product development using multidimensional and multicriteria analyses: The case of wine 94 (1996) 321 Barad, M. and G. Bennett, Optimal yield improvement in multi-stage manufacturing systems 95 (1995) 549 Barcia, P., see Amado, L. 95 (1996) 201 Bardhan, I., see Banker, R.D. 88 (1996) 583 Barnes, J.W., see Carlton, W.B. 95 (1996) 237 Bart, H. and L.G. Kroon, Variants of the Two Machine Flow Shop Problem connected with factorization of matrix functions 91 (1996) 144 Barucci, E. and L. Landi, Speculative dynamics with bounded rationality learning 91 (1996) 284 Bashyam, T.C.A., Competitive capacity expansion under demand uncertainty 95 (1996) 89 Batra, J.L., see Ahuja, R.K. 89 (1996) 176 Batta, R., see Naik, A.V. 88 (1996) 231 Battaglio, C., G. Longo and L. Peccati, Restyling of fees in consumers credit and their optimization 91 (1996) 330 Bautista, J., R. Companys and A. Corominas, Heuristics and exact algorithms for solving the Monden problem 88 (1996) 101 Baveja, A., see Naik, A.V. 88 (19962)3 1 Beasley, J.E. and B. Cao, A tree search algorithm for the crew scheduling problem 94 (19965)1 7 Beasley, J.E. and P.C. Chu, A genetic algorithm for the set covering problem 94 (1996) 392 Beckefeld, V., see Dillmann, R. 90 (1996) 1 Becker, B., see Dillmann, R. 90 (1996) 1 Bector, C.R., see Narayanaswamy, P. 93 (1996) 88 Bell, C.E., Finding improving directions in Lagrangian relaxation by fictitious play: A NASA scheduling application 88 (1996) 550 Belton, V. and D. Bouyssou, Aspects of Operational Research: Tutorial and Research Review papers from EURO XIII/OR 36 92 (1996) 441 Ben-Arieh, D., S.E. Lee and P.T. Chang, Fuzzy part coding for Group Technology 92 (1996) 637 Ben-Daya, M. and M. Al-Fawzan, A simulated annealing approach for the one-machine mean tardiness scheduling problem 93 (1996) 61 Ben-Daya, M., S.O. Duffuaa and A. Raouf, Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine 89 (1996) 100 Ben-Daya, M., see Hariga, M.A. 89 (19963)1 3 Ben Horin, M., see Spector, Y. 93 (1996) 620