Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/35940
Title: Single machine scheduling with sum-of-logarithm-processing-times based deterioration
Authors: Yin, N
Kang, LY
Ji, P 
Wang, JB
Keywords: Scheduling
Single machine
Deteriorating job
Issue Date: 2014
Publisher: Elsevier
Source: Information sciences, 2014, v. 274, p. 303-309 How to cite?
Journal: Information sciences 
Abstract: In this study we consider the single machine scheduling problems with sum-of-logarithmprocessing-times based deterioration, i.e., the actual job processing time is a function of the sum of the logarithm of the processing times of the jobs already processed. We show that even with the introduction of the sum-of-logarithm-processing-times based deterioration to job processing times, single machine makespan minimization problem remain polynomially solvable. But for the total completion time minimization problem, we show that the optimal schedule is not always V-shaped with respect to job normal processing times. Heuristic algorithms and computational results are presented for the total completion time minimization problem.
URI: http://hdl.handle.net/10397/35940
ISSN: 0020-0255
EISSN: 1872-6291
DOI: 10.1016/j.ins.2014.03.004
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

9
Last Week
0
Last month
Citations as of Aug 18, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
Citations as of Aug 12, 2017

Page view(s)

31
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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