Two simple constructive algorithms for the distributed assembly permutation flowshop scheduling problem

Autores: Sara Hatami, Rubén Ruiz García , Carlos Andrés Romano
Localización: Proceedings of the 7th International Conference on Industrial Engineering and Industrial Management: Valladolid, July 10-12th, 2013 / coord. por Cristina Ruiz Martin, David Jesús Poza García , Iván Velasco Jiménez; Cesáreo Hernández Iglesias (ed. lit.) , José Pérez Ríos (ed. lit.) , 2013, ISBN 978-84-616-5410-9, págs. 245-252
Idioma: inglés
Texto completo no disponible (Saber más ...)
Resumen
- Nowadays, it is necessary to improve the management of complex supply chains which are often composed of multi-plant facilities. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP). This problem is a generalization of the Distributed Permutation Flowshop Scheduling Problem (DPFSP) presented by Naderi and Ruiz (2010). The first stage of the DAPFSP is composed of f identical production factories. Each center is a flowshop that produces jobs that have to be assembled into final products in a second assembly stage. The objective is to minimize the makespan. Two simple constructive algorithms are proposed to solve the problem. Two complete sets of instances (small-large) are considered to evaluate performance of the proposed algorithms.