Non-permutation flowshop scheduling with dual resources

作者：

Highlights：

• Non-permutation flowshop scheduling with dual resource constraints is proposed.

• A mathematical model and three search algorithms based on tabu search are developed.

• Algorithm performs well with 2% deviation from optimal solution in small problems.

• Effectiveness and efficiency of developed algorithms have inverse relation.

• Non-permutation algorithms perform better than permutation algorithm.

摘要

•Non-permutation flowshop scheduling with dual resource constraints is proposed.•A mathematical model and three search algorithms based on tabu search are developed.•Algorithm performs well with 2% deviation from optimal solution in small problems.•Effectiveness and efficiency of developed algorithms have inverse relation.•Non-permutation algorithms perform better than permutation algorithm.

论文关键词：Scheduling,Dual resources,Mixed-integer programming,Non-permutation flowshop,Sequence-dependent setup time

论文评审过程：Available online 15 March 2013.

论文官网地址：https://doi.org/10.1016/j.eswa.2013.03.007