+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Decision Analysis, Location Models, and Scheduling Problems - H. A. Eiselt

Decision Analysis, Location Models, and Scheduling Problems

Hardcover Published: 27th October 2003
ISBN: 9783540403388
Number Of Pages: 457

Share This Book:


or 4 easy payments of $56.99 with Learn more
Ships in 10 to 15 business days

Earn 456 Qantas Points
on this Book

Other Available Editions (Hide)

  • Paperback View Product Published: 30th November 2010
    Ships in 10 to 15 business days

The purpose of this book is to provide readers with an introduction to the fields of decision making, location analysis, and project and machine scheduling. The combination of these topics is not an accident: decision analysis can be used to investigate decision seenarios in general, location analysis is one of the prime examples of decision making on the strategic Ievel, project scheduling is typically concemed with decision making on the tactical Ievel, and machine scheduling deals with decision making on the operational Ievel. Some of the chapters were originally contributed by different authors, and we have made every attempt to unify the notation, style, and, most importantly, the Ievel of the exposition. Similar to our book on Integer Programming and Network Models (Eiselt and Sandblom, 2000), the emphasis of this volume is on models rather than solution methods. This is particularly important in a book that purports to promote the science of decision making. As such, advanced undergraduate and graduate students, as weil as practitioners, will find this volume beneficial. While different authors prefer different degrees of mathematical sophistication, we have made every possible attempt to unify the approaches, provide clear explanations, and make this volume accessible to as many readers as possible.

Industry Reviews

From the reviews:

"Decision Analysis, Location Models, and Scheduling Problems is best described as a broad review of topics relating to decision sciences. ... The authors move quickly into detailed topics, gearing the book for an advanced audience. ... it could serve nicely as the primary text for advanced OR courses intended to survey many topics in decision making. Eiselt and Sandblom provide several examples illustrating the use of the different methodologies, which may also make the book appealing to practitioners." (Brian Denton, Interfaces, Vol. 35 (3), 2005)

Introductionp. 1
Notationp. 1
Support Methodologyp. 3
Algorithms and Computational Complexityp. 3
Matrix Algebrap. 5
Graphs and Networksp. 9
Linear and Integer Optimizationp. 11
Statisticsp. 13
Analysis of Decision Makingp. 19
Multicriteria Decision Makingp. 23
Vector Optimizationp. 24
Basic Ideas of Multicriteria Decision Makingp. 29
Reference Point Methodsp. 37
Data Envelopment Analysisp. 40
Preference Conesp. 43
Multiattribute Value Functionsp. 46
Outranking Methodsp. 50
Methods Allowing Inconsistent Estimatesp. 61
Games Against Naturep. 73
Elements of Games Against Naturep. 73
Basic Componentsp. 73
Lotteries and Certainty Equivalentsp. 76
Visualizations of the Structure of Decision Problemsp. 81
Rules for Decision Making Under Uncertainty and Riskp. 87
Multi-Stage Decisions and the Value of Informationp. 99
Game Theoryp. 111
Features of Game Theoryp. 112
Elements and Representations of Gamesp. 112
Solution Conceptsp. 116
Two-Person Zero-Sum Gamesp. 122
Extensionsp. 133
Bimatrix Gamesp. 133
Multi-Stage Gamesp. 140
w-Person Gamesp. 143
Location and Layout Decisionsp. 151
Fundamentals of Location and Layout Problemsp. 153
The Nature of Location Problemsp. 153
The History of Location Modelsp. 155
The Major Elements of Location Problemsp. 157
Applications of Location Problemsp. 164
Location Models on Networksp. 169
Covering Modelsp. 170
The Location Set Covering Problemp. 171
The Maximal Covering Location Problemp. 175
Center Problemsp. 178
1-Center Problemsp. 179
p-Center Problemsp. 186
Median Problemsp. 188
Basic Results and Formulation of the Problemp. 189
1-Median Problemsp. 192
p-Medians Problemsp. 194
Simple and Capacitated Plant Location Problemsp. 205
An Application of the Capacitated Facility Location Problemp. 208
Continuous Location Modelsp. 211
Covering Problemsp. 212
Single-Facility Minimax Problemsp. 214
Minisum Problemsp. 220
Single-Facility Problemsp. 220
Multi-Facility Problemsp. 228
Other Location Modelsp. 237
The Location of Undesirable Facilitiesp. 237
p-Dispersion Problemsp. 243
Location Models with ""Equity"" Objectivesp. 244
Hub Location Problemsp. 247
Competitive Location Problemsp. 248
Locating Extensive Facilities and Routing in Irregular Spacesp. 252
Layout Modelsp. 255
Facility Layout Planningp. 256
Formulations of the Basic Layout Problemp. 260
Special Cases of the Quadratic Assignment Problemp. 266
Triangulation Problemsp. 267
Traveling Salesman Problemsp. 268
Matching Problemsp. 269
Applicationsp. 270
Relay Team Runningp. 270
Backboard Wiringp. 271
Building Layout Planningp. 272
Keyboard Designp. 273
Solution Methodsp. 275
Exact Solution Methodsp. 275
Heuristic Solution Methodsp. 290
Solving General Facility Layout Problemsp. 292
Project Schedulingp. 295
Unconstrained Time Project Schedulingp. 297
Network Representationsp. 297
The Critical Path Methodp. 302
Project Acceleration (Crashing)p. 309
Incorporating Uncertainties (PERT)p. 313
Project Scheduling with Resource Constraintsp. 319
The Problems and its Formulationp. 319
Exact Solution methodsp. 326
Heuristic Methodsp. 328
Machine Scheduling Modelsp. 333
Fundamentals of Machine Schedulingp. 335
Introductory Examplesp. 335
The Models and Their Componentsp. 340
Basic Concepts, Notation and Performance Criteriap. 340
Interpretation and Discussion of Assumptionsp. 345
A Classification Schemep. 346
Algorithmic Approachesp. 350
Single Machine Schedulingp. 353
Minimizing Makespanp. 353
Minimizing Mean Flow Timep. 353
The Shortest Processing Time Algorithmp. 354
The Mean Weighted Flow Time and Other Problemsp. 356
Minimizing Objectives Involving Due Datesp. 360
Earliest Due Date Schedulingp. 360
Other Problemsp. 362
Parallel Machine Modelsp. 367
Minimizing Makespanp. 367
Identical Machines and Tasks of Arbitrary Lengthsp. 367
Other Algorithms for Identical Machinesp. 375
Algorithms for Uniform and Unrelated Machinesp. 381
Minimizing Mean Flow Timep. 387
Identical Machinesp. 387
Uniform and Unrelated Machinesp. 389
Minimizing Maximal Latenessp. 393
Identical Machinesp. 393
Uniform and Unrelated Machinesp. 396
Dedicated Machine and Resource-Constrained Modelsp. 399
Open Shop Schedulingp. 399
Flow Shop Schedulingp. 401
Job Shop Schedulingp. 403
Basic Ideasp. 403
A Branch and Bound Algorithmp. 407
The Shifting Bottleneck Heuristicp. 411
Resource-Constrained Machine Schedulingp. 415
Referencesp. 421
Subject Indexp. 453
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9783540403388
ISBN-10: 3540403388
Audience: General
Format: Hardcover
Language: English
Number Of Pages: 457
Published: 27th October 2003
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.69
Weight (kg): 0.84

Earn 456 Qantas Points
on this Book