A mixed integer programming approach for the single machine problem with unequal release dates

Kooli, Anis; Serairi, Mehdi

doi:10.1016/j.cor.2014.06.013

Cited by 13 publications

(4 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [29], the polyhedra of the position-oriented formulation was studied and valid inequalities was introduced. In recent years, the authors of [28] introduced additional valid inequalities for the position-oriented formulation based on the shortest processing time list-scheduling rule. In the same year, [10] used the position-oriented formulation with some valid inequalities to explore neighbourhoods in a matheuristic.…”

Section: Position-oriented Formulationmentioning

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: Position-oriented Formulationmentioning

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

“…The proposed model is based on the sequence position formulation [73,74], it consists in assigning each job to a position. A bigM constraint is included, proposed by Kooli and Serairi, for making the model in a linear form [75]. The model parameters are given below: N: The set of jobs {1, 2, ..., n}.…”

Section: Mathematical Model Before the Disruptionmentioning

confidence: 99%

Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight

2021

View full text Add to dashboard Cite

Thanks to smart technological tools, customers can at any moment create or modify their commands. This reality forced many production firms to become sensitive in rescheduling processes. In the literature, most of rescheduling problems consider classical efficiency measures. However, some existing works also consider stability as a measure for limiting the deviation from initial schedule. In this work, we aim to bridge the gap in existing works on rescheduling by investigating a new approach to measure simultaneously efficiency by the total weighted waiting times and stability by the total weighted completion time deviation. This combination of criteria is very significant in industrial and hospital environments. In this paper, a single machine rescheduling problem with jobs arriving over time is considered. A mixed integer linear programming (MILP) model is designed for this problem and an iterative predictive-reactive strategy for dealing with the online part. Numerical results show that, at each time the jobs are rescheduled, the low weight ones move forward. Consequently, a new concept consisting in increasing the jobs weight as function of time is established. The effect of this new conception is evaluated by the evolution of the maximum flowtime. Eventually, the computing time of the MILP resolution is studied to explore its limitations.

show abstract

“…In this section, we describe a standard MILP formulation for the

0true F 2 | r_{j}, p r m u | \sum C_{j}

that has been used for similar scheduling problems (see, for instance, Kooli and Serairi, ). In this formulation,

C_{k}^{1}

and

C_{k}^{2}

denote the completion time of the job in position k on machine M 1 and M 2 , respectively.…”

Section: Recalling Some Standard Techniquesmentioning

confidence: 99%

Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates

Mrad

Chalghoumi²,

Ladhari

et al. 2017

Int Trans Operational Res

View full text Add to dashboard Cite

We consider the problem of minimizing the sum of completion times in a two‐machine permutation flowshop subject to release dates. New procedures are proposed for effectively bounding the completion time of a given job that is processed at a given position. New assignment‐based lower bounds are derived as well as an enhanced mathematical programming formulation. Our computational analysis shows a consistent tightness of the proposed lower bounds and a high outperformance of the enhanced mathematical formulation with respect to the classical one.

show abstract

A mixed integer programming approach for the single machine problem with unequal release dates

Cited by 13 publications

References 29 publications

Optimisation methods for solving a large-scale avionics scheduling problem

Optimisation methods for solving a large-scale avionics scheduling problem

Minimizing the Total Weighted Waiting Times and Instability in a Rescheduling Problem with Dynamic Jobs Weight

Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates

Contact Info

Product

Resources

About