Assigning suppliers to meet a deadline

Liat Cohen, Tal Grinshpoun, Roni Stern

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019
EditorsPavel Surynek, William Yeoh
PublisherAAAI press
Pages170-171
Number of pages2
ISBN (Electronic)9781577358084
StatePublished - 1 Jan 2019
Event12th International Symposium on Combinatorial Search, SoCS 2019 - Napa, United States
Duration: 16 Jul 201917 Jul 2019

Publication series

NameProceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019

Conference

Conference12th International Symposium on Combinatorial Search, SoCS 2019
Country/TerritoryUnited States
CityNapa
Period16/07/1917/07/19

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this