A Genetic Algorithm And A Simulated Annealing Algorithm Combined With Column Generation Technique For Solving The Problem Of Scheduling In The Hybrid Flowshop With Additional Resources

摘要

In this paper, a heuristic is proposed for solving the problem of scheduling in a two-stage flowshop with parallel unrelated machines and additional renewable resources at the first stage and a single machine at the second stage. Resource requirements are arbitrary integers. The availability of additional resources is limited at every moment. The objective is the minimization of makespan. The problem is NP-hard. The proposed heuristic combines column generation technique with a genetic algorithm (the heuristic algorithm HG) or a simulated annealing algorithm (the heuristic algorithm HS). The performance analysis is performed experimentally by comparing heuristic solutions to the lower bound on the optimal make-span. Results of the computational experiment show that both the heuristic algorithms yield good quality solutions using reasonable computation time and that HS outperforms HG for the most difficult problems.