Abstract
Abstract 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have