A two-stage invasive weed optimization algorithm for distributed assembly permutation flowshop problem

Distributed assembly permutation flowshop scheduling problem (DAPFSP) has important applications in modern assembly systems. In this paper, we address the DAPFSP with total flowtime minimization. According to the problem knowledge, we present a two-level representation which consists of product permutation and job sequences. A two-stage discrete invasive… (More)