Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8706
Title: Two-agent single-machine scheduling with deteriorating jobs
Authors: Yin, Y
Cheng, TCE 
Wan, L
Wu, CC
Liu, J
Keywords: Deteriorating jobs
Scheduling
Single machine
Two agents
Issue Date: 2015
Publisher: Elsevier Ltd
Source: Computers and industrial engineering, 2015, v. 81, p. 177-185 How to cite?
Journal: Computers and Industrial Engineering 
Abstract: We consider several two-agent single-machine scheduling problems with deteriorating jobs. By deteriorating jobs we mean that the actual processing time of any job of the two agents is an increasing linear function of its starting time. Each agent wants to minimize a certain objective function, which depends on the completion times of its jobs only. The goal is to schedule the jobs such that the performance of the schedule is satisfactory with respect to the objective functions of both agents. We consider six scheduling problems associated with different combinations of the two agents' objective functions, which include the maximum cost, total weighted completion time, discounted total weighted completion time, maximum earliness cost, total earliness, and total weighted earliness. We examine different scenarios depending on the trade-off between the two agents. Under each scenario, we address the computational complexity and solvability issues of various problems that seek to find the optimal solution for one agent, subject to an upper bound on the maximum (earliness) cost of the other agent.
URI: http://hdl.handle.net/10397/8706
ISSN: 0360-8352
DOI: 10.1016/j.cie.2015.01.002
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

11
Last Week
0
Last month
1
Citations as of Feb 20, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
1
Citations as of Jan 13, 2017

Page view(s)

23
Last Week
1
Last month
Checked on Feb 19, 2017

Google ScholarTM

Check

Altmetric



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