Solving the single machine scheduling problem with general job-dependent past-sequence-dependent setup times and learning effects

This paper deals with a single machine scheduling problem with general past-sequence-dependent (psd) setup time and log-linear learning in which the setup times and learning effects are job-dependent. The setup times are unique functions of the length of already processed jobs, and the learning effects show that processing times are unique decreasing functions of job positions. The goal is to find the optimal sequences that minimise objective functions such as the makespan, total completion time, total lateness, total waiting cost, total waiting time, total absolute differences in completion times, and the sum of earliness, tardiness and common due date penalty. Special cases of the resulting problems are solvable in polynomial time; however, the general problems are difficult to solve. We propose branch-and-bound (B%B) methods to derive the optimal sequences for such problems. Computational results show that the proposed methods can solve relatively large problem instances in reasonable amounts of time. [Received 21 December 2010; Revised 25 February 2011; Accepted 8 April 2011]