Skip to Main content Skip to Navigation
Theses

Ordonnancements coopératifs pour les chaînes logistiques

Zerouk Mouloua 1
1 ORCHIDS - Operations research for Complex HybrId Decision Sytems
LORIA - NSS - Department of Networks, Systems and Services
Abstract : We propose new decision methods and tools for coordinating supply chain scheduling. These new methods focus on the cooperation between supply chain partners by means of negotiations about suppliers' raw materials arrival dates, and customers' delivery dates of finished. We consider a supply chain, which consists in a network of enterprises with independent decision centers. The finished products (or sub products) of the assembly enterprise are produced using components and/or sub products supplied by other enterprises or by external suppliers. We assume we are at the scheduling level and each enterprise builds its own schedules associated with its own production centers. As an operation can be performed only when the production center has received the necessary components and/or sub products, the schedules are dependent. This induces negotiations between decision centers of enterprises, which can be expressed in term of penalty functions associated with soft and hard release dates and due dates. At each negotiation point, hard release dates and due dates are considered as imperative constraints, while soft release dates and due dates define soft intervals and induce earliness and tardiness penalties. Both soft and hard constraints can be modified during the negotiation process. A global solution is searched by an iterative decomposition approach including alternatively bilateral negotiations of the soft and hard constraints between the production decision centers and just in time scheduling, minimizing the local total sum of penalties, built by approximation approaches. We assume that production centers are flow shop (linear production and/or assembly line). To solve each local just-in-time scheduling problem, we propose an approximation approach based on meta- heuristics, which explores the set of feasible and infeasible solutions, in which a solution is described by the job order on each machine (permutation of integers) and is evaluated using a "pert cost" algorithm. The infeasible solutions are evaluated by a lower bound of the number of non verified imperative constraints and the feasible solutions are evaluated by the minimal sum of penalties corresponding to the considered order. A semi-decentralized control is suggested to assume the negotiation convergence. Furthermore, we study some transportation optimization problems in supply chains.
Document type :
Theses
Complete list of metadatas

Cited literature [106 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00606329
Contributor : Ammar Oulamara <>
Submitted on : Wednesday, July 6, 2011 - 10:07:45 AM
Last modification on : Tuesday, December 18, 2018 - 4:42:06 PM

Identifiers

  • HAL Id : tel-00606329, version 1

Citation

Zerouk Mouloua. Ordonnancements coopératifs pour les chaînes logistiques. Informatique [cs]. Institut National Polytechnique de Lorraine - INPL, 2007. Français. ⟨tel-00606329⟩

Share

Metrics

Record views

696

Files downloads

13198