Optimizing production and outbound distribution decisions with fixed departure times : static and dynamic scheduling approaches / vorgelegt von David Bachtenkirch, M.Sc. Wuppertal, März 2021
Inhalt
- List of Figures
- List of Tables
- List of Algorithms
- List of Abbreviations
- List of Symbols
- Introduction
- Selected Topics of Operations Research and Scheduling
- Integrated Production and Outbound Distribution Scheduling with Fixed Delivery Departure Dates
- Considering Fixed Delivery Departure Dates
- A Classification Scheme for IPODS-FD
- A Review of Models with Fixed Departure Dates
- Models with Predetermined Deliveries
- Models with Equidistant Deliveries
- Models with Arbitrary Delivery Departure Dates
- Models with Multiple Customers
- Models with Batch Deliveries
- Conclusion
- The Scheduling Problem with Flexible Definable Departure Dates
- Problem Description and Application Areas
- Problem Definition and Notation
- A Mixed-Integer Linear Programming Formulation
- Computational Complexity
- Conclusion
- The Developed Branch and Bound Algorithm
- Principles of Branch-and-Bound Algorithms
- Search Space and Solution Properties of the SFDDHT
- Schedule Representation
- Canonical Schedules
- Canonical Search Space
- Decomposition of the Canonical Search Space
- Structural Analysis of Canonical Schedules
- Dominance Relations and Procedures
- Dominating Permutations
- Efficient Comparison of Permutation Schedules
- Permutation Dominance Procedure
- Production Block Dominance Procedure
- Delivery Batch Dominance Procedure
- Dominance Table
- Application Order of the Dominance Procedures
- Preprocessing Procedures
- Dynamic Feasibility Testing
- Branching Strategy
- Lower Bounds
- Linear Assignment Bound
- Bounding the Number of Additional Transports
- Parallel Machine Bound
- Partition Bound
- Discussion of the Lower Bounds
- Algorithm Execution
- Conclusion
- The Developed Greedy Randomized Adaptive Search Procedure
- Principles of the Solution Method
- Construction Phase
- Selection Order of Jobs
- Construction Moves
- Reducing the Set of Construction Moves
- Outline of the Construction Procedure
- Repair and Improvement Phase
- Path relinking
- Elite Pool and Implementation
- Conclusion
- The Developed Real-Time Control Approach
- The Considered Dynamic Scheduling Problem
- The Real-Time Control Approach
- Update Handling
- Simulation of the Current Anticipation Horizon and Static Instance Generation
- Solving Static Instances
- Adaption of the Stored Theoretical Schedules
- Integration of Order Requests
- Workload-Balancing Techniques
- Conclusion
- Evaluation of the Developed Optimization Approaches
- Instance Generation
- Setup of the Computational Experiments for the SFDDHT
- Comparison of the Proposed Lower Bounds
- Comparison of the CPLEX Solver and the SFDDHT-B&B
- Evaluation of the SFDDHT-GRASP
- Setup of the Computational Study for the D-SFDDHT
- Comparison of the Real-Time Control Workload-Balancing Methods
- Initial Analysis of the Results
- Analysis with Different Performance Indicators
- Comparison with Static Schedules
- Analysis for Flexible and Inflexible Environments
- Comparison of Different Real-Time Control Time Settings
- Evaluation of the Real-Time Control Approach Executed on Instances with an Increased Number of Dynamic Job Arrivals
- Evaluation of the Optimization Performance
- Conclusion
- Summary and Outlook
- Bibliography
- Additional Results