Coupled task scheduling with time-dependent processing times

The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks, and there is an exact delay between the tasks. We investigate the single machine coupled task scheduling problem with the objective of minimizing the makespan under identical processing time for the first task and identical delay period for all jobs, and the time-dependent processing time setting for the second task. Certain healthcare appointment scheduling problems can be modeled as the coupled task scheduling problem. Also, the incorporation of time-dependent processing time for the second task lets the human resource fatigue and the deteriorating health conditions be modeled. We provide optimal solution under certain conditions. In addition, we propose a dynamic program under the condition that the majority of jobs share the same time-dependent characteristic. We develop a heuristic for the general case and show that the heuristic performs well.</p