Abstract
This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have