Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming

Balázs Csanád Csáji, L. Monostori

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The paper investigates a stochastic production scheduling problem with unrelated parallel machines. A closed-loop scheduling technique is presented that on-line controls the production process. To achieve this, the scheduling problem is reformulated as a special Markov Decision Process. A near-optimal control policy of the resulted MDP is calculated in a homogeneous multi-agent system. Each agent applies a trial-based approximate dynamic programming method. Different cooperation techniques to distribute the value function computation among the agents are described. Finally, some benchmark experimental results are shown.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages388-397
Number of pages10
Volume3690 LNAI
Publication statusPublished - 2005
Event4th International Central and Eastern European Conference on Multi-Agent Systems, CEEMAS 2005 - Budapest, Hungary
Duration: Sep 15 2005Sep 17 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3690 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Central and Eastern European Conference on Multi-Agent Systems, CEEMAS 2005
CountryHungary
CityBudapest
Period9/15/059/17/05

Fingerprint

Approximate Dynamic Programming
Benchmarking
Markov Chains
Production/scheduling
Dynamic programming
Scheduling Problem
Scheduling
Stochastic Scheduling
Markov Decision Process
Parallel Machines
Control Policy
Optimal Policy
Value Function
Closed-loop
Multi-agent Systems
Optimal Control
Benchmark
Multi agent systems
Experimental Results

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Csáji, B. C., & Monostori, L. (2005). Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3690 LNAI, pp. 388-397). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3690 LNAI).

Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming. / Csáji, Balázs Csanád; Monostori, L.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3690 LNAI 2005. p. 388-397 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3690 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Csáji, BC & Monostori, L 2005, Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3690 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3690 LNAI, pp. 388-397, 4th International Central and Eastern European Conference on Multi-Agent Systems, CEEMAS 2005, Budapest, Hungary, 9/15/05.
Csáji BC, Monostori L. Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3690 LNAI. 2005. p. 388-397. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Csáji, Balázs Csanád ; Monostori, L. / Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3690 LNAI 2005. pp. 388-397 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{64af21069304466e91b5530feb418281,
title = "Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming",
abstract = "The paper investigates a stochastic production scheduling problem with unrelated parallel machines. A closed-loop scheduling technique is presented that on-line controls the production process. To achieve this, the scheduling problem is reformulated as a special Markov Decision Process. A near-optimal control policy of the resulted MDP is calculated in a homogeneous multi-agent system. Each agent applies a trial-based approximate dynamic programming method. Different cooperation techniques to distribute the value function computation among the agents are described. Finally, some benchmark experimental results are shown.",
author = "Cs{\'a}ji, {Bal{\'a}zs Csan{\'a}d} and L. Monostori",
year = "2005",
language = "English",
isbn = "354029046X",
volume = "3690 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "388--397",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Stochastic reactive production scheduling by multi-agent based asynchronous approximate dynamic programming

AU - Csáji, Balázs Csanád

AU - Monostori, L.

PY - 2005

Y1 - 2005

N2 - The paper investigates a stochastic production scheduling problem with unrelated parallel machines. A closed-loop scheduling technique is presented that on-line controls the production process. To achieve this, the scheduling problem is reformulated as a special Markov Decision Process. A near-optimal control policy of the resulted MDP is calculated in a homogeneous multi-agent system. Each agent applies a trial-based approximate dynamic programming method. Different cooperation techniques to distribute the value function computation among the agents are described. Finally, some benchmark experimental results are shown.

AB - The paper investigates a stochastic production scheduling problem with unrelated parallel machines. A closed-loop scheduling technique is presented that on-line controls the production process. To achieve this, the scheduling problem is reformulated as a special Markov Decision Process. A near-optimal control policy of the resulted MDP is calculated in a homogeneous multi-agent system. Each agent applies a trial-based approximate dynamic programming method. Different cooperation techniques to distribute the value function computation among the agents are described. Finally, some benchmark experimental results are shown.

UR - http://www.scopus.com/inward/record.url?scp=33646130420&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646130420&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33646130420

SN - 354029046X

SN - 9783540290469

VL - 3690 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 388

EP - 397

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -