Abstract
Completion time variance is an important Quality of Service measure for service providers while clients' perceived importance on such service stability and predictability may be different. In this research we considered the job scheduling problem of minimizing weighted completion time variance in an identical parallel server environment. Given the NP-complete nature of the problem, heuristics are developed to provide sub-optimal solutions with reasonable computational efforts. Computational tests are performed to illustrate the effectiveness of proposed heuristics.
| Original language | English (US) |
|---|---|
| Title of host publication | 61st Annual IIE Conference and Expo Proceedings |
| Publisher | Institute of Industrial Engineers |
| State | Published - 2011 |
| Event | 61st Annual Conference and Expo of the Institute of Industrial Engineers - Reno, NV, United States Duration: May 21 2011 → May 25 2011 |
Other
| Other | 61st Annual Conference and Expo of the Institute of Industrial Engineers |
|---|---|
| Country/Territory | United States |
| City | Reno, NV |
| Period | 5/21/11 → 5/25/11 |
Keywords
- Heuristics
- Job scheduling
- Quality of service
- Weighted completion time variance
ASJC Scopus subject areas
- Industrial and Manufacturing Engineering