Skip to Main content Skip to Navigation

Ordonnancement sur les machines à traitement par batches et contraintes de compatibilité.

Adrien Bellanger 1
1 ORCHIDS - Operations research for Complex HybrId Decision Sytems
LORIA - NSS - Department of Networks, Systems and Services
Abstract : This thesis deals with 2-stages hybrid flowshop scheduling problems with batching ma- chines on the second stage and compatibility constraints. The processing times of tasks are given by intervals and tasks are compatible if they share a same second stage processing time. We developped 6 heuristics with worth-case analysis for the makespan minimization problem. The experimental results show that these heuristics give good schedules with an average gap of 1% on 200 task instances. For small instances, we presented 2 exact methods, Branch & Bounds, which solves up to 20 task instances. For the particular case with identical processing times on first stage and uniform processing time intervals we developped a Polynomial Time Approximation Scheme (PTAS). The second part of this thesis deal with scheduling problems on one batching machine with infinite capacity and regular criteria minimization. We developped pseudo-polynomial dynamic programming algorithm for minimization total completion time, maximal lateness and total tardiness. Finally we show the NP-completeness of problems with due dates.
Document type :
Complete list of metadatas
Contributor : Ammar Oulamara <>
Submitted on : Thursday, July 7, 2011 - 8:40:35 AM
Last modification on : Tuesday, December 18, 2018 - 4:42:06 PM
Long-term archiving on: : Saturday, October 8, 2011 - 2:20:47 AM


  • HAL Id : tel-00606383, version 1


Adrien Bellanger. Ordonnancement sur les machines à traitement par batches et contraintes de compatibilité.. Informatique [cs]. Institut National Polytechnique de Lorraine - INPL, 2009. Français. ⟨tel-00606383⟩



Record views


Files downloads