Multi-Level Lot Sizing and Scheduling
Methods for Capacitated, Dynamic, and Deterministic Models
Published on 18. November 1996
Book
Paperback/Softback
XXIV, 356 pages
978-3-7908-0967-1 (ISBN)
Description
This book is the outcome of my research in the field of multi levellot sizing and scheduling which started in May 1993 at the Christian-Albrechts-University of Kiel (Germany). During this time I discovered more and more interesting aspects ab out this subject and I had to learn that not every promising idea can be thoroughly evaluated by one person alone. Nevertheless, I am now in the position to present some results which are supposed to be useful for future endeavors. Since April 1995 the work was done with partial support from the research project no. Dr 170/4-1 from the "Deutsche For schungsgemeinschaft" (D FG). The remaining space in this preface shaH be dedicated to those who gave me valuable support: First, let me express my deep gratitude towards my thesis ad visor Prof. Dr. Andreas Drexl. He certainly is a very outstanding advisor. Without his steady suggestions, this work would not have come that far. Despite his scarce time capacities, he never rejected proof-reading draft versions of working papers, and he was always willing to discuss new ideas - the good as weH as the bad ones. He and Prof. Dr. Gerd Hansen refereed this thesis. I am in debted to both for their assessment. I am also owing something to Dr. Knut Haase. Since we al most never had the same opinion when discussing certain lot sizing aspects, his comments and criticism gave stimulating input.
More details
Series
Edition
1997 ed.
Language
English
Place of publication
Heidelberg
Germany
Target group
Professional and scholarly
Research
Illustrations
XXIV, 356 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 21 mm
Weight
575 gr
ISBN-13
978-3-7908-0967-1 (9783790809671)
DOI
10.1007/978-3-642-50162-3
Schweitzer Classification
Content
1 Introduction.- 1.1 Problem Context.- 1.2 Problem Outline and General Issues.- 1.3 Case Descriptions.- 1.4 Current Practice and Motivation.- 1.5 Chapter Synopsis.- 2 Literature Review.- 2.1 Scope of the Review.- 2.2 Contributions of General Interest.- 2.3 Dynamic Demand, Unlimited Capacity.- 2.4 Dynamic Demand, Scarce Capacity.- 2.5 Intermediate Results.- 3 Problem Specifications.- 3.1 Basic Assumptions.- 3.2 Multiple Machines.- 3.3 Problem Insights.- 3.4 Parallel Machines.- 3.5 Multiple Resources.- 3.6 Partially Renewable Resources.- 4 Instance Generation.- 4.1 Methods.- 4.2 Experimental Design for the PLSP-MM.- 4.3 A Comparison of Computing Machines.- 5 Lower Bounds.- 5.1 Network Representations.- 5.2 Capacity Relaxation.- 5.3 Lagrangean Relaxation.- 5.4 Summary of Evaluation.- 6 Multiple Machines.- 6.1 Unsuccessful Attempts.- 6.2 Common Construction Principles.- 6.3 Randomized Regret Based Sampling.- 6.4 Cellular Automata.- 6.5 Genetic Algorithms.- 6.6 Disjunctive Arc Based Tabu Search.- 6.7 Demand Shuffle.- 6.8 Summary of Evaluation.- 6.9 Some Tests with Large Instances.- 7 Parallel Machines.- 7.1 Related Topics: Job Scheduhng.- 7.2 A Demand Shuffle Adaption.- 7.3 Preliminary Experimental Evaluation.- 8 Multiple Resources.- 8.1 Related Topics: Project Scheduling.- 8.2 A Demand Shuffle Adaption.- 8.3 Preliminary Experimental Evaluation.- 9 Partially Renewable Resources.- 9.1 Related Topics: Course Scheduling.- 9.2 A Demand Shuffle Adaption.- 9.3 Preliminary Experimental Evaluation.- 10 Rolling Planning Horizon.- 10.1 Literature Review.- 10.2 Stability Measures.- 10.3 Pitfalls: Initial Inventory.- 11 Method Selection Guidelines.- 11.1 Basic Ideas.- 11.2 Instance Characterization.- 12 Research Opportunities.- 12.1 Extensions.- 12.2 Linkages to Other Areas.- 13 Conclusion.- A Lower Bounds for the PLSP-MM.- A.l LP-Relaxation: PLSP-Model.- A.2 LP-Relaxation: Plant Location Model.- A.3 Capacity Relaxation.- A. 4 Lagrangean Relaxation.- B Upper Bounds for the PLSP-MM.- B. l Randomized Regret Based Sampling.- B.2 Cellular Automaton.- B.3 Genetic Algorithm.- B.4 Disjunctive Arc Based Tabu Search.- B.5 Demand Shuffle.- C PLSP-PM: Demand Shuffle.- D PLSP-MR: Demand Shuffle.- E PLSP-PRR: Demand Shuffle.- List of Tables.- List of Figures.