Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32343
Title: Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
Authors: Yuan, JJ
Ng, CT 
Cheng, TCE 
Keywords: Pareto optimization
Single machine
Two-agent scheduling
Issue Date: 2015
Publisher: Springer
Source: Journal of scheduling, 2015, v. 18, no. 2, p. 147-153 How to cite?
Journal: Journal of scheduling 
Abstract: We consider two-agent scheduling on a single machine with release dates and preemption to minimize the maximum lateness. In this scheduling model, there are two agents {Mathematical expression} each having his own job set {Mathematical expression}, respectively. Each job {Mathematical expression} has a release date {Mathematical expression} and the {Mathematical expression} jobs need to be preemptively scheduled on a single machine. Leung et al. (Oper Res 58:458-469, 2010) present a comprehensive study of two-agent scheduling in various machine environments. They show that problem {Mathematical expression} can be solved in {Mathematical expression} time. They use the strategy that schedules the jobs of agent {Mathematical expression} without preemption as late as possible under the restriction {Mathematical expression}. We show that the strategy fails to work even when {Mathematical expression}, invalidating their result. We then study the minimization problem {Mathematical expression} and the Pareto optimization problem {Mathematical expression}. We show that the two problems can be solved in {Mathematical expression} time, respectively.
URI: http://hdl.handle.net/10397/32343
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1007/s10951-013-0360-y
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Sep 19, 2017

WEB OF SCIENCETM
Citations

3
Last Week
0
Last month
0
Citations as of Sep 15, 2017

Page view(s)

63
Last Week
3
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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