Agent-based shop floor schseduling

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Shop floor scheduling problem is known for a long time and is considered an academic exercise for solving by constraint solvers or for linear solvers. In a small production scale it can be solved easily. For a large scale production, the problem becomes too large and we need major heuristics to solve it. We introduce a way to decompose the major problem into smaller sub-problems and to quickly find a satisfying solution using human thinking inspired heuristics. The results combines scalable agent based solution and multiple constraint solver instances running in parallel.

Cite

CITATION STYLE

APA

Klima, M., Gregor, J., Harcuba, O., & Marik, V. (2017). Agent-based shop floor schseduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10444 LNAI, pp. 24–36). Springer Verlag. https://doi.org/10.1007/978-3-319-64635-0_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free