Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18867
Title: Due date assignment and scheduling on a single machine with two competing agents
Authors: Wang, DJ
Yin, Y
Cheng, SR
Cheng, TCE 
Wu, CC
Keywords: Due date assignment
Scheduling
Two agents
Issue Date: 2015
Publisher: Taylor & Francis
Source: International journal of production research, 2015 How to cite?
Journal: International journal of production research 
Abstract: 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 consider two types of optimisation problem, namely a linear combination optimisation problem (minimising the total integrated cost of the two agents) and a constrained optimisation problem (minimising the objective of one agent, subject to an upper bound on the objective of the other agent). We present a polynomial-time dynamic programming algorithm to solve the linear combination optimisation problem, and show that the constrained optimisation problem is (Formula presented.)-hard in the ordinary sense and admits a fully polynomial-time approximation scheme.
URI: http://hdl.handle.net/10397/18867
ISSN: 0020-7543
EISSN: 1366-588X
DOI: 10.1080/00207543.2015.1056317
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

9
Last Week
3
Last month
0
Citations as of Nov 18, 2017

WEB OF SCIENCETM
Citations

10
Last Week
2
Last month
0
Citations as of Nov 17, 2017

Page view(s)

68
Last Week
2
Last month
Checked on Nov 19, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.