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...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of production research Ročník 54; číslo 4; s. 1152 - 1169
Hlavní autori:	Wang, Du-Juan, Yin, Yunqiang, Cheng, Shuenn-Ren, Cheng, T.C.E., Wu, Chin-Chia
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 16.02.2016 Taylor & Francis LLC
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!