Single-machine scheduling with a sum-of-processing-time based learning effect and deteriorating jobs

2009 ◽  
Vol 45 (3-4) ◽  
pp. 336-340 ◽  
Author(s):  
Li-Yan Wang ◽  
Ji-Bo Wang ◽  
Dan Wang ◽  
Na Yin ◽  
Xue Huang ◽  
...  
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Learning Effect ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Single Machine Scheduling

SINGLE MACHINE SCHEDULING WITH A LEARNING EFFECT AND A RATE-MODIFYING ACTIVITY

2011 ◽  
Vol 28 (04) ◽  
pp. 511-521 ◽  
Author(s):  
CHUANLI ZHAO ◽  
HENGYONG TANG
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Learning Effect ◽  
Window Size ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Polynomial Time Algorithms ◽  
Due Window ◽  
Machine Scheduling Problems

In the paper, single machine scheduling problems with a learning effect and a rate-modifying activity are considered. Under the learning effect, the processing time of a job is a decreasing function of its position in the sequence. The rate-modifying activity is an event that can change the speed of the machine, and hence the processing time of jobs after the activity. The following objective functions are considered: the makespan, the total earliness, tardiness and completion time penalty, and the total earliness, tardiness, due-window starting time and due-window size penalty. Polynomial time algorithms are proposed to optimally solve the problems.

Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times

2015 ◽  
Vol 32 (05) ◽  
pp. 1550033 ◽  
Author(s):  
Xin-Jun Li ◽  
Jian-Jun Wang ◽  
Xue-Ru Wang
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Waiting Times ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Optimal Sequence ◽  
Processing Times ◽  
Convex Resource Allocation

This paper considers single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times, i.e., the processing time of a job is a function of its starting time, its position in a sequence and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately to minimize a cost function containing makespan, total completion (waiting) time, total absolute differences in completion (waiting) times and total resource cost. It is proved that the problem can be solved in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document