scholarly journals Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects

2013 ◽  
Vol 37 (7) ◽  
pp. 5444-5451 ◽  
Author(s):  
Lixin Shen ◽  
Yu-Bin Wu
Keyword(s):  
Single Machine ◽  
General Position ◽  
Time Dependent ◽  
Learning Effects ◽  
Delivery Times ◽  
Sequence Dependent ◽  
Dependent Learning

Some scheduling problems with general position-dependent and time-dependent learning effects

2009 ◽  
Vol 179 (14) ◽  
pp. 2416-2425 ◽  
Author(s):  
Yunqiang Yin ◽  
Dehua Xu ◽  
Kaibiao Sun ◽  
Hongxing Li
Keyword(s):  
General Position ◽  
Time Dependent ◽  
Learning Effects ◽  
Scheduling Problems ◽  
Dependent Learning

scholarly journals Minimizing Total Weighted Completion Time on Single Machine with Past-Sequence-Dependent Setup Times and Exponential Time-Dependent and Position-Dependent Learning Effects

2009 ◽  
Vol 2009 ◽  
pp. 1-10 ◽  
Author(s):  
Kaibiao Sun ◽  
Hongxing Li
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Processing Time ◽  
Setup Times ◽  
Time Dependent ◽  
Total Weighted Completion Time ◽  
Learning Effects ◽  
Exponential Time ◽  
Weighted Completion Time ◽  
Dependent Learning

This paper addresses a single-machine problem in which the past-sequence-dependent (p-s-d) setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup times are proportional to the length of the already processed jobs. The aim is to minimize the total weighted completion time, this is an NP-hard problem. Under certain conditions, it is shown that the classical WSPT rule is optimal for the problem.

Sign in / Sign up

Export Citation Format

Share Document