상세정보

This is an exploration of the analysis and control of production systems. This edition covers: autoregressive (AR) model, moving average (MA) model, mixed autoregressive moving average (ARMA) model, safety stocks and service levels, ABC classification system, MRP using matrix structures, computing requirements using submatrix structure, comparison between MRP and MRP II, software structure of MRP II, two machines synchronous systems, and push and pull production systems.

정보제공 :

CONTENTS
Preface = xiii
1 Introduction = 1
 1.1 The Production System = 1
 1.2 Production System Analysis = 2
 1.3 The Information Base = 3
 1.4 Organization of this Book = 4
  References = 6
2 Forecasting and Time-series Analysis = 7
 2.1 Introduction = 7
 2.2 Forecasting = 8
 2.3 Forecasting Procedures Versus Curve Fitting = 9
  2.3.1 Gregory-Newton Interpolation Formulas = 9
 2.4 Regression Methods = 12
  2.4.1 Simple Linear Regression = 12
  2.4.2 Multiple Linear Regression = 12
  2.4.3 Linear Regression and Nonlinear Functions = 19
  2.4.4 Correlation = 22
 2.5 Moving-average Method = 26
  2.5.1 Simple Moving Average = 26
  2.5.2 Choosing the Best Model = 29
  2.5.3 Moving Average with Trend = 30
 2.6 Exponential Smoothing = 33
  2.6.1 Simple Exponential Smoothing = 33
  2.6.2 Double Exponential Smoothing = 36
  2.6.3 Choice of $$\alpha $$ = 39
 2.7 Winters's Method for Seasonal Variation = 39
 2.8 Box-Jenkins Methods = 44
  2.8.1 Autoregressive Model = 44
  2.8.2 Moving-average Model = 47
  2.8.3 Mixed Autoregressive Moving-average Model = 49
  2.8.4 Forecasting Using the Box-Jenkins Models = 50
 2.9 Forecasting Errors and Tracking Signals = 50
 2.10 Summary = 53
  Problems = 53
  References = 61
3 Inventory Systems = 63
 3.1 Introduction = 63
 3.2 Inventory Costs = 64
  3.2.1 Inventory Carrying Costs = 64
  3.2.2 Shortage Costs = 64
  3.2.3 Ordering Costs = 64
 3.3 Terminology of Inventory Systems = 64
  3.3.1 Demand = 64
  3.3.2 Lead Time and Replenishment Rate = 65
  3.3.3 Reorder Level = 65
  3.3.4 Safety Stock = 66
 3.4 Inventory Policies = 66
  3.4.1 Periodic-review Policy = 67
  3.4.2 Order up to R Policy = 67
  3.4.3 Continuous-review Policy = 68
  3.4.4. Fixed-reorder Quantity Policy = 68
  3.4.5 Base-stock Policy = 68
 3.5 Demand Characteristics and Inventory Models = 69
 3.6 Analysis of Static Deterministic Inventory Models = 69
  3.6.1 Single-product Model = 70
  3.6.2 Sensitivity Analysis = 76
  3.6.3 Quanitity Discount = 77
  3.6.4 Multiitem Inventory Systems with Constraints = 79
 3.7 Analysis of Probabilistic Inventory Models = 86
  3.7.1 Continuous-review Model : Backorder Case = 87
  3.7.2 Continuous-review Model : Lost Sales Case = 93
  3.7.3 Periodic-review Model = 95
  3.7.4 Safety Stocks and Service Levels = 100
  3.7.5 Approximate Solutions for High Service Levels = 107
  3.7.6 Variability in Lead-time Demand = 109
  3.7.7 Single-period Modes = 110
 3.8 Inventory System Control Practices = 115
  3.8.1 ABC Classification System = 116
  3.8.2 Exchange Curves = 119
 3.9 Extensions of Inventory Models = 123
 3.10 Summary = 124
  Problems = 124
  References = 132
4 Aggregate Production Planning = 134
 4.1 Purpose of Aggregate Production Planning = 134
 4.2 Simple Network Model with Linear Production and Inventory Cost = 135
  4.2.1 Production Plan Disaggregation = 139
 4.3 Linear Production Planning Models : Changing Work-force Levels and Backlogging = 141
 4.4 Disaggregation of an Aggregate Plan = 145
  4.4.1 Constant Production and Demand Rates = 146
  4.4.2 Time-varying Production and Demand Rates = 153
 4.5 Quadratic Cost Model = 159
 4.6 Dynamic Programming Production Planning Models = 163
  4.6.1 Backlogging Prohibited = 163
  4.6.2 Backlogging Allowed = 167
 4.7 Summary = 170
 Problems = 171
 References = 177
5 Material Requirements Planning = 179
 5.1 Introduction = 179
 5.2 Parts Explosion Requirements = 181
 5.3 Computing Direct Dependent Demand = 183
 5.4 Computing Total Requirements = 185
 5.5 Computing Requirements Using Submatrix Structure = 188
 5.6 Engineering Changes = 190
 5.7 Material Requirements Planning System = 191
 5.8 Lot Sizing = 197
 5.9 MRP Versus MRP Ⅱ = 202
  5.9.1 Rough-cut Capacity Planning = 202
  5.9.2 Capacity Requirements Planning = 203
  5.9.3 Shop Floor Control = 203
 5.10 Software Structure of MRP = 203
  5.10.1 MRP Ⅱ Capacity Requirements Planning Illustrated = 206
  5.10.2 Database Implementation of MRP = 214
 5.11 Replanning Frequency in MRP = 216
 5.12 Current MRP Research = 217
 5,13 Summary = 217
 Problems = 218
 References = 228
6 Project Planning and Scheduling = 230
 6.1 Introduction = 230
 6.2 Project Planning and Scheduling : Unlimited Resources = 231
  6.2.1 CPM : Background = 231
  6.2.2 PERT : Background = 231
  6.2.3 Use of CPM／PERT in Industry = 231
  6.2.4 Construction of Project Networks = 232
  6.2.5 Common Errors in Network Construction = 234
  6.2.6 Checking the Consistency of Precedence Relationships = 236
  6.2.7 Critical Path Algorithm = 238
  6.2.8 Linear Programming Formulation = 244
  6.2.9 Cost Models = 246
  6.2.10 Program Evaluation and Review Technique = 249
  6.2.11 Limitations of PERT and／or CPM = 252
 6.3 Project Planning and Scheduling : Limited Resources = 253
  6.3.1 ROT Algorithm = 253
  6.3.2 ACTIM Criterion = 257
  6.3.3 ACTRES and TIMRES Criteria = 258
  6.3.4 Modification of the TIMRES Criterion : GENRES = 259
  6.3.5 Modification of ROT (ROT-ACTIM, ROT-ACTRES) = 261
  6.3.6 TMROS = 261
  6.3.7 TG2 = 263
  6.3.8 Performance of the Algorithms = 264
  6.3.9 Other Scheduling Priorities = 264
  6.3.10 Precedence Diagram Method = 266
  6.3.11 Multiple-project, Multiple-resource Algorithm = 266
 6.4 Line-of-Balance = 272
 6.5 Summary = 277
 Problems = 277
 References = 287
7 Job Sequencing and Operations Scheduling = 290
 7.1 Introduction = 290
 7.2 Job Sequencing = 290
 7.3 n Jobs, One Machine = 294
  7.3.1 n Jobs, One Machine : MFT = 294
  7.3.2 n Jobs, One Machine : Common Due Date = 297
  7.3.3 n Jobs, One Machine : Different Due Dates = 299
  7.3.4 n Jobs, One Machine : Minimization of Earliness and Tardiness = 303
 7.4 n Jobs, Two Nachines = 307
 7.5 n Jobs, Three Machines = 310
  7.5.1 Johnson's Algorithm for n Jobs, Three Machines = 310
  7.5.2 Branch-and-bound Algorithm = 312
 7.6 Two Jobs, M Machines = 317
 7.7 n Jobs, M Machines = 319
  7.7.1 Camlbell et al. Algorithm = 319
  7.7.2 Stinson-Smith Algorithm = 321
  7.7.3 Shifting Bottleneck Procedure = 326
 7.8 Sequencing Jobs on Parallel Machines = 327
  7.8.1 Kaspi-Montreuil Algorithm : Machine Availability = 328
  7.8.2 Parallel Machines : Mean Tardiness = 330
 7.9 Minimization of Setup Costs : Traveling Salesman Problem = 336
 7.10 Job-shop Scheduling = 342
 7.11 Assembly-line Balancing = 344
  7.11.1 Definitions = 345
  7.11.2 Mathematical Programming Formulation = 346
  7.11.3 Kilbridge-Weter Heuristic = 353
  7.11.4 Moodie-Young Method = 357
  7.11.5 Helgeson-Brinie Method or Positional-weight Technique = 360
  7.11.6 Immediate Update First-fit Heuristic = 362
  7.11.7 Rank-and-assign Heuristic = 364
 7.12 Probabilistic Assembly-line Balancing = 366
  7.12.1 Method 1 : Probability Distribution Is Normal = 366
  7.12.2 Method 2 : Distribution Free = 367
 7.13 Automatic Transfer Lines = 370
 7.14 Synchronized Production Lines = 373
  7.14.1 Two-machine Synchronous Systems = 374
 7.15 Summary = 384
 Problems = 384
 References = 400
8 New Directions in Batch and Discrete-parts Production Systems = 403
 8.1 Introduction = 403
 8.2 Group Technology = 403
  8.2.1 Lot Sizing under Group Technology = 408
  8.2.2 Operations Scheduling under Group Technology = 410
  8.2.3 Some Issues in the Implementation of Group Technology = 411
 8.3 Push and Pull Production Systems = 412
  8.3.1 Analysis of Pull and Push Serial Production Lines = 413
  8.3.2 Controllability Issues in Pull and Push Production Lines = 416
 8.4 Kanban Production Systems = 417
  8.4.1 Computing the Number of Kanbans = 421
  8.4.2 Some Issues in the Implementation of Kanban = 422
 8.5 Flexible Manufacturing Systems : An Introduction = 423
  8.5.1 FMS Concept = 423
  8.5.2 Implementations of FMS = 424
  8.5.3 Range of Applications = 425
  8.5.4 Integration of Design, Planning, and Production Control = 425
  8.5.5 FMS and Computer-integrated Manufacturing Systems = 426
  8.5.6 Production Control in the Automated Factory = 431
 8.6 Summary = 433
 Problems = 433
 References = 435
Appendix A : Proof of Equation (3.71) = 438
Appendix B : Tables of Standard Normal Distribution and t Distribution = 440
Appendix C : Table of the Loss Integral for a Standard Normal Distribution = 443
Index = 444