DeepAI AI Chat
Log In Sign Up

Exact Lexicographic Scheduling and Approximate Rescheduling

by   Dimitrios Letsios, et al.

In industrial scheduling, an initial planning phase may solve the nominal problem and a subsequent recovery phase may intervene to repair inefficiencies and infeasibilities, e.g. due to machine failures and job processing time variations. This work investigates the minimum makespan scheduling problem with job and machine perturbations and shows that the recovery problem is strongly NP-hard, at least as hard as solving the problem with full input knowledge. We explore recovery strategies with respect to the (i) planning decisions and (ii) permitted deviations from the original schedule. The resulting performance guarantees are parameterized by the degree of uncertainty. The analysis derives from the optimal substructure imposed by lexicographic optimality, so lexicographic optimization enables more efficient reoptimization. We revisit state-of-the-art exact lexicographic optimization methods and propose a novel lexicographic optimization approach based on branch-and-bound. Numerical analysis using standard commercial solvers substantiates the method.


page 1

page 2

page 3

page 4


Approximating Bounded Job Start Scheduling with Application in Royal Mail Deliveries under Uncertainty

Motivated by mail delivery scheduling problems arising in Royal Mail, we...

Robust Scheduling with GFlowNets

Finding the best way to schedule operations in a computation graph is a ...

Decomposition Strategies for Solving Scheduling Problems in Industrial Applications

This article presents an overview of a research study of a crucial optim...

Model Oriented Scheduling Algorithm for The Hardware-In-The-Loop Simulation

This paper presents an approach for designing software for dynamical sys...

Optimal Task Scheduling Benefits From a Duplicate-Free State-Space

The NP-hard problem of task scheduling with communication delays (P|prec...