4.3 Article

New strategies for stochastic resource-constrained project scheduling

Journal

JOURNAL OF SCHEDULING
Volume 21, Issue 3, Pages 349-365

Publisher

SPRINGER
DOI: 10.1007/s10951-016-0505-x

Keywords

Project scheduling; Uncertainty; Stochastic activity durations; Scheduling policies

Ask authors/readers for more resources

We study the stochastic resource-constrained project scheduling problem or SRCPSP, where project activities have stochastic durations. A solution is a scheduling policy, and we propose a new class of policies that is a generalization of most of the classes described in the literature. A policy in this new class makes a number of a priori decisions in a preprocessing phase, while the remaining scheduling decisions are made online. A two-phase local search algorithm is proposed to optimize within the class. Our computational results show that the algorithm has been efficiently tuned toward finding high-quality solutions and that it outperforms all existing algorithms for large instances. The results also indicate that the optimality gap even within the larger class of elementary policies is very small.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Management

Time-critical testing and search problems

Alessandro Agnetis, Ben Hermans, Roel Leus, Salim Rostami

Summary: This paper discusses a problem of determining the state of a system through costly tests before a deadline, as well as a related search problem with multiple searchers aiming to find a target before a deadline. Both problems are shown to be NP-hard and various algorithms are proposed to tackle them effectively. Extensive computational experiments suggest that different formulations perform better in different scenarios, and a local search procedure is shown to be effective in finding near-optimal solutions.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Remote Sensing

Rolling weight-matching methods for the inter-satellite link assignment in global navigation satellite systems

Jungang Yan, Guopeng Song, Roel Leus, Zhenwei Hou, Zhongshan Zhang

Summary: Inter-satellite links (ISLs) optimization is crucial for developing global navigation satellite systems. A mathematical optimization model is proposed, and a rolling weight-matching method and a weight enhancement strategy are used to solve the ISL assignment problem. Simulation experiments demonstrate the effectiveness of the proposed methods.

GPS SOLUTIONS (2022)

Article Management

Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families

Fan Yang, Morteza Davari, Wenchao Wei, Ben Hermans, Roel Leus

Summary: This article studies the scheduling problem of jobs with non-identical sizes and incompatible families on a single parallel-batching machine. By developing new linear programming formulations and heuristic algorithms, the objective of minimizing the total weighted completion time can be achieved.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Management

Recovery from demand disruption: Two-stage financing strategy for a capital-constrained supply chain under uncertainty

Yujie Zhao, Hong Zhou, Roel Leus

Summary: This paper investigates recovery strategies for supply chain enterprises under uncertain demand. It proposes financing strategies and recovery strategies for retailers to mitigate the negative impact of disruptions. The analysis considers the potential impact on regret, bankruptcy risk, and profit for different financing and recovery strategies.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2022)

Article Engineering, Manufacturing

Aircraft landing planning under uncertain conditions

Marie-Sklaerder Vie, Nicolas Zufferey, Roel Leus

Summary: Aircraft Landing Planning is a challenging task that requires considering the limited capacity of airport runways. This study proposes a mathematical formulation and simulation framework to address the problem while accounting for uncertainties. The research suggests that the use of different solution methods can lead to more effective and stable solutions, reducing delays and fuel costs while maintaining landing sequence stability.

JOURNAL OF SCHEDULING (2022)

Article Computer Science, Interdisciplinary Applications

Exact algorithms for budgeted prize-collecting covering subgraph problems

N. Morandi, R. Leus, H. Yaman

Summary: We introduce a class of budgeted prize-collecting covering subgraph problems and develop a branch-and-cut framework and a Benders decomposition for their exact solution. We observe that the former algorithm generally has shorter computational times, but the latter can outperform the former in specific instances. Additionally, we validate our algorithmic frameworks for the cases where the subgraph is a cycle and a tree, and identify novel symmetry-breaking inequalities.

COMPUTERS & OPERATIONS RESEARCH (2022)

Article Management

A pessimist?s approach to one-sided matching

Tom Demeulemeester, Dries Goossens, Ben Hermans, Roel Leus

Summary: This research investigates the one-sided matching problem where agents have preferences over objects but objects do not have preferences over agents. By decomposing probabilistic assignments, the researchers find the theoretically best worst-case number of assigned agents and propose two alternative column generation frameworks to achieve this decomposition.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2023)

Article Management

Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models

Ben Hermans, Roel Leus, Bart Van Looy

Summary: We develop project planning models that integrate scheduling and appropriation decisions for new product development projects. By considering the timing of development tasks and whether to use secrecy and patenting, we find that innovators can benefit from both methods during different project phases, contrary to the traditional view. Additionally, we discover that choosing secrecy may prolong the project's lead time, and it may be optimal to initiate tasks that expose the project earlier.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE (2023)

Article Operations Research & Management Science

The Traveling Salesman Problem with Drones: The Benefits of Retraversing the Arcs

Nicola Morandi, Roel Leus, Jannik Matuschke, Hande Yaman

Summary: In the TSP-mD problem, a truck and multiple drones work together to provide customer service in the minimum amount of time. The optimal solutions for TSP-mD may involve revisiting nodes and retraversing arcs. The necessity of arc retraversals has not been previously investigated, but excluding them may increase the optimal value under certain conditions. Furthermore, there is no polynomial-time heuristic that can approximate the metric TSP-mD within a constant factor unless P ≠ NP.

TRANSPORTATION SCIENCE (2023)

Proceedings Paper Automation & Control Systems

Single Station MILP Scheduling Models Using Continuous and Discrete Approach

Maria-Luisa Munoz-Diaz, Alejandro Escudero-Santana, Roel Leus, Antonio Lorenzo-Espejo

Summary: This paper introduces two mixed linear programming models (MILP) for single-station production scheduling, which utilize continuous and discrete forms of time representation. Both models address the sequencing and assignment of tasks for non-identical parallel machines. The models are solved using Gurobi Optimizer and the results are presented in a table, displaying the objective function's value and runtimes.

IOT AND DATA SCIENCE IN ENGINEERING MANAGEMENT (2023)

Article Operations Research & Management Science

The Orienteering Problem with Drones

Nicola Morandi, Roel Leus, Hande Yaman

Summary: We extend the classical orienteering problem to incorporate multiple drones that cooperate with a truck. We provide a linear programming formulation and a tailored algorithm to solve the problem, demonstrating its effectiveness through computational experiments.

TRANSPORTATION SCIENCE (2023)

Article Computer Science, Interdisciplinary Applications

An improved decomposition-based heuristic for truck platooning

Boshuai Zhao, Roel Leus

Summary: This paper proposes a method to optimize the truck platooning system's routes and schedules, improves an existing heuristic, and demonstrates better performance under certain conditions.

COMPUTERS & OPERATIONS RESEARCH (2024)

Article Computer Science, Interdisciplinary Applications

Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms

Guopeng Song, Roel Leus

Summary: This study investigates parallel machine scheduling with uncertain job processing times and adopts three different modeling paradigms to handle uncertainty. Generic solution methods are proposed and compared, and general lessons are learned regarding the choice between different frameworks for planning under uncertainty.

INFORMS JOURNAL ON COMPUTING (2022)

Proceedings Paper Computer Science, Artificial Intelligence

Local Search for Aircraft-Landing Planning

Nicolas Zufferey, Marie-Sklaerder Vie, Roel Leus

Summary: This study focuses on the Aircraft Landing Planning (ALP) problem, aiming to minimize delays and satisfy separation constraints. By determining the landing sequence, associated landing times, and Holding-Stack Patterns (HSPs), delays can be reduced by approximately 50% on average.

OPTIMIZATION IN ARTIFICIAL INTELLIGENCE AND DATA SCIENCES (2022)

Article Computer Science, Interdisciplinary Applications

Exact and Approximation Algorithms for the Expanding Search Problem

Ben Hermans, Roel Leus, Jannik Matuschke

Summary: This paper presents new algorithms for the expanding search problem, which involves searching a graph for a target hidden in one of the nodes according to a known probability distribution. The proposed algorithms, including a branch-and-cut procedure, a greedy algorithm, and a local search procedure, have been analyzed both experimentally and theoretically, showing improvement on existing methods and providing the first constant-factor approximation guarantee for this problem.

INFORMS JOURNAL ON COMPUTING (2022)

No Data Available