Storage problem in a shampoo making system - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Storage problem in a shampoo making system

Résumé

In this paper we address the problem of planning a temporary storage area in a shampoo making system. Everyday, the packing service of the company, which gathers several packing lines, transmits plans of orders to produce (also called batches) to the making service. Each plan corresponds to the work that will be performed by one packing line for the next production horizon. A batch, which consists of a volume of 12 tons of the same shampoo juice is produced by the making service and transferred to a tank before being sent to the corresponding packing line. There are several families of shampoo and a tank must be cleaned when the next batch to store have a di erent shampoo family than the last stored batch. In this temporary storage problem the goal is to minimize the number of tank cleanings and the maximum lateness of batches. Two di erent cases of this problem are considered: in the rst the lateness is allowed, and in the second no lateness is allowed. Complexity of these two cases is studied and three solution algorithms are proposed to solve the second case.
Fichier non déposé

Dates et versions

hal-01044665 , version 1 (24-07-2014)

Identifiants

  • HAL Id : hal-01044665 , version 1

Citer

Rabah Belaid, Vincent t'Kindt, Carl Esswein. Storage problem in a shampoo making system. 8ème Conférence Internationale de Modélisation et Simulation Modélisation, May 2010, Hammamet, Tunisia. ⟨hal-01044665⟩
18 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More