A parallel competitive colonial algorithm for JIT flowshop scheduling

作者：Behnamian J^*

来源：Journal of Computational Science, 2014, 5(5): 777-783.

DOI：10.1016/j.jocs.2013.11.002

• Bi-objective flowshop
• Just-in-time scheduling
• Pareto optimum solution
• Parallel algorithm
• Colonial competitive algorithm
• Makespan
• Sum of the earliness and tardiness penalties

This paper proposes two parallel algorithms which are improved by heuristics for a bi-objective flowshop scheduling problem with sequence-dependent setup times in a just-in-time environment. In the proposed algorithms, the population will be decomposed into the several sub-populations in parallel. Multiple objectives are combined with min-max method then each sub-population evolves separately in order to obtain a good approximation of the Pareto-front. After unifying the obtained results, we propose a variable neighborhood algorithm and a hybrid variable neighborhood search/tabu search algorithm to improve the Pareto-front. The non-dominated sets obtained from our proposed algorithms, a genetic local search and restarted iterated Pareto greedy algorithm are compared. It is found that most of the solutions in the net non-dominated front are yielded by our proposed algorithms.

• 出版日期2014-9