Book ChapterDOI
Explicit modelling of multiple intervals in a constraint generation procedure for multiprocessor scheduling
TLDR
The explicit modelling of multiple intervals strengthens the formulation used in the constraint generation procedure and the computational effects on an industrial relevant avionics scheduling problem are illustrated.Abstract:
Multiprocessor scheduling is a well studied NP-hard optimisation problem that occurs in variety of forms. The focus of this paper is explicit modelling of multiple task intervals. This work extends a constraint generation procedure previously developed for an avionics scheduling context. We here address a relaxation of the original problem and this relaxation can be considered as multiprocessor scheduling with precedence relations and multiple intervals. The explicit modelling of multiple intervals strengthens the formulation used in the constraint generation procedure and we illustrate the computational effects on an industrial relevant avionics scheduling problem.read more
Citations
More filters
Journal ArticleDOI
A matheuristic approach to large-scale avionic scheduling
TL;DR: The contribution is a matheuristic for solving large-scale instances of an integrated modular avionic system by improving the model formulations used in a previously suggested constraint generation procedure and including an adaptive large neighbourhood search to extend it into a mat heuristic.
References
More filters
Journal ArticleDOI
Robust Ship Scheduling with Multiple Time Windows
TL;DR: A set partitioning approach is proposed to solve the problem of robust schedules that are less likely to result in ships staying idle in ports during the weekend, and impose penalty costs for arrivals at risky times (i.e., close to weekends).
Journal ArticleDOI
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
TL;DR: This work shows what needs to be done in order to adapt a constraint programming algorithm for the traveling salesman problem with time windows so that it can handle multiple time windows.
Journal ArticleDOI
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection
TL;DR: It is shown on random instances and on real world instances from industry that the MILP model can be solved to optimality in reasonable time with a standard MILP solver for several small instances and that the heuristic gives the same solutions for most of the small instances.
Journal ArticleDOI
An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system
TL;DR: A mathematical model is presented for an industrially relevant avionic system and a constraint generation procedure for the scheduling of such systems is presented and the optimisation approach can be used to create schedules for such instances within a reasonable time.