MINIMIZATION OF COSTS ASSOCIATED WITH VARIABLE DUE TIMES IN ONE-MACHINE SCHEDULING THEORY

A polynomial algorithm is presented for solving the minimum-cost scheduling problem with one machine, a partially ordered set of demands, and due times depending on the demand service duration. Service costs depend on the difference between due times and service duration on maximum demand delays. Demand service interrupts are allowed and the times they are available for serving are specified. Under certain conditions the algorithm is shown to be applicable even if service interrupts are forbidden.