Robust Basic Cyclic Scheduling Problem - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Journal Articles EURO Journal on Computational Optimization Year : 2018

Robust Basic Cyclic Scheduling Problem

Abstract

This paper addresses the Basic Cyclic Scheduling Problem where the processing times are affected by uncertainties. We formulate the problem as a two-stage robust optimization problem with polyhedral uncertainty set. We propose three exact algorithms for solving the problem. Two of them use a negative circuit detection algorithm as a subroutine and the last one is an Howard's algorithm adaptation. Results of numerical experiments on randomly generated instances show that the Howard's algorithm adaptation yields efficient results and opens perspectives on more difficult robust cyclic scheduling problems.
Fichier principal
Vignette du fichier
robust-basic-cyclic-problem.pdf (329.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01635856 , version 1 (15-11-2017)

Identifiers

Cite

Idir Hamaz, Laurent Houssin, Sonia Cafieri. Robust Basic Cyclic Scheduling Problem. EURO Journal on Computational Optimization, 2018, 6 (3), pp.291-313. ⟨10.1007/s13675-018-0100-3⟩. ⟨hal-01635856⟩
194 View
437 Download

Altmetric

Share

Gmail Facebook X LinkedIn More