Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21441
Title: Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
Authors: Cheng, TCE 
Chung, YH
Liao, SC
Lee, WC
Keywords: Maximum lateness
Scheduling
Total weighted completion time
Two agents
Issue Date: 2013
Publisher: Pergamon Press
Source: Computers and operations research, 2013, v. 40, no. 1, p. 353-361 How to cite?
Journal: Computers and operations research 
Abstract: In many management situations multiple agents pursuing different objectives compete on the usage of common processing resources. In this paper we study a two-agent single-machine scheduling problem with release times where the objective is to minimize the total weighted completion time of the jobs of one agent with the constraint that the maximum lateness of the jobs of the other agent does not exceed a given limit. We propose a branch-and-bound algorithm to solve the problem, and a primary and a secondary simulated annealing algorithm to find near-optimal solutions. We conduct computational experiments to test the effectiveness of the algorithms. The computational results show that the branch-and-bound algorithm can solve most of the problem instances with up to 24 jobs in a reasonable amount of time and the primary simulated annealing algorithm performs well with an average percentage error of less than 0.5% for all the tested cases.
URI: http://hdl.handle.net/10397/21441
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2012.07.013
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

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

Page view(s)

46
Last Week
5
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.