Abstract
We provide optimal algorithms to solve a new scheduling problem in which there is a possibility that a disruption will happen at a particular time and last for a period of time with a certain probability. The objective functions are the expected total weighted completion times and the expected maximum tardiness, respectively.
| Original language | English |
|---|---|
| Pages (from-to) | 541-548 |
| Number of pages | 8 |
| Journal | Operations Research Letters |
| Volume | 35 |
| Issue number | 4 |
| Publication status | Published - Jul 2007 |
Keywords
- Disruption management
- Machine scheduling