Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem
| Autor: | André Renato Villela da Silva, Luiz Satoru Ochi |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Earliest deadline first scheduling
Rate-monotonic scheduling Mathematical optimization Job shop scheduling Computer science Scheduling (production processes) Evolutionary algorithm Schedule (project management) Dynamic priority scheduling Flow shop scheduling Round-robin scheduling Fair-share scheduling Deadline-monotonic scheduling Multiprocessor scheduling Genetic algorithm scheduling Nurse scheduling problem Two-level scheduling Lottery scheduling Heuristics |
| Zdroj: | Hybrid Metaheuristics ISBN: 9783642160530 Hybrid Metaheuristics |
| DOI: | 10.1007/978-3-642-16054-7_6 |
| Popis: | Dynamic Resource-Constrained Project Scheduling Problem (DRCPSP) is a scheduling problem that works with an uncommon kind of resources: the Dynamic Resources. They increase and decrease in quantity according to the activated tasks and are not bounded like other project scheduling problems. This paper presents a new mathematical formulation for DRCPSP as well as two hybrid heuristics merging an evolutionary algorithm with an exact approach. Computational results show that both hybrid heuristics present better results than the state-of-the-art algorithm for DRCPSP does. The proposed formulation also provides better bounds. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|