Three Essays on Operations Scheduling with Job Classes and Time Windows
()
About this ebook
[1] A Dynamic Programming Approach for the Aircraft Landing Problem with Aircraft Classes (also published in: European Journal of Operational Research)
[2] Scheduling Aircraft Take-Offs and Landings on Heterogeneous and Interdependent Runways (also published in: Transportation Research Part E: Logistics and Transportation Review)
[3] Task Scheduling in Long-Term Care Facilities: A Client-Centered approach (also published in: Operations Research for Health Care)
Related to Three Essays on Operations Scheduling with Job Classes and Time Windows
Related ebooks
Computational Fluid Dynamics: A Practical Approach Rating: 4 out of 5 stars4/5Engineering Simulation and its Applications: Algorithms and Numerical Methods Rating: 0 out of 5 stars0 ratingsUnderstanding Distillation Using Column Profile Maps Rating: 0 out of 5 stars0 ratingsDynamic Modelling of Information Systems Rating: 0 out of 5 stars0 ratingsPrinciples of Engineering Design Rating: 0 out of 5 stars0 ratingsOptimization for Decision Making: Linear and Quadratic Models Rating: 0 out of 5 stars0 ratingsRisk Management in Architectural Design: Control of Uncertainty over Building Use and Maintenance Rating: 0 out of 5 stars0 ratingsSpatial Econometrics using Microdata Rating: 0 out of 5 stars0 ratingsPractical Goal Programming Rating: 0 out of 5 stars0 ratingsEconomic Multi Agent Systems: Design, Implementation, and Application Rating: 4 out of 5 stars4/5Essential Computational Fluid Dynamics Rating: 0 out of 5 stars0 ratingsComputational Fluid Dynamics Applied to Waste-to-Energy Processes: A Hands-On Approach Rating: 4 out of 5 stars4/5Improving the User Experience through Practical Data Analytics: Gain Meaningful Insight and Increase Your Bottom Line Rating: 0 out of 5 stars0 ratingsEnergy-Efficient HVAC Design: An Essential Guide for Sustainable Building Rating: 0 out of 5 stars0 ratingsA Rigorous Semantics for BPMN 2.0 Process Diagrams Rating: 0 out of 5 stars0 ratingsLinear Programming: Foundations and Extensions Rating: 0 out of 5 stars0 ratingsApplications of Combinatorial Optimization Rating: 0 out of 5 stars0 ratingsNatural Ventilation of Buildings: Theory, Measurement and Design Rating: 0 out of 5 stars0 ratingsAn Introduction to Computational Fluid Mechanics by Example Rating: 5 out of 5 stars5/5Productivity and Efficiency Measurement of Airlines: Data Envelopment Analysis using R Rating: 0 out of 5 stars0 ratingsThe Art of Controller Design Rating: 0 out of 5 stars0 ratingsDistributed Computer Systems: Theory and Practice Rating: 4 out of 5 stars4/5Contract Theory in Continuous-Time Models Rating: 0 out of 5 stars0 ratingsPractical Financial Optimization: A Library of GAMS Models Rating: 3 out of 5 stars3/5Bayesian Estimation of DSGE Models Rating: 5 out of 5 stars5/5How to Manage Project Opportunity and Risk: Why Uncertainty Management can be a Much Better Approach than Risk Management Rating: 0 out of 5 stars0 ratingsEngineering a Compiler Rating: 0 out of 5 stars0 ratingsPerformance Evaluation and Attribution of Security Portfolios Rating: 5 out of 5 stars5/5Software Architecture for Big Data and the Cloud Rating: 0 out of 5 stars0 ratingsProbability and Random Processes: With Applications to Signal Processing and Communications Rating: 4 out of 5 stars4/5
Business For You
Crucial Conversations Tools for Talking When Stakes Are High, Second Edition Rating: 4 out of 5 stars4/5Summary of J.L. Collins's The Simple Path to Wealth Rating: 5 out of 5 stars5/5Becoming Bulletproof: Protect Yourself, Read People, Influence Situations, and Live Fearlessly Rating: 4 out of 5 stars4/5Law of Connection: Lesson 10 from The 21 Irrefutable Laws of Leadership Rating: 4 out of 5 stars4/5The Richest Man in Babylon: The most inspiring book on wealth ever written Rating: 5 out of 5 stars5/5Collaborating with the Enemy: How to Work with People You Don’t Agree with or Like or Trust Rating: 4 out of 5 stars4/5Crucial Conversations: Tools for Talking When Stakes are High, Third Edition Rating: 4 out of 5 stars4/5Just Listen: Discover the Secret to Getting Through to Absolutely Anyone Rating: 4 out of 5 stars4/5Nickel and Dimed: On (Not) Getting By in America Rating: 4 out of 5 stars4/5Leadership and Self-Deception: Getting out of the Box Rating: 4 out of 5 stars4/5Set for Life: An All-Out Approach to Early Financial Freedom Rating: 4 out of 5 stars4/5Robert's Rules Of Order Rating: 5 out of 5 stars5/5The Everything Guide To Being A Paralegal: Winning Secrets to a Successful Career! Rating: 5 out of 5 stars5/5How to Get Ideas Rating: 5 out of 5 stars5/5Confessions of an Economic Hit Man, 3rd Edition Rating: 5 out of 5 stars5/5Lying Rating: 4 out of 5 stars4/5Capitalism and Freedom Rating: 4 out of 5 stars4/5Your Next Five Moves: Master the Art of Business Strategy Rating: 5 out of 5 stars5/5Company Rules: Or Everything I Know About Business I Learned from the CIA Rating: 4 out of 5 stars4/5The Five Dysfunctions of a Team: A Leadership Fable, 20th Anniversary Edition Rating: 4 out of 5 stars4/5Red Notice: A True Story of High Finance, Murder, and One Man's Fight for Justice Rating: 4 out of 5 stars4/5Good to Great: Why Some Companies Make the Leap...And Others Don't Rating: 4 out of 5 stars4/5The Intelligent Investor, Rev. Ed: The Definitive Book on Value Investing Rating: 4 out of 5 stars4/5Robert's Rules of Order: The Original Manual for Assembly Rules, Business Etiquette, and Conduct Rating: 4 out of 5 stars4/5Tools Of Titans: The Tactics, Routines, and Habits of Billionaires, Icons, and World-Class Performers Rating: 4 out of 5 stars4/5The Book of Beautiful Questions: The Powerful Questions That Will Help You Decide, Create, Connect, and Lead Rating: 4 out of 5 stars4/5Suddenly Frugal: How to Live Happier and Healthier for Less Rating: 3 out of 5 stars3/5
Reviews for Three Essays on Operations Scheduling with Job Classes and Time Windows
0 ratings0 reviews
Book preview
Three Essays on Operations Scheduling with Job Classes and Time Windows - Alexander Lieder
UNIVERSITÄT MANNHEIM
BETRIEBSWIRTSCHAFTSLEHRE
Inauguraldissertation
zur Erlangung des akademischen Grades
eines Doktors der Wirtschaftswissenschaften
der Universität Mannheim
vorgelegt von
Contents
Summary
List of Figures
List of Tables
List of Acronyms
1 Introduction
2 A dynamic programming approach for the aircraft landing problem with aircraft classes
2.1 Introduction
2.2 Problem definition
2.2.1 Problem description
2.2.2 MIP model
2.3 Dynamic programming approach
2.3.1 States and transitions
2.3.2 State-space reduction using a dominance criterion
2.4 Numerical study
2.4.1 Performance analysis
2.4.2 Sensitivity analysis
2.4.3 Impact of state space reduction
2.5 Implementation via a rolling horizon approach
2.6 Conclusions and further research
3 Scheduling aircraft take-offs and landings on heterogeneous and interdependent runways
3.1 Introduction
3.2 Related literature
3.2.1 Overview of models
3.2.2 Solution approaches
3.3 Model description
3.4 Dynamic programming approach
3.4.1 State definition
3.4.2 State transition
3.4.3 Dominance rule
3.5 Rolling planning horizon heuristic
3.6 Numerical study
3.6.1 Generation of problem instances
3.6.2 Performance analysis of the exact DP approach
3.6.3 General runway configurations
3.6.4 Rolling planning horizon heuristic
3.7 Consideration of costs for taxiing
3.8 Conclusion and outlook
4 Task scheduling in long-term care facilities: A client-centered approach
4.1 Introduction
4.2 Related literature
4.2.1 Research in nursing homes
4.2.2 Research on task scheduling problems
4.3 Problem description and model formulation
4.4 Dynamic programming approach
4.4.1 States and transitions
4.4.2 State space reduction
4.4.3 Heuristic solution approaches
4.5 Numerical study
4.5.1 Study design
4.5.2 Comparison of solution approaches
4.5.3 Impact of skill substitution
4.5.4 Economies of scale
4.6 Conclusions and further research
5 Conclusions and outlook
5.1 Conclusions
5.2 Further research directions
Bibliography
Appendix 1: Detailed numerical results from Chapter 3
Appendix 2: Source code of the DP approach for the generalized ASP
Curriculum Vitae
Acknowledgements
This dissertation is the result of more than four years that I spent as a research assistant and doctoral candidate at the Chair of Production Management at the University of Mannheim. During this time, I could rely on a number of coauthors, who delivered invaluable input the research articles enclosed in this dissertation. Of course, I would like to start with my supervisor Professor Raik Stolletz, whom I would like to thank for his guidance and support. His combined qualities of being quite demanding and sometimes difficult to convince on the one hand but understanding and supportive on the other were certainly a decisive success factor of this entire project. Of course, I also want to thank my other co-authors: Professor Dirk Briskorn who, together with Raik Stolletz, laid the theoretic foundations of my essential optimization approach and therefore made all of my findings possible in the first place and who was always available for discussing new ideas and helping to resolve problems, and Dennis Moeke and Professor Ger Koole from the VU University in Amsterdam, who were very pleasant and diligent work partners as well as excellent hosts during my brief research visits to their beautiful city.
It is my pleasure to extend my greetings and thanks to my dear colleagues, who mostly came to Mannheim from other parts of the country like I did and who became not only valuable work partners but also close friends that I had lots of good times with and that I could always count on (in no particular order): Hendrik Guhlich, Justus Arne Schwarz, Gregor Selinka, Andrej Saweljew, Emilio Zamorano, Axel Franz, Sophie Weiss, Annika Becker, Semën Nikolajewsi, and Jannik Vogel. I wish them all the best for their own dissertation and/or habilitation projects and their future careers, and I hope we stay in touch. I would also like to thankfully mention the other chairs of the Area Operations Management whose chair holders and research assistants were always pleasant colleagues who gave helpful input to my research on numerous occasions, and Christian Weitert and Oliver Schmitzer who introduced me to living and working in Mannheim and who made my first months here quite enjoyable.
At least as important for the success of this project as an outstanding working environment was that I could always count on the unconditional love and support from my family and friends: From my beloved significant other Lavinia, my parents Frank and Eva, my brother Stefan and his family, and from my friends back home in North Rhine-Westphalia who actually took the time to travel to Mannheim for the occasional visits which were always a great pleasure. Thank you.
Finally, I would like to thank the Erich Becker Foundation, a foundation of the FraPort AG, in Frankfurt am Main. From 2013 to 2015, their stipend for aviation-related research projects granted me substantial financial support that made it possible for me to visit fellow researchers and scientific conferences across Europe in order to present and discuss my research. For more information on the Erich Becker Foundation I gladly refer to their web site, www.erich-becker-stiftung.de.
Mannheim, September 2015,
Alexander Lieder
Summary
Operations scheduling is the assignment of individual tasks to resources and the definition of start times for all tasks. It encompasses the problems of task assignment and sequencing. Goals of operations scheduling are the adherence to service targets and an efficient usage of constrained resources. Therefore, well-planned schedules can significantly contribute to a company’s success. This dissertation presents optimization approaches for three single-stage scheduling problems with multiple resources, job classes, and time windows from two different areas of application.
The first essay discusses the aircraft landing problem (ALP) that emerges at highly utilized airports. A set of aircraft is approaching the airport and to each aircraft a runway and a landing time have to be assigned. The goal is to minimize the weighted sum of delays from the aircraft’s target landing times while maintaining the necessary separation between all pairs of landings. We provide an efficient dynamic programming-based optimization approach for this problem while most other authors restrict themselves to heuristic solution approaches. The second essay generalizes this solution approach in order to solve the ALP under more realistic constraints. It takes aircraft take-offs as well as runway systems with heterogeneous and interdependent runways into account. The third essay provides an exact solution approach for a task scheduling problem in a long-term care facility that, from a mathematical point of view, has similarities with the ALP. A set of care tasks must be assigned to a set of care workers while meeting the respective clients’ preferred task start times as closely as possible. Different from the ALP, tasks can be scheduled earlier than their target time and require the care worker to have at least a certain qualification level.
In the absence of other optimization approaches for the considered scheduling problems in the literature, in our numerical studies we compare the performance of our approaches to a standard solver and to basic dispatching rules. For problem instances that cannot be solved efficiently with the proposed optimization approaches, we provide heuristic solution approaches based on state space truncation and on a rolling planning horizon.
List of Figures
2.1 Distribution of target landing times and aircraft classes
3.1 Example of a basic problem instance with solutions
3.2 Schematic representation of Frankfurt Airport (Germany)
4.1 Examples of sub-optimal task assignments
4.2 Convex, piecewise linear penalty function
5.1 UML class diagram of the DP’s data structure
List of Tables
2.1 Separation requirements (in seconds)
2.2 Overview of related articles
2.3 Sets, parameters, and variables of the MIP model
2.4 Standard problem instances from Bianco et al. (1999)
2.5 Comparison of computation times for 10 problem instances and 4 cost functions
2.6 Computation times for the different problem sizes (in seconds)
2.7 Computation times for the different interarrival times (in seconds)
2.8 Impact of the state-space reduction on computation time and state space
3.1 Separation requirements (in seconds)
3.2 Overview of related Literature with heterogeneous or interdependent runways
3.3 Overview of related Literature with single or independent runways (2010–2015)
3.4 Sets, parameters, and variables of the MIP formulation
3.5 Example application of the dominance rule
3.6 Distribution of operation classes (w(a))
3.7 Basic problem cases: Impact of runway load
3.8 Basic problem cases: Impact of planning horizon
3.9 LHR’s runway setting (RL = 90 operations/hour)
3.10 FRA’s runway setting (RL = 120 operations/hour)
3.11 Rolling planning horizon heuristic for FRA’s runway setting
3.12 Impact of taxi costs
4.1 Overview of care worker qualification levels
4.2 Sets, parameters, and variables of the MIP
4.3 Properties of the problem instances
4.4 Comparison of solution approaches
4.5 Impact of skill substitution
4.6 Economies of scale
5.1 Basic setting (2 interdep. runways; diag. sep. 40 sec.)
5.2 Basic setting (2 independent runways)
5.3 Basic setting (2 interdep. runways; diag. sep. 40 sec.)
5.4 Basic problem setting with taxi costs
List of Acronyms