Solving a Discrete Lot Sizing and Scheduling Problem with Unrelated Parallel Machines and Sequence Dependent Setup Using a Generic Decision Support Tool - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Solving a Discrete Lot Sizing and Scheduling Problem with Unrelated Parallel Machines and Sequence Dependent Setup Using a Generic Decision Support Tool

(1) , (2) , (1)
1
2

Abstract

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).
Fichier principal
Vignette du fichier
456370_1_En_54_Chapter.pdf (104.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01666207 , version 1 (18-12-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Nathalie Klement, Cristóvão Silva, Olivier Gibaru. Solving a Discrete Lot Sizing and Scheduling Problem with Unrelated Parallel Machines and Sequence Dependent Setup Using a Generic Decision Support Tool. IFIP International Conference on Advances in Production Management Systems (APMS), Sep 2017, Hamburg, Germany. pp.459-466, ⟨10.1007/978-3-319-66923-6_54⟩. ⟨hal-01666207⟩
281 View
80 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More