Name
Abstract | ||
|---|---|---|
Falling across the problem of the unforeseen congested events in the logistic transportation, we build the online vehicle scheduling model with the recoverable congested vertices in this paper. Our optimization objective minimizes the total time of online scheduling. Considering the dynamic occurrence characteristics of the congested vertices one by one, we first introduce three online scheduling strategies, i. e., Greedy Strategy, Reposition Strategy, and Waiting Strategy, and analyze the advantages and disadvantages of competitive performances of the three strategies. Then we propose the Simple Choice Strategy. By competitive performance analysis, we think that the Simple Choice Strategy could be an optimal scheduling scheme for online vehicle transportation. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11600930_57 | WINE |
Keywords | Field | DocType |
online vehicle scheduling model,waiting strategy,reposition strategy,greedy strategy,online algorithm,vehicle scheduling problem,congested vertex,optimal scheduling scheme,simple choice strategy,online scheduling,time objective,online vehicle transportation,online scheduling strategy,scheduling problem | Online algorithm,Mathematical optimization,Job shop scheduling,Fair-share scheduling,Scheduling (computing),Computer science,Operations research,Two-level scheduling,Dynamic priority scheduling,Competitive analysis,The Internet | Conference |
Volume | ISSN | ISBN |
3828 | 0302-9743 | 3-540-30900-4 |
Citations | PageRank | References |
1 | 0.40 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maolin Hu | 1 | 25 | 4.31 |
| Yinfeng Xu | 2 | 1636 | 108.18 |
| Wei-Jun Xu | 3 | 154 | 14.56 |