Robust Scheduling with Logic-Based Benders Decomposition
| Autor: | Alan Scheller-Wolf, Aliza Heching, Elvin Coban, John N. Hooker |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization 021103 operations research Computer science business.industry Tardiness 0211 other engineering and technologies Scheduling (production processes) Robust optimization 02 engineering and technology Benders' decomposition Set (abstract data type) 020901 industrial engineering & automation Software Decomposition (computer science) business Integer programming |
| Zdroj: | Operations Research Proceedings ISBN: 9783319286952 OR |
| DOI: | 10.1007/978-3-319-28697-6_15 |
| Popis: | We study project scheduling at a large IT services delivery center in which there are unpredictable delays. We apply robust optimization to minimize tardiness while informing the customer of a reasonable worst-case completion time, based on empirically determined uncertainty sets. We introduce a new solution method based on logic-based Benders decomposition. We show that when the uncertainty set is polyhedral, the decomposition simplifies substantially, leading to a model of tractable size. Preliminary computational experience indicates that this approach is superior to a mixed integer programming model solved by state-of-the-art software. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|