Advertisement
Published in:
2014 | OriginalPaper | Chapter
Two Simple Constructive algorithms for the Distributed Assembly Permutation Flowshop Scheduling Problem
Authors : Sara Hatami, Rubén Ruiz, Carlos Andrés Romano
Published in: Managing Complexity
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
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 (Comput Oper Res, 37(4):754–768, 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.