Informedness vs. Computational Cost of Heuristics in Iterative Repair Scheduling
Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence. Planning. Pages 1416-1421.
Abstract
This paper explores the tradeoff between the informedness and computational cost of two repair heuristics used in the GERRY scheduling system. GERRY performs rescheduling with constraint- based iterative repair, a technique that starts with a complete but possibly flawed schedule and iteratively improves it by using constraint knowledge within repairs. We show empirically how each repair technique performs on a set of random and real-world problems, and conjecture when less "informedness" will help speed convergence to solution .
@inproceedings{ijcai1993p196,
title = {Informedness vs. Computational Cost of Heuristics in Iterative Repair Scheduling},
author = {Zweben, Monte and Davis, Eugene and Daun, Brian and Deale, Michael},
booktitle = {Proceedings of the Thirteenth International Joint Conference on
Artificial Intelligence, {IJCAI-93}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ruzena Bajcsy},
pages = {1416--1421},
year = {1993},
note = {Planning},
url = {https://ijcai.org/proceedings/1993/196},
}
TY - CPAPER TI - Informedness vs. Computational Cost of Heuristics in Iterative Repair Scheduling AU - Zweben, Monte AU - Davis, Eugene AU - Daun, Brian AU - Deale, Michael T2 - Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93 PB - International Joint Conferences on Artificial Intelligence PY - 1993 SP - 1416 EP - 1421 UR - https://ijcai.org/proceedings/1993/196 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
