Tri-criteria single machine scheduling model with release times and learning factor

摘要

In this paper, we consider the single machine scheduling problem with release times and a learning effect. The actual processing time of a job is a function that is the total processing time of the jobs already processed. The objective is to minimize the weighted sum of makespan, total completion time and maximum tardiness. This problem is NP-hard, some heuristic algorithms and branch-and-bound algorithm based on the Depth-first Search algorithm are proposed to solve the problem. Computational experiments are conducted to evaluate the performance of the heuristic and branch-and-bound algorithms.