de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Dokument suchen
Li, Xiyu: Scheduling problems in rail transshipment yards and industrial production. 2021
Inhalt
Contents
List of Figures
List of Tables
Preface
Structure of the present thesis
Overview of the papers
Two-way bounded dynamic programming approach for operations planning in transshipment yards - The paper of Otto et al. (2017)
Solving the single crane scheduling problem at rail transshipment yards - The paper of Li et al. (2019)
Product sequencing in multiple-piece-flow assembly lines - The paper of Otto and Li (2020)
Two-way bounded dynamic programming approach for operations planning in transshipment yards
Introduction
The static crane scheduling problem
Two-way bounded dynamic programming framework
Outline of the two-way bounded dynamic programming framework
Illustrating TBDP for the static crane scheduling problem
Summary of the TBDP framework
Bounds and an exact algorithm for the single crane scheduling problem
Lower bounds for single crane scheduling problem
Upper bound for the single crane scheduling problem
Branch and bound algorithm for the single crane scheduling problem
Algorithms for the static crane scheduling problem
The TBDP heuristic for the SCSP
TBDP-based exact method for the SCSP (TEMP)
Computational Experiments
Experiment 1: Performance of the TBDP heuristic and of TEMP
Experiment 2: Additional value of TBDP
Conclusion
Appendix A. LB1
Appendix B. Terminal Settings and the Number of Spatially Disjoint Sets of Jobs
Solving the single crane scheduling problem at rail transshipment yards
Introduction
Problem formulations for the single-crane scheduling problem
Some observations on the single-crane scheduling problem
On the single-crane scheduling problem with the objective to minimize total cost
Dynamic branch-and-cut algorithm for the SgCSP
Branch-and-cut solution procedure
Extension of path elimination constraints
Decomposition Algorithm
Computational experiments
Data sets
Simulation results
Detailed performance analysis of the algorithms
Conclusion
Appendix A
Product sequencing in multiple-piece-flow assembly lines
Introduction
Examples of multiple-piece-flow assembly lines
Problem definition
Literature Overview
Contribution
The m-vector bin packing and sequencing problem
Integer programming formulation
Properties of the m-BiPacS
Iterative variable neighborhood heuristic
Initial heuristic
Local search procedures
Diversification step
Summary of the IVNH procedure
Computational Experiments
Data generation
Computational experiments on the randomly generated data sets
Simulation study: The IVNH as part of rolling-horizon planning
Conclusion
Appendix A
Appendix B
Summary and Outlook
Bibliography