scholarly journals Minimizing Total Costs in One-Machine Scheduling

1975 ◽  
Vol 23 (5) ◽  
pp. 908-927 ◽  
Author(s):  
A. H. G. Rinnooy Kan ◽  
B. J. Lageweg ◽  
J. K. Lenstra
2018 ◽  
Vol 26 (1) ◽  
pp. 49-63 ◽  
Author(s):  
Carlos Mencía ◽  
María R. Sierra ◽  
Raúl Mencía ◽  
Ramiro Varela

1994 ◽  
Vol 79 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Sangsu Han ◽  
Hiroaki Ishii ◽  
Susumu Fujii

1993 ◽  
Vol 38 (2) ◽  
pp. 113-129 ◽  
Author(s):  
Imma Curiel ◽  
Jos Potters ◽  
Rajendra Prasad ◽  
Stef Tijs ◽  
Bart Veltman

Author(s):  
A. H. G. Rinnooy Kan ◽  
B. J. Lageweg ◽  
J. K. Lenstra

1991 ◽  
Vol 5 (3) ◽  
pp. 317-331 ◽  
Author(s):  
J. B. G. Frenk

In this paper we consider one-machine scheduling problems with or without a perfect machine and random processing times and derive among other results elimination criteria for different classes of cost functions.


Sign in / Sign up

Export Citation Format

Share Document