New Results on Multitasking via Alternate Period Processing
Résumé
This paper is motivated by disruptions that occur when jobs are processed by human instead of machine. For mitigating the loss of productivity, we study a single machine scheduling problem with alternate periods including odd period and even-period. In this problem, we consider continuous processing, which means preemption is not allowed. Two objectives are considered: makespan (1|alt|Cmax) and tardiness time (1|alt|Tmax). We devise a dynamic programming algorithm and analyze the complexity of problem. To the best of our knowledge, we are the first to use dynamic programming to minimize Cmax and Tmax without preemptions under alternate period.