Single-machine scheduling against due dates with past-sequence dependent setup times

Biskup D, Herrmann J (2007) Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld.
Bielefeld: Universität Bielefeld.

Download
OA
Diskussionspapier | Veröffentlicht | Englisch
Autor
;
Abstract / Bemerkung
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.
Erscheinungsjahr
Zeitschriftennummer
562
PUB-ID

Zitieren

Biskup D, Herrmann J. Single-machine scheduling against due dates with past-sequence dependent setup times. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld. Bielefeld: Universität Bielefeld; 2007.
Biskup, D., & Herrmann, J. (2007). Single-machine scheduling against due dates with past-sequence dependent setup times (Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld). Bielefeld: Universität Bielefeld.
Biskup, D., and Herrmann, J. (2007). Single-machine scheduling against due dates with past-sequence dependent setup times. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, Bielefeld: Universität Bielefeld.
Biskup, D., & Herrmann, J., 2007. Single-machine scheduling against due dates with past-sequence dependent setup times, Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, Bielefeld: Universität Bielefeld.
D. Biskup and J. Herrmann, Single-machine scheduling against due dates with past-sequence dependent setup times, Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, Bielefeld: Universität Bielefeld, 2007.
Biskup, D., Herrmann, J.: Single-machine scheduling against due dates with past-sequence dependent setup times. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld. Universität Bielefeld, Bielefeld (2007).
Biskup, Dirk, and Herrmann, Jan. Single-machine scheduling against due dates with past-sequence dependent setup times. Bielefeld: Universität Bielefeld, 2007. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
1970-01-01T00:00:00Z

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar