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

Full description

Bibliographic Details

Published in:	International journal of production research Vol. 54; no. 4; pp. 1152 - 1169
Main Authors:	Wang, Du-Juan, Yin, Yunqiang, Cheng, Shuenn-Ren, Cheng, T.C.E., Wu, Chin-Chia
Format:	Journal Article
Language:	English
Published:	London Taylor & Francis 16.02.2016 Taylor & Francis LLC
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!