Please use this identifier to cite or link to this item:
Title: CON/SLK due date assignment and scheduling on a single machine with two agents
Authors: Yin, Y
Wang, DJ
Wu, CC
Cheng, TCE 
Keywords: Due date assignment
Two agents
Issue Date: 2016
Publisher: John Wiley & Sons
Source: Naval research logistics, 2016, v. 63, no. 5, p. 416-429 How to cite?
Journal: Naval research logistics 
Abstract: We consider scheduling problems involving two agents (agents A and B), each having a set of jobs that compete for the use of a common machine to process their respective jobs. The due dates of the A-jobs are decision variables, which are determined by using the common (CON) or slack (SLK) due date assignment methods. Each agent wants to minimize a certain performance criterion depending on the completion times of its jobs only. Under each due date assignment method, the criterion of agent A is always the same, namely an integrated criterion consisting of the due date assignment cost and the weighted number of tardy jobs. Several different criteria are considered for agent B, including the maxima of regular functions (associated with each job), the total (weighted) completion time, and the weighted number of tardy jobs. The overall objective is to minimize the performance criterion of agent A, while keeping the objective value of agent B no greater than a given limit. We analyze the computational complexity, and devise polynomial or pseudo-polynomial dynamic programming algorithms for the considered problems. We also convert, if viable, any of the devised pseudopolynomial dynamic programming algorithms into a fully polynomial-time approximation scheme.
ISSN: 0894-069X
EISSN: 1520-6750
DOI: 10.1002/nav.21700
Appears in Collections:Journal/Magazine Article

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


Citations as of Sep 9, 2017


Last Week
Last month
Citations as of Sep 21, 2017

Page view(s)

Last Week
Last month
Checked on Sep 17, 2017

Google ScholarTM



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