برنامه ریزی گروهی تنها با ماشین های جدید از زمان پردازش وابسته به موقعیت

We propose new models of position-dependent processing times for single-machine group scheduling problems. The two objectives of the scheduling problems are to minimize the makespan and the total completion time, respectively. We present polynomial-time algorithms to solve the problems.