0000000000121600
AUTHOR
Sara Hatami
Two Simple Constructive algorithms for the Distributed Assembly Permutation Flowshop Scheduling Problem
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 proble…
The distributed assembly permutation flowshop scheduling problem
Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The o…