Scheduling jobs with stochastic processing times and due dates to minimize total tardiness

1992 ◽  
Vol 8 (3) ◽  
pp. 529-541 ◽  
Author(s):  
Weiss Gideon
Keyword(s):  
Total Tardiness ◽  
Due Dates ◽  
Processing Times ◽  
Stochastic Processing ◽  
Stochastic Processing Times

On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines

1995 ◽  
Vol 27 (03) ◽  
pp. 821-839 ◽  
Author(s):  
Gideon Weiss
Keyword(s):  
Single Machine ◽  
Parallel Machines ◽  
Preemptive Scheduling ◽  
Priority Rule ◽  
Priority Rules ◽  
Holding Costs ◽  
Processing Times ◽  
Stochastic Processing ◽  
Stochastic Processing Times

We consider scheduling a batch of jobs with stochastic processing times on single or parallel machines, with the objective of minimizing the expected holding costs. Preemption of jobs is allowed, and the holding costs of preempted jobs may depend on the stage of completion. We provide a new proof of the optimality of a Gittins priority rule for the single machine and use the same proof to show that the Gittins priority rule is nearly optimal for parallel machines.

On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machines

1995 ◽  
Vol 27 (3) ◽  
pp. 821-839 ◽  
Author(s):  
Gideon Weiss
Keyword(s):  
Single Machine ◽  
Parallel Machines ◽  
Preemptive Scheduling ◽  
Priority Rule ◽  
Priority Rules ◽  
Holding Costs ◽  
Processing Times ◽  
Stochastic Processing ◽  
Stochastic Processing Times

We consider scheduling a batch of jobs with stochastic processing times on single or parallel machines, with the objective of minimizing the expected holding costs. Preemption of jobs is allowed, and the holding costs of preempted jobs may depend on the stage of completion. We provide a new proof of the optimality of a Gittins priority rule for the single machine and use the same proof to show that the Gittins priority rule is nearly optimal for parallel machines.

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.

Sign in / Sign up

Export Citation Format

Share Document