Leus, Roel
Overview
| Works: | 90 works in 99 publications in 1 language and 117 library holdings |
|---|---|
| Roles: | Author, Other, Contributor, Opponent |
Publication Timeline
.
Most widely held works by
Roel Leus
A hybrid scatter search/ electromagnetism meta-heuristic for project scheduling by Dieter Debels(
Book
)
4 editions published between 2003 and 2004 in English and held by 4 WorldCat member libraries worldwide
4 editions published between 2003 and 2004 in English and held by 4 WorldCat member libraries worldwide
A branch-and-bound algorithm for stable scheduling in single-machine production systems by
Roel Leus(
Book
)
2 editions published in 2004 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 2004 in English and held by 3 WorldCat member libraries worldwide
Robust optimization for resource-constrained project scheduling with uncertain activity durations by
Christian Artigues(
)
2 editions published between 2010 and 2012 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 2010 and 2012 in English and held by 3 WorldCat member libraries worldwide
An exact algorithm for parallel machine scheduling with conflicts by
Daniel Kowalczyk(
)
2 editions published between 2015 and 2016 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 2015 and 2016 in English and held by 3 WorldCat member libraries worldwide
Scheduling hybrid flow shops with time windows by Fan Yang(
)
2 editions published between 2018 and 2019 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 2018 and 2019 in English and held by 3 WorldCat member libraries worldwide
Exact algorithms for single-machine scheduling with time windows and precedence constraints by Morteza Davari(
)
2 editions published between 2013 and 2015 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 2013 and 2015 in English and held by 3 WorldCat member libraries worldwide
Experimental investigation of the applicability of ant colony optimization algorithms for project scheduling by
Jade Herbots(
Book
)
2 editions published in 2004 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 2004 in English and held by 3 WorldCat member libraries worldwide
Stability and resource allocation in project planning by
Roel Leus(
Book
)
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
On the construction of stable project baseline schedules by
Willy Herroelen(
Book
)
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
New strategies for stochastic resource-constrained project scheduling by Salim Rostami(
)
1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide
Robust and stable optimization for parallel machine scheduling problems by
Widad Naji(
)
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
Scheduling on unrelated parallel machines is a common problem in many systems (as semi-conductors manufacturing,multiprocessor computer applications, textile industry, etc.). In this thesis, we consider two variantsof this problem under uncertain processing time. In the first case, each job can be split into continuoussub-jobs and processed independently on the machines with allowed overlappinf. In the second case whichis termed preemption, we prohibit the overlapping. From a mathematical viewpoint, the splitting problem isa relaxed version of the preemptive problem. The objective is to minimize the makespan.The deterministic linear formulations provided by the literature allow to solve these problems in polynomialtimes under the hypothesis of certainty. But, when we consider uncertain processing times, thesealgorithms suffer from some limitations. Indeed, the solutions compouted based on a nominal instance,supposed to be certain, turn usually to be suboptimal when applied to the actual realization of processingtimes.We incorporate the uncertain processing times in these problems without making any assumption ontheir distribution. Hence, we use discrete scenarios to represent the uncetain processing times and we adopta proactive approach to provide robust solutions. We use special case policies that are commongly used inthe industry to compute robust solutions. We show that the solutions based on some of those policies arepotentially good in terms of robustness according to the worst-case makespan, especially the scenario smaxsolution under which all the processing times are set to their maximal values. However, the robustness costsof these solutions are not satisfying. Thus, we propose to compute optimal robust solutions. For this purpose,we use a mathematical trick that allows us to formulate and solve, in polynomila times, the robust versionsof the considered scheduling problems. Moreover, the computational results affirm that the robustness costof the optimal solution is not usually very high.Moreover, we evaluate the stability of the robust solutions under a new scenario induced by variations.In fact, the decision-maker is only responsible for the consequences of the decisions when the processingtime realizations are within the represented uncertainty set. Thus, we define stability of a robust solution asits ability to cover a new scenario with minor deviations regarding its structure and its performance.The global motivation of this thesis is then to provide a decision support to help decision maker computerobust solutions and choose among these robust solutions those with the most stable structure and the moststable performance
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
Scheduling on unrelated parallel machines is a common problem in many systems (as semi-conductors manufacturing,multiprocessor computer applications, textile industry, etc.). In this thesis, we consider two variantsof this problem under uncertain processing time. In the first case, each job can be split into continuoussub-jobs and processed independently on the machines with allowed overlappinf. In the second case whichis termed preemption, we prohibit the overlapping. From a mathematical viewpoint, the splitting problem isa relaxed version of the preemptive problem. The objective is to minimize the makespan.The deterministic linear formulations provided by the literature allow to solve these problems in polynomialtimes under the hypothesis of certainty. But, when we consider uncertain processing times, thesealgorithms suffer from some limitations. Indeed, the solutions compouted based on a nominal instance,supposed to be certain, turn usually to be suboptimal when applied to the actual realization of processingtimes.We incorporate the uncertain processing times in these problems without making any assumption ontheir distribution. Hence, we use discrete scenarios to represent the uncetain processing times and we adopta proactive approach to provide robust solutions. We use special case policies that are commongly used inthe industry to compute robust solutions. We show that the solutions based on some of those policies arepotentially good in terms of robustness according to the worst-case makespan, especially the scenario smaxsolution under which all the processing times are set to their maximal values. However, the robustness costsof these solutions are not satisfying. Thus, we propose to compute optimal robust solutions. For this purpose,we use a mathematical trick that allows us to formulate and solve, in polynomila times, the robust versionsof the considered scheduling problems. Moreover, the computational results affirm that the robustness costof the optimal solution is not usually very high.Moreover, we evaluate the stability of the robust solutions under a new scenario induced by variations.In fact, the decision-maker is only responsible for the consequences of the decisions when the processingtime realizations are within the represented uncertainty set. Thus, we define stability of a robust solution asits ability to cover a new scenario with minor deviations regarding its structure and its performance.The global motivation of this thesis is then to provide a decision support to help decision maker computerobust solutions and choose among these robust solutions those with the most stable structure and the moststable performance
Models for robust resource allocation in project scheduling by
Roel Leus(
Book
)
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
Optimization of the annual planning of targeted offers in direct marketing by S Delanote(
)
1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide
The complexity of generating robust resource-constrainted baseline schedules by
Roel Leus(
Book
)
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
Project scheduling under uncertainty survey and research potentials by
Willy Herroelen(
Book
)
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 2 WorldCat member libraries worldwide
Identification and illumination of popular misconceptions about project scheduling and time buffering in a resource-constrained
environment by
Willy Herroelen(
)
1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2005 in English and held by 2 WorldCat member libraries worldwide
On the merits and pitfalls of critical chain scheduling by
Willy Herroelen(
Book
)
1 edition published in 2000 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 2 WorldCat member libraries worldwide
Special issue: Twelfth Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2015) by
Yves Crama(
)
1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2017 in English and held by 2 WorldCat member libraries worldwide
Solution and quality robust project scheduling : a methodological framework by
Willy Herroelen(
Book
)
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide
Dynamic order acceptance and capacity planning within a multi-project environment(
)
1 edition published in 2006 in English and held by 1 WorldCat member library worldwide
1 edition published in 2006 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
| 0 |
 |
1 | ||
| General | Special | |||
Related Identities
- Herroelen, Willy Other Author
- Talla Nobibon, Fabrice Author Contributor
- SpringerLink (Online service) Other
- Herroelen, Willy Author
- Herbots, Jade Author
- Creemers, Stefan Other Author
- De Reyck, Bert Other
- Demeulemeester, Erik Contributor
- Coolen, Kris Other Author
- Kowalczyk, Daniel Other Author