A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

作者：Behnamian J; Zandieh M^*

来源：Expert Systems with Applications, 2011, 38(12): 14490-14498.

DOI：10.1016/j.eswa.2011.04.241

• Hybrid flowshops scheduling
• Limited waiting time
• Colonial competitive algorithm
• Mixed integer linear programming
• Earliness and tardiness penalties

Recently introduced colonial competitive algorithm (CCA) has shown its excellent capability on different optimization problems. The aim of this paper is to propose a discrete version of this method to determine a schedule that minimizes sum of the linear earliness and quadratic tardiness in the hybrid flowshops scheduling problem with simultaneously considering effects of sequence-dependent setup times and limited waiting time. In other word we assume that the waiting time for each job between two consecutive stages cannot be greater than a given upper bound. Also for this problem, a mixed integer program is formulated. Computational results are presented to evaluate the performance of the proposed algorithms for problems with different structures.

• 出版日期2011-12