TY  - GEN
AB  - Recently Koulamas and Kyparisis (2006) introduced past-sequence-dependent setup times to scheduling problems. This means that the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. Koulamas and Kyparisis (2006) were able to show for a number of single-machine scheduling problems with completion time goals that they remain polynomially solvable. In this paper we extend the analysis to problems with due dates. We were able to show that some problems remain polynomially solvable. However, for some other problems well-known polynomially solution approaches do not guarantee optimality any longer, consequently we concentrated on finding polynomially solvable special cases.
DA  - 2007
KW  - Due dates
KW  - Scheduling
KW  - Setup times
LA  - eng
PY  - 2007
TI  - Single-machine scheduling against due dates with past-sequence dependent setup times
UR  - https://nbn-resolving.org/urn:nbn:de:hbz:361-10529
Y2  - 2024-11-21T21:48:49
ER  -