TY - GEN
T1 - Assigning suppliers to meet a deadline
AU - Cohen, Liat
AU - Grinshpoun, Tal
AU - Stern, Roni
N1 - Publisher Copyright:
Copyright © 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85086859265&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85086859265
T3 - Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
SP - 170
EP - 171
BT - Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
A2 - Surynek, Pavel
A2 - Yeoh, William
T2 - 12th International Symposium on Combinatorial Search, SoCS 2019
Y2 - 16 July 2019 through 17 July 2019
ER -