Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs

Naval Research Logistics (NRL)

Volumn 38, Issue 2, 1991, Pages 261-271

  Adiri, I ^a   Frostig, E ^b   Kan, A H G Rinnooy ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84989688255     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I     Document Type: Article

References (8)

1. Single Machine Flow‐Time Scheduling with a Single Breakdown
2. A Solvable Case of the One‐Machine Scheduling Problem with Ready and Due Times
3. Sequencing to Minimize the Weighted Number of Tardy Jobs
4. An n Job One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
5. Stochastic Scheduling with Release Dates and Due Dates
6. Negative Dynamic Programming