A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Horn, Matthias; Raidl, Guenther R.; Rönnberg, Elina

doi:10.1007/s10479-020-03550-7

Cited by 8 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The single machine scheduling problem with sequence-dependent setup times and multiple time-windows was introduced in [19] and is relevant for the avionics scheduling problem design case. The problem can be seen as an extension of the single machine scheduling problem with release times and deadlines introduced in Section 3.1.…”

Section: A Single Machine Scheduling Problem With Sequence-dependent Setup Times and Multiple Time-windowsmentioning

confidence: 99%

Optimisation methods for solving a large-scale avionics scheduling problem

Karlsson¹

2021

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

Modern computer systems in aircraft are based on an integrated modular avionic architecture. In this architecture, software applications share hardware resources on a common avionic platform. Many functions in an aircraft are controlled by software and a failure in such software can have severe consequences. To avoid malfunction, there are many aspects to consider. One aspect is to ensure that the activities in the system get sufficient computing and network communication resources while being completed in time. This thesis contributes to addressing this challenge by studying an avionics scheduling problem proposed by Saab.First I would like to give thanks to my main supervisor Elina Rönnberg. You have shaped my PhD journey more than anyone else and have by example showed me what it means to be a researcher. Throughout this period, you have not only cared for me as a PhD student but also as a person and as a colleague. I am the first PhD student under your main supervision and that is something I always will be proud of. I want to thank my supervisors Kaj Holmberg and Simin Nadjm-Tehrani. Kaj, I will in particular remember your passion for teaching and what I have learned from your PhD courses. Simin, you allowed me to glimpse into the world of real-time systems and your everyday research environment while taking time when I have had questions. I want to thank my colleagues at the Department of Mathematics for good discussions, help with administration, and providing a good place to work. A particular shout-out to Björn Morén for our "fikas". I want to thank Martin Singull for sparking my interest in research as an undergraduate student.The contributions of this thesis would have not been possible without Saab and during the last years, my work has been part of a research collaboration between Saab and Linköping University titled "Efficient use of hardware resources in avionic systems". Thanks to all people who have been involved in making this possible. Particular thanks to Andreas Stenberg and Hannes Uppman, who I have worked closely together with and learned a lot from and together with. I want to thank Robert Pettersson and Mats Ekman for technical discussions and giving me feedback on various things through the years. I also want to thank current and past managers, in particular Fredrik Lorentzon, Karolina Bergström, and Tobias Olsson.I want to thank the Research school in Interdisciplinary Mathematics for funding my research and granting me the possibility to learn about optimisation and real-time system through my PhD studies. I want to thank the Swedish National Infrastructure for Computing (SNIC) at National Supercomputer Centre (NSC) for providing computational resources.My life has been blessed by people that I love. Each and every one of you have my thanks. But a special thanks to Tahere for caring and always being kind, and to Ghazaleh, the love of my life, I love you always.

show abstract

Section: A Single Machine Scheduling Problem With Sequence-dependent Setup Times and Multiple Time-windowsmentioning

confidence: 99%

Optimisation methods for solving a large-scale avionics scheduling problem

Karlsson¹

2021

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

show abstract

“…More recently, Horn et al presented another variation of their sequencing problem. Instead of optimizing the makespan, they aimed to find a feasible solution, while maximizing the sum of the prices associated with jobs, earned when being scheduled within their respective time window [HRR19]. In addition to a variation of their A * algorithm, they presented MILP and constraint programming models for comparison reasons.…”

Section: Related Workmentioning

confidence: 99%

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem

Kaufmann

Horn

Raidl

2020

Parallel Problem Solving From Nature – PPSN XVI

Self Cite

View full text Add to dashboard Cite

Die approbierte gedruckte Originalversion dieser Diplomarbeit ist an der TU Wien Bibliothek verfügbar.The approved original version of this thesis is available in print at TU Wien Bibliothek. Die approbierte gedruckte Originalversion dieser Diplomarbeit ist an der TU Wien Bibliothek verfügbar.The approved original version of this thesis is available in print at TU Wien Bibliothek.Die approbierte gedruckte Originalversion dieser Diplomarbeit ist an der TU Wien Bibliothek verfügbar.The approved original version of this thesis is available in print at TU Wien Bibliothek. Die approbierte gedruckte Originalversion dieser Diplomarbeit ist an der TU Wien Bibliothek verfügbar.The approved original version of this thesis is available in print at TU Wien Bibliothek.

show abstract

“…We use the same two types of test instances as in Horn et al (2018) but extend these to also include particularly larger instances with up to 300 jobs; all instances are available at http:// www.ac.tuwien.ac.at/research/problem-instances. Each set contains in total 840 instances with 30 instances for each combination of n ∈ {10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 120, 150, 200, 300} jobs and m ∈ {2, 3} secondary resources.…”

Section: Computational Studymentioning

confidence: 99%

“…In a concurrently submitted work, Horn et al (2018) focus on solving the PC-JSOCMSR exactly by means of A* search, mixed integer programming, and constraint programming. While excellent results are obtained in particular for the A* search, the applicability of these methods is strongly limited to rather small or medium sized-problem instances.…”

Section: Introductionmentioning

confidence: 99%

Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources

Maschler

Raidl

2019

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

Multivalued decision diagrams (MDD) are a powerful tool for approaching combinatorial optimization problems. Relatively compact relaxed and restricted MDDs are applied to obtain dual bounds and heuristic solutions and provide opportunities for new branching schemes. We consider a prize-collecting sequencing problem in which a subset of given jobs has to be found that is schedulable and yields maximum total prize. The primary aim of this work is to study different methods for creating relaxed MDDs for this problem. To this end, we adopt and extend the two main MDD compilation approaches found in the literature: top down construction and incremental refinement. In a series of computational experiments these methods are compared. The results indicate that for our problem the incremental refinement method produces MDDs with stronger bounds. Moreover, heuristic solutions are derived by compiling restricted MDDs and by applying a general variable neighborhood search (GVNS). Here we observe that the top down construction of restricted MDDs is able to yield better solutions as the GVNS on small to medium-sized instances.

show abstract

A* Search for Prize-Collecting Job Sequencing with One Common and Multiple Secondary Resources

Cited by 8 publications

References 14 publications

Optimisation methods for solving a large-scale avionics scheduling problem

Optimisation methods for solving a large-scale avionics scheduling problem

A Variable Neighborhood Search for the Job Sequencing with One Common and Multiple Secondary Resources Problem

Multivalued decision diagrams for prize-collecting job sequencing with one common and multiple secondary resources

Contact Info

Product

Resources

About