Using flexible crossdock schedules to face truck arrivals uncertainty
Overview & Synopsis
This paper discusses the use of robust schedules for facing uncertainty arising in crossdock truck scheduling problems. Groups of permutable operations bring sequential flexibility in the schedule, allowing to deal with late or early truck arrivals as the total order and the starting times can be determined in a reactive manner. We focus on the evaluation of a robust schedule considering both the worst maximal lateness of the trucks and the worst total sojourn time of the pallets. We also show how a robust schedule can be evaluated online, taking into account the actual arrival times of the trucks.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Using flexible crossdock schedules to face truck arrivals uncertainty |
|---|---|
| Author / Organization | Quentin Fabry, Lotte Berghman, Cyril Briand |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2021 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-207371 |
| Original Source Link | Visit Source Page on hal.science » |