Skip to Main content Skip to Navigation

Constructions agrégatives d'ordonnancements pour des jobs-shops statiques, dynamiques et réactifs

Abstract : The aim of this thesis is to present a new approach to solve job-shop scheduling problems. Generally, heuristic methods, and especially priority rules, are used for large scale problems. In our approach, we suggest the construction of partial schedules by dealing with jobs, one after the others. A partial schedule is characterized by the sequence of their operations on each machine. The principle is to aggregate a new job on the current schedule, i.e., to insert its operations without altering the previous order. In a first part, according to this approach, methods are described for solving the classical job-shop problem. Then, these methods are extended to solve generalized job-shop problems. In such problems, assignment between operations and machines is free. Finally, we deal with dynamic and reactive job-shop problems. It takes in account uncertain events such as machine breakdowns. The aggregation methods seems to be an efficient way of solving these last problems.
Complete list of metadatas

Cited literature [81 references]  Display  Hide  Download
Contributor : Thèses Imag <>
Submitted on : Wednesday, February 25, 2004 - 2:25:31 PM
Last modification on : Friday, November 6, 2020 - 3:55:30 AM
Long-term archiving on: : Friday, September 14, 2012 - 1:10:09 PM


  • HAL Id : tel-00005107, version 1



Bernard Penz. Constructions agrégatives d'ordonnancements pour des jobs-shops statiques, dynamiques et réactifs. Modélisation et simulation. Université Joseph-Fourier - Grenoble I, 1994. Français. ⟨tel-00005107⟩



Record views


Files downloads