Decomposition algorithms for planning the production of a real shampoo industry

Rabah Belaid (1) , Vincent t'Kindt (1) , Carl Esswein (1)

1 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours

We present in this paper the problem of planning the production of various capillary products in a real shampoo industry. The overall production system consists of three services: the making, the temporary storage and the packing services. Everyday, the packing service of the company transmits to the making service plans of orders to be produced (also called batches). Each plan corresponds to the work that has to be performed by one packing line for the next production horizon. The making service gathers several making units and is in charge of producing the batches that will later on be packed in bottles by the packing service. The aim of this scheduling problem is to assign the batches to the making units and to schedule them on their resources. The objective is to minimize the number of cleanings of the making resources. We model the problem on one making unit as a three stage Hybrid Flowshop with a common server of setups. We also present experimental results of decomposition heuristics that we have developed to solve this problem

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Rabah Belaid, Vincent t'Kindt, Carl Esswein. Decomposition algorithms for planning the production of a real shampoo industry. 4th International Conference on Industrial Engineering and Systems Management, May 2011, Metz, France. ⟨hal-01025737⟩