Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/33978
Title: Single machine scheduling with truncated job-dependent learning effect
Authors: Wang, XR
Wang, JB
Jin, J
Ji, P 
Keywords: Learning effect
Scheduling
Single machine
Issue Date: 2014
Publisher: Springer
Source: Optimization letters, 2014, v. 8, no. 2, p. 669-677 How to cite?
Journal: Optimization letters 
Abstract: In this paper we consider the single machine scheduling problem with truncated job-dependent learning effect. By the truncated job-dependent learning effect, we mean that the actual job processing time is a function which depends not only on the job-dependent learning effect (i.e., the learning in the production process of some jobs to be faster than that of others) but also on a control parameter. The objectives are to minimize the makespan, the total completion time, the total absolute deviation of completion time, the earliness, tardiness and common (slack) due-date penalty, respectively. Several polynomial time algorithms are proposed to optimally solve the problems with the above objective functions.
URI: http://hdl.handle.net/10397/33978
ISSN: 1862-4472
EISSN: 1862-4480
DOI: 10.1007/s11590-012-0579-0
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

10
Last Week
0
Last month
0
Citations as of Sep 10, 2017

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Sep 12, 2017

Page view(s)

41
Last Week
1
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.