Solutions methods for m-machine blocking flow shop with setup times and preventive maintenance costs to minimise hierarchical objective-function
研究了在序列相关设置时间的阻塞流水车间中纳入维护操作，以最小化总完工时间并受总维护成本约束的问题，提出了混合整数线性规划及多种元启发式算法，实验表明DABC(20)和VBIH(20)在解质量和计算时间上表现最佳。
In this article, maintenance operations were incorporated to the sequence-dependent setup blocking flow shop to minimise total completion time subject to total maintenance costs. A mixed integer linear programming and procedures to incorporate maintenance to job sequence were developed. A constructive heuristic and three metaheuristics, greedy randomised adaptative search procedure (GRASP), discrete artificial bee colony (DABC), variable block insertion heuristic (VBIH) and iterated greedy algorithm (IG), designed to the blocking flow shop with total completion time minimisation were adapted to minimise total maintenance costs and the hierarchical function, respectively.All the methods were applied to solve small and medium and large size instance sets, with respective 1920 and 2200 problems. Experimental results shows that for small size instances set, DABC with α=20 (DABC(20)) obtained the best trade-off between effectiveness and efficiency. For medium and large size instances set, DABC(20) VBIH with α=20 (VBIH(20)) generated the best trade-off between quality of solution and computational time. Considering both instances set together, both DABC(20) and VBIH(20) obtained the best performance between quality of solution and computational time.