Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31764
Title: Two-agent single-machine scheduling with assignable due dates
Authors: Yin, Y
Cheng, SR
Cheng, TCE 
Wu, CC
Wu, WH
Keywords: Assignable due dates
Scheduling
Single machine
Two agents
Issue Date: 2012
Publisher: Elsevier
Source: Applied mathematics and computation, 2012, v. 219, no. 4, p. 1674-1685 How to cite?
Journal: Applied mathematics and computation 
Abstract: We consider several two-agent scheduling problems with assignable due dates on a single machine, where each of the agents wants to minimize a measure depending on the completion times of its own jobs and the due dates are treated as given variables and must be assigned to individual jobs. The goal is to assign a due date from a given set of due dates and a position in the sequence to each job so that the weighted sum of the objectives of both agents is minimized. For different combinations of the objectives, which include the maximum lateness, total (weighted) tardiness, and total (weighted) number of tardy jobs, we provide the complexity results and solve the corresponding problems, if possible.
URI: http://hdl.handle.net/10397/31764
ISSN: 0096-3003
EISSN: 1873-5649
DOI: 10.1016/j.amc.2012.08.008
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

28
Last Week
0
Last month
2
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

22
Last Week
0
Last month
1
Citations as of Aug 12, 2017

Page view(s)

44
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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