Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

2013 ◽  
Vol 40 (4) ◽  
pp. 1100-1108 ◽  
Author(s):  
Mehdi Iranpoor ◽  
S.M.T. Fatemi Ghomi ◽  
M. Zandieh
Keyword(s):  
Machine Scheduling ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Stochastic Processing ◽  
Stochastic Processing Times

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

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.

Single Machine Scheduling and Due Date Assignment with Past-Sequence-Dependent Delivery Times and Position-Dependent Processing Times

2014 ◽  
Vol 1006-1007 ◽  
pp. 498-503 ◽  
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Dynamic Programming Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Programming Algorithm ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Tardy Jobs

This paper considers single machine scheduling and due date assignment 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 depends 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 analyze the problems with two different due date assignment methods and conclude that the problems are polynomial time solvable. We provide a dynamic programming algorithm with O(n3) times for the problems.

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
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Model Base ◽  
Processing Times ◽  
Robust Model ◽  
Stochastic Processing ◽  
Stochastic Processing Times

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.

Bi-objective single machine scheduling problem with stochastic processing times

Top ◽  
2014 ◽  
Vol 23 (1) ◽  
pp. 275-297 ◽  
Author(s):  
Ali Salmasnia ◽  
Mostafa Khatami ◽  
Reza Baradaran Kazemzadeh ◽  
Seyed Hessameddin Zegordi
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Processing Times ◽  
Stochastic Processing ◽  
Stochastic Processing Times

Unrelated Machine Scheduling with Stochastic Processing Times

2016 ◽  
Vol 41 (3) ◽  
pp. 851-864 ◽  
Author(s):  
Martin Skutella ◽  
Maxim Sviridenko ◽  
Marc Uetz
Keyword(s):  
Machine Scheduling ◽  
Processing Times ◽  
Stochastic Processing ◽  
Stochastic Processing Times
Sign in / Sign up

Export Citation Format

Share Document