2009
DOI: 10.1016/j.cie.2008.07.019
|View full text |Cite
|
Sign up to set email alerts
|

Solution algorithms for the makespan minimization problem with the general learning model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
16
0
1

Year Published

2009
2009
2013
2013

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 58 publications
(19 citation statements)
references
References 19 publications
0
16
0
1
Order By: Relevance
“…identical processing time on each machine and an increasing series of dominating machines. Other types of jobs with learning effects have also been discussed; the reader is referred to papers by Cheng, Wu, and Lee (2008a), Wu and Lee (2008), Janiak, Janiak, Rudek, and Wielgus (2008), Wang (2008aWang ( , 2008b, and Wang (2009b). A survey on this line of the scheduling research could be found in Bachman and Janiak (2004), and Biskup (2008).…”
Section: Introductionmentioning
confidence: 98%
“…identical processing time on each machine and an increasing series of dominating machines. Other types of jobs with learning effects have also been discussed; the reader is referred to papers by Cheng, Wu, and Lee (2008a), Wu and Lee (2008), Janiak, Janiak, Rudek, and Wielgus (2008), Wang (2008aWang ( , 2008b, and Wang (2009b). A survey on this line of the scheduling research could be found in Bachman and Janiak (2004), and Biskup (2008).…”
Section: Introductionmentioning
confidence: 98%
“…types of the single-machine problem remain polynomially solvable. Since then, scheduling with the effect of learning has attracted researchers' attention in the last decade (see, e.g., Bachman and Janiak [1], Cheng et al [7,5], Janiak and Rudek [10,11,13,14], Janiak et al [12], Kuo and Yang [15,16], Lee et al [18], Lee and Wu [19], Mosheiov [21], Mosheiov and Sidney [22], Wang [25], Wu and Lee [26]). Mosheiov and Sidney [22] first considered job-dependent learning effects by assuming that the actual processing time of job J i is p ir = p i r a i if it is scheduled in the rth position of a sequence, where a i 0 is the job-dependent learning index of job J i .…”
Section: Introductionmentioning
confidence: 98%
“…He developed a mathematical programming model for the problem which belongs to NP-hard class. Other types of jobs with learning effects have also been discussed; the reader is referred to papers by Cheng et al (2008aCheng et al ( , 2008b, Wu and Lee (2008), Rudek (2008a, 2008b), Janiak et al (2009), Mosheiov (2008, Mosheiov and Sarig (2008), Cheng et al (2009), Lee and Wu (2009), Wu and Liu (2010), Wang et al (2010), Wu et al (2011), Wang andWang (2011a, 2011b). Extensive surveys of different scheduling models and problems involving jobs with learning effects can be found in Bachman and Janiak (2004) and Biskup (2008).…”
Section: Introductionmentioning
confidence: 98%