| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143100 | Operations Research Letters | 2007 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Chung-Yee Lee, Gang Yu,