Dynamic transport scheduling under multiple resource constraints
| Autor: | M.C. van der Heijden, A. van Harten, Mark Ebben |
|---|---|
| Přispěvatelé: | Faculty of Behavioural, Management and Social Sciences |
| Rok vydání: | 2005 |
| Předmět: |
Schedule
Mathematical optimization Information Systems and Management General Computer Science Job shop scheduling Computer science Heuristic Scheduling Real-time computing Resource constraints Transportation Management Science and Operations Research Industrial and Manufacturing Engineering Bottleneck IR-77405 Scheduling (computing) METIS-207190 Modeling and Simulation Heuristics Discrete event simulation Simulation |
| Zdroj: | European journal of operational research, 2005(167), 320-335. Elsevier |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/j.ejor.2004.03.020 |
| Popis: | This paper presents a heuristic for the dynamic vehicle scheduling problem with multiple resource capacity constraints. In the envisaged application, an automated transport system using Automated Guided Vehicles, bottleneck resources are (1) vehicles, (2) docks for loading/unloading, (3) vehicle parking places, and (4) load storage space. This problem is hard, because interrelated activities (loading, transportation, unloading) at several geographical locations have to be scheduled under multiple resource constraints, where the bottleneck resource varies over time. Besides, the method should be suitable for real-time planning. We developed a dedicated serial scheduling method and analyzed its dynamic behavior using discrete event simulation. We found that our method is very well able to find good vehicle schedules satisfying all resource constraints. For comparison, we used a simple approach where we left out the resource constraints and extended the processing times by statistically estimated waiting times to account for finite capacities. We found that our newly designed method finds better schedules in terms of service levels. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect