| Document Type
|
:
|
BL
|
| Record Number
|
:
|
871489
|
| Main Entry
|
:
|
Buschkühl, Lisbeth
|
| Title & Author
|
:
|
Multi-level capacitated lotsizing with setup carryover /\ Lisbeth Buschkühl.
|
| Publication Statement
|
:
|
Wiesbaden, Germany :: Springer Gabler,, [2019]
|
|
|
:
|
, ©2008
|
| Series Statement
|
:
|
Edition KWV
|
| Page. NO
|
:
|
1 online resource (xxvii, 219 pages)
|
| ISBN
|
:
|
3658240342
|
|
|
:
|
: 9783658240349
|
|
|
:
|
3658240334
|
|
|
:
|
9783658240332
|
| Notes
|
:
|
Originally published by Kölner Wissenschaftsverlag, Köln, 2008.
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references.
|
| Contents
|
:
|
B.3.1.2 Fix & Relax HeuristicsB. 3.1.3 Rounding Heuristics; B.3.1.4 Linear Programming based Approaches; B.3.1.5 Dantzig-Wolfe Decomposition and Column Generation; B.3.2 Lagrangean Heuristics; B.3.3 Decomposition and Aggregation Approaches; B.3.4 Metaheuristics; B.3.4.1 Local Search; B.3.4.2 Simulated Annealing; B.3.4.3 Tabu Search; B.3.4.4 Variable Neighborhood Search; B.3.4.5 Genetic Algorithms; B.3.4.6 Ant Colony Optimization; B.3.5 Greedy Heuristics; Chapter C Test Instances; C.1 Problem Sizes; C.2 Product and Process Structures; C.3 Demand Profiles; C.4 Setup Time Profiles
|
|
|
:
|
C.5 Setup and Holding Cost RatiosC. 6 Capacity Utilization Profiles; C.7 Number of Parallel Machines; Chapter D Model Formulations; D.1 The Multi-level Dynamic Capacitated Lotsizing Problem with Linked Lotsizes; D.1.1 Inventory & Lotsize Formulation; D.1.2 Echelon Formulation; D.1.3 Shortest Route Formulation; D.1.4 Simple Plant Location Formulation; D.1.5 Computational Results; D.2 Consecutive Setup Carryovers; D.2.1 Standard formulation; D.2.2 Extended formulation; D.2.3 Computational Results; D.3 Parallel Machines; D.3.1 Model Formulation; D.3.2 Computational Results
|
|
|
:
|
Chapter E Solution Procedure based on Lagrangean RelaxationE. 1 Outline of the Procedure; E.2 Computation of the Lower Bound; E.2.1 Single Setup Carryover; E.2.2 Consecutive Setup Carryover; E.3 Lagrangean Multiplier Update; E.4 Computation of the Upper Bound; E.4.1 Inventory Balance Constraints; E.4.2 Setup Carryover Constraints; E.4.2.1 Single Setup Carryover; E.4.2.2 Consecutive Setup Carryover; E.4.3 Capacity Constraints; E.4.3.1 Outline of the Finite Loading Heuristic; E.4.3.2 Order of Consideration of Shifts; E.4.3.3 Shifts; E.4.3.3.1 Changes to the Setup Pattern in the Target Period
|
|
|
:
|
E.4.3.3.2 Changes to the Setup Pattern in the Original PeriodE. 4.3.3.3 Single-Item Forward Shifts; E.4.3.3.4 Multi-Item Forward Shifts; E.4.3.3.5 Single-Item Backward Shifts; E.4.3.3.6 Multi-Item Backward Shifts; E.4.3.3.7 Priority Values; E.4.3.3.8 Tabu Lists; E.4.4 Postoptimization; E.5 Adaptation for Parallel Machines; E.5.1 Aggregate Model Formulation for Resource Types; E.5.2 Computation of a Feasible Solution for Parallel Machines; E.5.2.1 Assignment of Production to Individual Resources; E.5.2.2 Feasibility Routine; E.5.2.2.1 Lot Splitting; E.5.2.2.2 Shifting of Setup Activities; E.5.2.2.3 Modified Finite Loading Heuristic
|
|
|
:
|
Intro; Preface; Contents; List of Figures; List of Tables; List of Algorithms; List of Symbols; List of Abbreviations; Chapter A Introduction and Outline; Chapter B Literature Review; B.1 Model Formulations; B.1.1 The Single-Level Capacitated Lotsizing Problem; B.1.2 The Multi-Level Capacitated Lotsizing Problem; B.1.3 The Single-Level Capacitated Lotsizing Problem with Linked Lotsizes; B.2 Complexity Considerations; B.3 Solution Approaches; B.3.1 Mathematical Programming based Approaches; B.3.1.1 Branch & Bound Heuristics; B.3.1.1.1 Reformulation; B.3.1.1.2 Valid Inequalities
|
| Subject
|
:
|
Economic lot size.
|
| Subject
|
:
|
Production management.
|
| Subject
|
:
|
Production planning.
|
| Subject
|
:
|
Economic lot size.
|
| Subject
|
:
|
Production management.
|
| Subject
|
:
|
Production planning.
|
| Dewey Classification
|
:
|
658.5
|
| LC Classification
|
:
|
TS162.B85 2019
|