martes, 26 de septiembre de 2017

Ficha del recurso:


Vínculo original en INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 49 (22):6787-6811; 10.1080/00207543.2010.519922 2011
Pessan, C; Neron, E

Última actualización:

jueves, 12 de abril de 2012

Entrada en el observatorio:

jueves, 12 de abril de 2012



Archivado en:

Setup tasks scheduling during production resettings

Production waste reduction during production resettings is critical in the industry as it is the key point of flexibility increase. One way to improve production waste is to assign setup tasks efficiently to operators. This article describes a possible model of this problem adapted to a real-life application. This model is based on an unrelated parallel machines problem that takes into consideration the skills of the operators and the production line structure. The nature of the data and some industrial constraints help us simplifying this problem into an assignment problem. As often in the industry, the objective is to maximise production. Because most production lines are complex series parallel lines, it is often possible to maintain production even if not all machines are running. This particularity makes the criterion hard to express as it depends on the line structure. In this article we describe three heuristics to solve this problem: a hill climbing algorithm,! a genetic algorithm and a memetic algorithm that combines the advantages of the two previous algorithms. The neighbourhood used for these algorithms is based on multiple exchanges of tasks between operators.