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.
28 September 2021 in The International Journal of Advanced Manufacturing Technology
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).