Due date assignment and scheduling on a single machine with two competing agents

We study a single-machine due date assignment and scheduling problem involving two agents each seeking to optimise its own performance. We consider three due date assignment methods, namely the common, slack and unrestricted due date assignment methods. For each due date assignment method, we consid...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of production research Jg. 54; H. 4; S. 1152 - 1169
Hauptverfasser:	Wang, Du-Juan, Yin, Yunqiang, Cheng, Shuenn-Ren, Cheng, T.C.E., Wu, Chin-Chia
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 16.02.2016 Taylor & Francis LLC
Schlagworte:	Algorithms Approximation Constraints Cost engineering due date assignment Due dates Dynamic programming Mathematical analysis Optimization Production scheduling Scheduling two agents
ISSN:	0020-7543, 1366-588X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!