Skip to Main content Skip to Navigation
Journal articles

A genetic algorithm for robust schedules in a just-in-time environment

Abstract : Computing a schedule for a single machine problem is often difficult for irregular criteria, but when the data are uncertain, the problem is much more complicated. In this paper, we modify a genetic algorithm to compute robust schedules when release dates are subject to small variations. Two types of robustness are distinguished: quality robustness or robustness in the objective function space and solution robustness or robustness in the solution space. We show that the modified genetic algorithm can find solutions that are robust with respect to both types of robustness. Moreover, the risk associated with a specific solution can be easily evaluated. The modified genetic algorithm is applied to a just-in-time scheduling problem, a common problem in many industries.
Document type :
Journal articles
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03368987
Contributor : Thérèse Bonte Connect in order to contact the contributor
Submitted on : Thursday, October 7, 2021 - 10:02:03 AM
Last modification on : Monday, September 5, 2022 - 2:16:05 PM

Identifiers

Collections

Citation

Marc Sevaux, Kenneth Sorensen. A genetic algorithm for robust schedules in a just-in-time environment. AAPS PharmSciTech, American Association of Pharmaceutical Scientists, 2004, pp.1-25. ⟨10.1007/s10288-003-0028-0⟩. ⟨hal-03368987⟩

Share

Metrics

Record views

9