Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

Wang, Ji‐Bo; Wang, Dan; Wang, Liyan; Lin, Lin; Yin, Na; Wang, Weiwei

doi:10.1016/j.camwa.2008.09.025

Cited by 75 publications

(25 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, to the best of our knowledge, apart from the recent papers of Kuo and Yang [31], Wang [32], Wang et al [33], it has not been investigated the scheduling models considering the setup times and learning effect at the same time. Kuo and Yang [31] considered single machine scheduling with past-sequence-dependent setup times and job-independent (jobdependent) learning effect.…”

Section: Introductionmentioning

confidence: 93%

“…Wang [32] considered single machine scheduling with past-sequence-dependent setup times and time-dependent learning effect. Wang et al [33] considered single machine scheduling problems with p-s-d setup times and exponential time-dependent learning effect. The phenomena of past-sequence-dependent setup times occurring can be found in many real-life situations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects

Wang

2011

Applied Mathematical Modelling

Self Cite

View full text Add to dashboard Cite

a b s t r a c tIn this paper we consider the single machine past-sequence-dependent (p-s-d) setup times scheduling problems with general position-dependent and time-dependent learning effects. By the general position-dependent and time-dependent learning effects, we mean that the actual processing time of a job is not only a function of the total normal processing times of the jobs already processed, but also a function of the job's scheduled position. The setup times are proportional to the length of the already processed jobs. We consider the following objective functions: the makespan, the total completion time, the sum of the hth (h P 0) power of job completion times, the total lateness, the total weighted completion time, the maximum lateness, the maximum tardiness and the number of tardy jobs. We show that the problems of makespan, the total completion time, the sum of the hth (h P 0) power of job completion times and the total lateness can be solved by the smallest (normal) processing time first (SPT) rule, respectively. We also show that the total weighted completion time minimization problem, the maximum lateness minimization problem, maximum tardiness minimization problem and the number of tardy jobs minimization problem can be solved in polynomial time under certain conditions.

show abstract

Section: Introductionmentioning

confidence: 93%

Section: Introductionmentioning

confidence: 99%

Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects

Wang

2011

Applied Mathematical Modelling

Self Cite

View full text Add to dashboard Cite

show abstract

“…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%

Single-machine scheduling with learning effect and deteriorating jobs

Wang

2009

Computers & Industrial Engineering

Self Cite

View full text Add to dashboard Cite

“…Recently, several researchers have started to consider both the learning effect and past-sequence-dependent setup times simultaneously. For instance, Wang et al [24] studied the exponential time-dependent learning effect. Wang et al [25] considered the Biskup [1] position-based learning effect model and provided the optimal solutions for some single-machine problems.…”

Section: Introductionmentioning

confidence: 99%

A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time

Lee

2011

Computers & Mathematics with Applications

View full text Add to dashboard Cite

a b s t r a c tIn this paper, we study a scheduling model with the consideration of both the learning effect and the setup time. Under the proposed model, the learning effect is a general function of the processing time of jobs already processed and its scheduled position, and the setup time is past-sequence-dependent. We then derive the optimal sequences for two single-machine problems, which are the makespan and the total completion time. Moreover, we showed that the weighted completion time, the maximum lateness, the maximum tardiness, and the total tardiness problems remain polynomially solvable under agreeable conditions.

show abstract

Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times

Cited by 75 publications

References 27 publications

Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects

Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects

Single-machine scheduling with learning effect and deteriorating jobs

A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time

Contact Info

Product

Resources

About