 |
HAL-LAAS Open Archive Laboratory for Analysis and Architecture of Systems |  |
Journal articles
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.
Cited literature [17 references]
https://hal.archives-ouvertes.fr/hal-01635856
Contributor : Idir Hamaz <>
Submitted on : Wednesday, November 15, 2017 - 5:54:17 PM
Last modification on : Tuesday, October 20, 2020 - 10:32:05 AM
Long-term archiving on: : Friday, February 16, 2018 - 3:40:22 PM
Contributor : Idir Hamaz <>
Submitted on : Wednesday, November 15, 2017 - 5:54:17 PM
Last modification on : Tuesday, October 20, 2020 - 10:32:05 AM
Long-term archiving on: : Friday, February 16, 2018 - 3:40:22 PM
File
robust-basic-cyclic-problem.pd...
Files produced by the author(s)