Using short-term memory to minimize the weighted number of late jobs on a single machine

2003 ◽  
Vol 148 (3) ◽  
pp. 591-603 ◽  
Author(s):  
Laurent Péridy ◽  
Éric Pinson ◽  
David Rivreau
Keyword(s):  
Single Machine ◽  
Short Term Memory ◽  
Short Term ◽  
Term Memory ◽  
Weighted Number ◽  
Number Of Late Jobs ◽  
Late Jobs

A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair

1988 ◽  
Vol 2 (1) ◽  
pp. 41-49 ◽  
Author(s):  
Michael Pinedo ◽  
Elias Rammouz
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Stochastic Scheduling ◽  
Weighted Sum ◽  
Due Dates ◽  
Objective Functions ◽  
Weighted Number ◽  
Number Of Late Jobs ◽  
Late Jobs ◽  
Completion Times

This paper considers a single machine and n jobs. The machine is subject to breakdown and repair. Job j has a weight wj, a random processing time Xj, and is available for processing from a random time Rj on. The jobs may be subject to precedence constraints. We are interested in optimal policies that minimize the following objective functions: (i) the weighted sum of the completion times; (ii) the weighted sum of an exponential function of the completion times; and (iii) the weighted number of late jobs having due dates.

Sign in / Sign up

Export Citation Format

Share Document