Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times
Ist Teil von
Engineering applications of artificial intelligence, 2021-01, Vol.97, p.104016, Article 104016
Ort / Verlag
Elsevier Ltd
Erscheinungsjahr
2021
Link zum Volltext
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
The distributed permutation flowshop scheduling problem (DPFSP) has been a hot issue in recent years. Due to the practical relevance of sequence-dependent setup time (SDST), we consider the DPFSP with SDST to minimize makespan. For the purpose, we propose three constructive heuristics and an effective discrete artificial bee colony (DABC) algorithm. All the heuristics are based on a greedy assignment rule and a local search of job blocks in each factory. In the local search, three different setup times are respectively considered for inserting a job block. In the DABC, to balance the local exploitation and the global exploration, we propose six composite neighborhood operators according to the problem characteristics. The first three are based on insertion and swap operators, and the second three have a close relationship with the critical factory. A problem-oriented local search method is developed to improve the best individual in the population. A comprehensive computational campaign against the closely related and state-of-the-art algorithms in the literature shows that both the proposed heuristics and DABC are very effective for solving the problem under consideration.
•We study a distributed permutation flowshop scheduling problem with sequence-dependent setup times.•Three effective constructive heuristics and a discrete bee colony optimization are presented.•Six problem-specified neighborhood operators are proposed.•A local search method based on job block is presented.•The effectiveness of the presented algorithms are demonstrated by the experimental results.