Single-machine scheduling problems with variable processing times and delivery times involving double position-dependent effects

摘要

A general model on single-machine scheduling problems with past-sequence-dependent delivery times is developed in this paper, where the actual processing time of a job is defined by a function of its position in a schedule. Moreover, position-dependent effects in both processing times and delivery times are considered simultaneously. Problems with completion time related criteria are presented and the following objective functions: the makespan, the flowtime, the total absolute differences in completion times and their linear combinations are studied. It is shown that all the studied problems can be solved by polynomial-time algorithm.