Publication

On the optimal input allocation of discrete-event systems with dynamic input sequence

Tri Cahyono, R. & Jayawardhana, B., Mar-2020, 58th IEEE Conference on Decision and Control. IEEE, p. 1062-1067 6 p. 9029828

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

APA

Tri Cahyono, R., & Jayawardhana, B. (2020). On the optimal input allocation of discrete-event systems with dynamic input sequence. In 58th IEEE Conference on Decision and Control (pp. 1062-1067). [9029828] IEEE. https://doi.org/10.1109/CDC40024.2019.9029828

Author

Tri Cahyono, Rully ; Jayawardhana, Bayu. / On the optimal input allocation of discrete-event systems with dynamic input sequence. 58th IEEE Conference on Decision and Control. IEEE, 2020. pp. 1062-1067

Harvard

Tri Cahyono, R & Jayawardhana, B 2020, On the optimal input allocation of discrete-event systems with dynamic input sequence. in 58th IEEE Conference on Decision and Control., 9029828, IEEE, pp. 1062-1067. https://doi.org/10.1109/CDC40024.2019.9029828

Standard

On the optimal input allocation of discrete-event systems with dynamic input sequence. / Tri Cahyono, Rully; Jayawardhana, Bayu.

58th IEEE Conference on Decision and Control. IEEE, 2020. p. 1062-1067 9029828.

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

Vancouver

Tri Cahyono R, Jayawardhana B. On the optimal input allocation of discrete-event systems with dynamic input sequence. In 58th IEEE Conference on Decision and Control. IEEE. 2020. p. 1062-1067. 9029828 https://doi.org/10.1109/CDC40024.2019.9029828


BibTeX

@inproceedings{45a1476593b24c8caf00f5edef2e7a4c,
title = "On the optimal input allocation of discrete-event systems with dynamic input sequence",
abstract = "We study in this paper an optimal input allocation problem for a class of discrete-event systems with dynamic input sequence (DESDIS). In this case, the input space is defined by a finite sequence whose members will be removed from the sequence in the next event if they are used for the current event control input. Correspondingly, the sequence can be replenished with new members at every discrete-event time. The allocation problem for such systems describes many scheduling and allocation problems in logistics and manufacturing systems and leads to a combinatorial optimization problem. We show that for a linear DESDIS given by a Markov chain and for a particular cost function given by the sum of its state trajectories, the allocation problem is solved by re-ordering the input sequence at any given event time based on the potential contribution of the members in the current sequence to the present state of the system. In particular, the control input can be obtained by the minimization/maximization of the present input sequence only.",
author = "{Tri Cahyono}, Rully and Bayu Jayawardhana",
year = "2020",
month = mar,
doi = "10.1109/CDC40024.2019.9029828",
language = "English",
isbn = "978-1-7281-1398-2",
pages = "1062--1067",
booktitle = "58th IEEE Conference on Decision and Control",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - On the optimal input allocation of discrete-event systems with dynamic input sequence

AU - Tri Cahyono, Rully

AU - Jayawardhana, Bayu

PY - 2020/3

Y1 - 2020/3

N2 - We study in this paper an optimal input allocation problem for a class of discrete-event systems with dynamic input sequence (DESDIS). In this case, the input space is defined by a finite sequence whose members will be removed from the sequence in the next event if they are used for the current event control input. Correspondingly, the sequence can be replenished with new members at every discrete-event time. The allocation problem for such systems describes many scheduling and allocation problems in logistics and manufacturing systems and leads to a combinatorial optimization problem. We show that for a linear DESDIS given by a Markov chain and for a particular cost function given by the sum of its state trajectories, the allocation problem is solved by re-ordering the input sequence at any given event time based on the potential contribution of the members in the current sequence to the present state of the system. In particular, the control input can be obtained by the minimization/maximization of the present input sequence only.

AB - We study in this paper an optimal input allocation problem for a class of discrete-event systems with dynamic input sequence (DESDIS). In this case, the input space is defined by a finite sequence whose members will be removed from the sequence in the next event if they are used for the current event control input. Correspondingly, the sequence can be replenished with new members at every discrete-event time. The allocation problem for such systems describes many scheduling and allocation problems in logistics and manufacturing systems and leads to a combinatorial optimization problem. We show that for a linear DESDIS given by a Markov chain and for a particular cost function given by the sum of its state trajectories, the allocation problem is solved by re-ordering the input sequence at any given event time based on the potential contribution of the members in the current sequence to the present state of the system. In particular, the control input can be obtained by the minimization/maximization of the present input sequence only.

U2 - 10.1109/CDC40024.2019.9029828

DO - 10.1109/CDC40024.2019.9029828

M3 - Conference contribution

SN - 978-1-7281-1398-2

SP - 1062

EP - 1067

BT - 58th IEEE Conference on Decision and Control

PB - IEEE

ER -

ID: 96630224