Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32337
Title: Scheduling with job release dates, delivery times and preemption penalties
Authors: Liu, Z
Cheng, TC 
Keywords: Approximation scheme
Preemption penalty
Scheduling
Setup time
Issue Date: 2002
Source: Information processing letters, 2002, v. 82, no. 2, p. 107-111 How to cite?
Journal: Information Processing Letters 
Abstract: The single-machine preemptive scheduling problem with job release dates, delivery times and preemption penalties was discussed. Such problems require a job-dependent setup to take place each time a job is started. It was proved that the problem is strongly NP-hard. A dynamic programming algorithm and a polynomial time approximation scheme were also presented for solving the problem.
URI: http://hdl.handle.net/10397/32337
ISSN: 0020-0190
DOI: 10.1016/S0020-0190(01)00251-4
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

27
Last Week
0
Last month
0
Citations as of Oct 9, 2018

WEB OF SCIENCETM
Citations

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

Page view(s)

78
Last Week
3
Last month
Citations as of Oct 15, 2018

Google ScholarTM

Check

Altmetric


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