Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10426
Title: A note on one-processor scheduling with asymmetric earliness and tardiness penalties
Authors: Li, CL 
Chen, ZL
Cheng, TCE 
Keywords: Earlines
Scheduling
Tardiness
Issue Date: 1993
Publisher: North-Holland
Source: Operations research letters, 1993, v. 13, no. 1, p. 45-48 How to cite?
Journal: Operations research letters 
Abstract: We consider the problem of scheduling n independent and simultaneously available jobs on one processor. Each job has a specified processing time and a preferred starting time. The jobs are to be schedules nonpreemptively on the processor to begin as close to their preferred starting times as possible. We examine one cost measure - the amximum weighted discrepancy from the preferred starting time. Under an assumption on penalty weights, we show that the problem is reducible to the problem with equal penalty weights and the algorithms given by Garey, Tarjan and Wilfong can be modified to solve our problem.
URI: http://hdl.handle.net/10397/10426
ISSN: 0167-6377
EISSN: 1872-7468
DOI: 10.1016/0167-6377(93)90084-T
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
0
Citations as of Oct 19, 2018

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Oct 18, 2018

Page view(s)

74
Last Week
0
Last month
Citations as of Oct 21, 2018

Google ScholarTM

Check

Altmetric


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