Branch-and-Bound Algorithm for Solving it Technician Scheduling Problems with Minimum Total Delay Considering Task Release Time

For the scheduling needs of technicians in IT operations and maintenance services, a study was conducted with the objective of minimizing the total delay of heterogeneous technicians for independent service tasks. An IT technician scheduling model considering task release time is established, and a branch-and-bound algorithm with multiple effective dominance rules is proposed, giving a heuristic initial upper bound and four effective lower bounds. Computational experiments are carried out with a randomly generated case base, and the computational experimental results show that the algorithm can give an exact solution to the scheduling problem for 5 technicians and 20 service tasks in a reasonable amount of CPU time