Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/35808
Title: Two-agent single-machine scheduling with unrestricted due date assignment
Authors: Yin, YQ
Cheng, TCE 
Yang, XQ
Wu, CC
Keywords: Scheduling
Single machine
Two agents
Due date assignment
Issue Date: 2015
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2015, v. 79, p. 148-155 How to cite?
Journal: Computers and industrial engineering 
Abstract: We address two scheduling problems arising when two agents (agents A and B), each with a set of jobs, compete to perform their respective jobs on a common machine, where the due dates of agent A's jobs are decision variables to be determined by the scheduler. Specifically, the objective is to determine the optimal due dates for agent A's jobs and the job sequence for both agents' jobs simultaneously to minimize the total cost associated with the due date assignment and weighted number of tardy jobs of agent A, while keeping the maximum of regular functions (associated with each B-job) or the number of tardy jobs of agent B below or at a fixed threshold. We prove that both problems are NP-hard in the strong sense and develop polynomial or pseudo-polynomial solutions for some important special cases.
URI: http://hdl.handle.net/10397/35808
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2014.10.025
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

19
Last Week
0
Last month
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
Citations as of Aug 13, 2017

Page view(s)

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