@inproceedings{5a2e54ec9e564839823b7731e738e798,
title = "Assigning suppliers to meet a deadline",
abstract = "In our setting, we consider projects that consist of completing tasks, where each task needs to be executed by a single supplier chosen from a subset of suppliers. The suppliers differ in their execution times, which are stochastically taken from known distributions. The Supplier Assignment for Meeting a Deadline (SAMD) problem is the problem of assigning a supplier to each task in a manner that maximizes the chance to meet some overall project deadline. We propose an A∗-based approach, along with an efficient admissible heuristic function that guarantees an optimal solution for this problem.",
author = "Liat Cohen and Tal Grinshpoun and Roni Stern",
note = "Publisher Copyright: Copyright {\textcopyright} 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 12th International Symposium on Combinatorial Search, SoCS 2019 ; Conference date: 16-07-2019 Through 17-07-2019",
year = "2019",
month = jan,
day = "1",
language = "American English",
series = "Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019",
pages = "170--171",
editor = "Pavel Surynek and William Yeoh",
booktitle = "Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019",
}