Effective dynamic dispatching rule and constructive heuristic for solving single-machine scheduling problems with a common due window

2016 ◽  
Vol 55 (6) ◽  
pp. 1707-1719 ◽  
Author(s):  
Kuo-Ching Ying ◽  
Shih-Wei Lin ◽  
Chung-Cheng Lu
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Dispatching Rule ◽  
Constructive Heuristic ◽  
Effective Dynamic ◽  
Dynamic Dispatching ◽  
Due Window ◽  
Machine Scheduling Problems

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.

scholarly journals Price of fairness in two-agent single-machine scheduling problems

2019 ◽  
Vol 276 (1) ◽  
pp. 79-87 ◽  
Author(s):  
Alessandro Agnetis ◽  
Bo Chen ◽  
Gaia Nicosia ◽  
Andrea Pacifici
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Machine Scheduling Problems
Sign in / Sign up

Export Citation Format

Share Document