AnnJob, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

1968 ◽  
Vol 15 (1) ◽  
pp. 102-109 ◽  
Author(s):  
J. Michael Moore
Keyword(s):  
Sequencing Algorithm ◽  
Number Of Late Jobs ◽  
One Machine ◽  
Late Jobs

A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model

1991 ◽  
Vol 5 (3) ◽  
pp. 349-354 ◽  
Author(s):  
Esther Frostig
Keyword(s):  
Single Machine ◽  
Random Variables ◽  
Stochastic Scheduling ◽  
Independent Random Variables ◽  
Processing Times ◽  
Optimal Policies ◽  
Number Of Late Jobs ◽  
One Machine ◽  
Late Jobs ◽  
Weighted Flowtime

This paper considers scheduling n jobs on one machine to minimize the expected weighted flowtime and the number of late jobs. The processing times of the jobs are independent random variables. The machine is subject to failure and repair where the uptimes are exponentially distributed. We find the optimal policies for the preemptive repeat model.

Deteriorating job scheduling to minimize the number of late jobs with setup times

2011 ◽  
Vol 61 (3) ◽  
pp. 782-787 ◽  
Author(s):  
Wen-Chiung Lee ◽  
Jian-Bang Lin ◽  
Yau-Ren Shiau
Keyword(s):  
Job Scheduling ◽  
Setup Times ◽  
Deteriorating Job ◽  
Number Of Late Jobs ◽  
Late Jobs
Sign in / Sign up

Export Citation Format

Share Document