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.
https://hal.archives-ouvertes.fr/hal-01635856
Contributor : Idir Hamaz
<>
Submitted on : Wednesday, November 15, 2017 - 5:54:17 PM
Last modification on : Tuesday, February 11, 2020 - 1:55:42 PM
Long-term archiving on: Friday, February 16, 2018 - 3:40:22 PM
