Job sequencing with one common and multiple secondary resources: An A⁎/Beam Search based anytime algorithm

, &
Artificial Intelligence 277 (C):103173 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2019.103173

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Potential-based bounded-cost search and Anytime Non-Parametric A ⁎.Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah & Ken Goldberg - 2014 - Artificial Intelligence 214 (C):1-25.
Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems.Anup K. Sen & Amitava Bagchi - 1996 - Artificial Intelligence 86 (1):43-73.
A complete anytime algorithm for number partitioning.Richard E. Korf - 1998 - Artificial Intelligence 106 (2):181-203.
Anytime search in dynamic graphs.Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz & Sebastian Thrun - 2008 - Artificial Intelligence 172 (14):1613-1643.
Anytime heuristic search for partial satisfaction planning.J. Benton, Minh Do & Subbarao Kambhampati - 2009 - Artificial Intelligence 173 (5-6):562-592.
An anytime algorithm for constrained stochastic shortest path problems with deterministic policies.Sungkweon Hong & Brian C. Williams - 2023 - Artificial Intelligence 316 (C):103846.
Responsible Artificial Intelligence in Human Resources Technology: An innovative inclusive and fair by design matching algorithm for job recruitment purposes.Sebastien Delecraz, Loukman Eltarr, Martin Becuwe, Henri Bouxin, Nicolas Boutin & Olivier Oullier - 2022 - Journal of Responsible Technology 11:100041.
Explorative anytime local search for distributed constraint optimization.Roie Zivan, Steven Okamoto & Hilla Peled - 2014 - Artificial Intelligence 212 (C):1-26.
Distributed extended beam search for quantitative model checking.Anton J. Wijs & Bert Lisser - 2007 - In A. Lomuscio & S. Edelkamp (eds.), Model Checking and Artificial Intelligence. Springer. pp. 166--184.
A generalised quiescence search algorithm.Don F. Beal - 1990 - Artificial Intelligence 43 (1):85-98.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,417,674)

6 months
5 (#1,038,502)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Heuristic search viewed as path finding in a graph.Ira Pohl - 1970 - Artificial Intelligence 1 (3-4):193-204.

Add more references