Minimizing weighted number of early and tardy jobs with a common due window involving location penalty

This paper studies a single machine scheduling problem to minimize the weighted number of early and tardy jobs with a common due window. There are n non-preemptive and simultaneously available jobs. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due wi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of operations research 2001-11, Vol.108 (1), p.33
Hauptverfasser:	Yeung, W K, uz, Ceyda Og, Cheng, T C Edwin
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Dynamic programming Fines & penalties Flow control Job shops Just in time Manufacturers Manufacturing Operations research Scheduling Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!