Robust Single Machine Scheduling with Stochastic Processing Times Based on Event Point

2014 ◽  
Vol 668-669 ◽  
pp. 1641-1645
Author(s):  
Xiao Xia He ◽  
Chun Yao ◽  
Qiu Hua Tang

The scheduling of the single machine is of major importance in applications. The focus of this work is to analyze the scheduling problems in single-machine scheduling in the presence of uncertain parameters. By assuming that the processing time is represented by the nominal value plus a perturbation, we propose a robust model base on event point, and we obtain the feasible job sequence with some probability confidence level.

Top ◽  
2014 ◽  
Vol 23 (1) ◽  
pp. 275-297 ◽  
Author(s):  
Ali Salmasnia ◽  
Mostafa Khatami ◽  
Reza Baradaran Kazemzadeh ◽  
Seyed Hessameddin Zegordi

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao

We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.


Sign in / Sign up

Export Citation Format

Share Document