Solving a Discrete Lot Sizing and Scheduling Problem with Unrelated Parallel Machines and Sequence Dependent Setup Using a Generic Decision Support Tool
Résumé
In any manufacturing systems, planning and scheduling are not intuitive. Some dedicate tools may exist to help some specific companies to daily plan and assign their activities. Our purpose is to develop a generic decision support tool to solve any planning or scheduling problems. To do so, we use a hybridization between a metaheuristic and a list algorithm. The metaheuristic is generic to any studied problems. The list algorithm needs to be specific to the considered problem. The use of our tool needs a minimum work development. In this paper, our proposal is illustrated by the case study of a textile company which intends to schedule its production, by assigning it resources and dates. This problem can be seen as a Discrete Lot Sizing and scheduling Problem (DLSP).
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...
