Please use this identifier to cite or link to this item:
Title: Lot-Sizing and Scheduling for the Plastic Injection Molding Industry—A Hybrid Optimization Approach
Authors: Klement, Nathalie
Abdeljaouad, Mohamed Amine
Porto, Leonardo Rocha 
Silva, Cristovão 
Keywords: heuristic; metaheuristics; scheduling; injection molding
Issue Date: 2021
Publisher: MDPI
Project: FEDER Hauts de France and CEA Tech 
Serial title, monograph or event: Applied Sciences (Switzerland)
Volume: 11
Issue: 3
Abstract: The management of industrial systems is done through different levels, ranging from strategic (designing the system), to tactical (planning the activities and assigning the resources) and operational (scheduling the activities). In this paper, we focus on the latter level by considering a real-world scheduling problem from a plastic injection company, where the production process combines parallel machines and a set of resources. We present a scheduling algorithm that combines a metaheuristic and a list algorithm. Two metaheuristics are tested and compared when used in the proposed scheduling approach: the stochastic descent and the simulated annealing. The method’s performances are analyzed through an experimental study and the obtained results show that its outcomes outperform those of the scheduling policy conducted in a case-study company. Moreover, besides being able to solve large real-world problems in a reasonable amount of time, the proposed approach has a structure that makes it flexible and easily adaptable to several different planning and scheduling problems. Indeed, since it is composed by a reusable generic part, the metaheuristic, it is only required to develop a list algorithm adapted to the objective function and constraints of the new problem to be solved.
ISSN: 2076-3417
DOI: 10.3390/app11031202
Rights: openAccess
Appears in Collections:I&D CEMMPRE - Artigos em Revistas Internacionais

Show full item record


checked on May 2, 2023

Page view(s)

checked on Sep 25, 2023


checked on Sep 25, 2023

Google ScholarTM




This item is licensed under a Creative Commons License Creative Commons