Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/22168
Title: Two-agent single-machine scheduling with release times and deadlines
Authors: Yin, Y
Cheng, SR
Cheng, TCE 
Wu, WH
Wu, CC
Keywords: Release times
Scheduling
Simulated annealing
Two agents
Issue Date: 2013
Publisher: InterScience
Source: International journal of shipping and transport logistics, 2013, v. 5, no. 1, p. 75-94 How to cite?
Journal: International journal of shipping and transport logistics 
Abstract: Multiple-agent scheduling has attracted considerable research attention in recent years. However, studies of multiple-agent scheduling with release times and deadlines are few. In the presence of ready times, sometimes it is beneficial to wait for future job arrivals in constructing a schedule. Inspired by the importance of ready times, we study the single-machine two-agent scheduling problem with releases times and deadlines to minimise the number of tardy jobs of one agent under the restriction that the maximum lateness of the jobs of the other agent cannot exceed a given value Q. Having established that the problem is strongly NP-hard, we provide a branch-and-bound and a simulated annealing algorithm to search for the optimal and approximate solutions, respectively. The results of computational experiments reveal that the SA algorithm can generate near-optimal solutions quickly.
URI: http://hdl.handle.net/10397/22168
ISSN: 1756-6517
EISSN: 1756-6525
DOI: 10.1504/IJSTL.2013.050590
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

29
Last Week
0
Last month
1
Citations as of Sep 22, 2017

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
1
Citations as of Sep 22, 2017

Page view(s)

49
Last Week
5
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



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