Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32926
Title: On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
Authors: Ng, CT 
Lu, L
Keywords: Competitive ratio
On-line algorithm
Scheduling
Issue Date: 2012
Publisher: Springer
Source: Journal of scheduling, 2012, v. 15, no. 3, p. 391-398 How to cite?
Journal: Journal of scheduling 
Abstract: In this paper, we consider the on-line integrated production and outbound distribution scheduling problem to minimize the maximum delivery completion time. All jobs arrive over time, and each job and its processing time become known at its arrival time. The jobs are first processed on a single machine and then delivered by a vehicle to a single customer. The vehicle can deliver at most c jobs to the customer at a time. When preemption is allowed and c > 2, we can provide an on-line algorithm with the best competitive ratio 2 √5+1/2≈ 1.618. When preemption is not allowed, we provide an on-line algorithm which has the best competitive ratio √5+1/2≈ 1.618 for the case c = 1 and has an asymptotic competitive ratio √5+1/2≈1.618 for the case c > 2.
URI: http://hdl.handle.net/10397/32926
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1007/s10951-011-0260-y
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Aug 20, 2017

Page view(s)

60
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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