Research on delivery times scheduling with truncated learning effects.

This paper addresses the single-machine scheduling with general truncated learning effects (GTLE) and delivery times that are past sequence dependent (DT psd) . The objective is to determine an optimal job schedule such that makespan, sum of the β th power of job completion times, and total weighted completion time are minimized, where β > 0 is a given constant. We proved that the makespan, the sum of the β th power of job completion times, and a special case of the total weighted completion time can be solved in polynomial time. For the general case of the total weighted completion time, we propose the heuristic, simulated annealing and branch-and-bound algorithms. Extensive numerical experiments validate the efficiency of the proposed solution algorithms on a set of randomly generated instances. Furthermore, the computational experiment is also conducted to show that the simulated annealing performs effectively and efficiently. [ABSTRACT FROM AUTHOR]