Single-machine scheduling with periodic maintenance and learning effect

Abstract

AbstractThis paper discusses a single-machine scheduling problem with periodic maintenance activities and position-based learning effect to minimize the makespan. To obtain exact solutions of small-scale problems, one new two-stage binary integer programming model is formulated. In addition, a branch and bound algorithm combining boundary method and pruning rules is also proposed. According to the property of the optimal solution, a special search neighborhood is constructed. A hybrid genetic-tabu search algorithm based on genetic mechanism with tabu technique as an operator is proposed to solve medium-scale and large-scale problems. Moreover, to improve the efficiency of genetic algorithm and hybrid genetic-tabu search algorithm, Taguchi method is used for parameter tuning. Furthermore, computational experiments are carried out to compare the efficiency and performance of these algorithms.