Single‐machine scheduling problems with past‐sequence‐dependent delivery times and position‐dependent processing times

This paper considers single‐machine scheduling problems with job delivery times where the actual job processing time of a job is defined by a function dependent on its position in a schedule. We assume that the job delivery time is proportional to the job waiting time. We investigate the minimization problems of the sum of earliness, tardiness, and due‐window‐related cost, the total absolute differences in completion times, and the total absolute differences in waiting times on a single‐machine setting. The polynomial time algorithms are proposed to optimally solve the above objective functions. We also investigate some special cases of the problem under study and show that they can be optimally solved by lower order algorithms.