A Reinforcement Learning Motivated Algorithm for Process Optimization

Publikationen: Beitrag in FachzeitschriftArtikelForschung(peer-reviewed)

Standard

A Reinforcement Learning Motivated Algorithm for Process Optimization. / Ábrahám, Ábrahám; Auer, Peter; Dósa, György; Dulai, Tibor; Werner-Stark, Ágnes.

in: Periodica Polytechnica Civil Engineering, Jahrgang 63.2019, Nr. 4, 18.12.2019, S. 961-970.

Publikationen: Beitrag in FachzeitschriftArtikelForschung(peer-reviewed)

Harvard

Author

Ábrahám, Ábrahám ; Auer, Peter ; Dósa, György ; Dulai, Tibor ; Werner-Stark, Ágnes. / A Reinforcement Learning Motivated Algorithm for Process Optimization. in: Periodica Polytechnica Civil Engineering. 2019 ; Jahrgang 63.2019, Nr. 4. S. 961-970.

Bibtex - Download

@article{4ba8b54dbef74f8ca3e8e416fc73485b,
title = "A Reinforcement Learning Motivated Algorithm for Process Optimization",
abstract = "In process scheduling problems there are several processes and resources. Any process consists of several tasks, and there may be precedence constraints among them. In our paper we consider a special case, where the precedence constraints form short disjoint (directed) paths. This model occurs frequently in practice, but as far as we know it is considered very rarely in the literature. The goal is to find a good resource allocation (schedule) to minimize the makespan. The problem is known to be strongly NP-hard, and such hard problems are often solved by heuristic methods. We found only one paper which is closely related to our topic, this paper proposes the heuristic method HH. We propose a new heuristic called QLM which is inspired by reinforcement learning methods from the area of machine learning. As we did not find appropriate benchmark problems for the investigated model. We have created such inputs and we have made exhaustive comparisons, comparing the results of HH and QLM, and an exact solver using CPLEX. We note that a heuristic method can give a {"}near optimal{"} solution very fast while an exact solver provides the optimal solution, but it may need a huge amount of time to find it. In our computational evaluation we experienced that our heuristic is more effective than HH and finds the optimal solution in many cases and very fast.",
author = "{\'A}brah{\'a}m {\'A}brah{\'a}m and Peter Auer and Gy{\"o}rgy D{\'o}sa and Tibor Dulai and {\'A}gnes Werner-Stark",
year = "2019",
month = dec,
day = "18",
doi = "10.3311/PPci.14295",
language = "English",
volume = "63.2019",
pages = "961--970",
journal = "Periodica Polytechnica Civil Engineering",
number = "4",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - A Reinforcement Learning Motivated Algorithm for Process Optimization

AU - Ábrahám, Ábrahám

AU - Auer, Peter

AU - Dósa, György

AU - Dulai, Tibor

AU - Werner-Stark, Ágnes

PY - 2019/12/18

Y1 - 2019/12/18

N2 - In process scheduling problems there are several processes and resources. Any process consists of several tasks, and there may be precedence constraints among them. In our paper we consider a special case, where the precedence constraints form short disjoint (directed) paths. This model occurs frequently in practice, but as far as we know it is considered very rarely in the literature. The goal is to find a good resource allocation (schedule) to minimize the makespan. The problem is known to be strongly NP-hard, and such hard problems are often solved by heuristic methods. We found only one paper which is closely related to our topic, this paper proposes the heuristic method HH. We propose a new heuristic called QLM which is inspired by reinforcement learning methods from the area of machine learning. As we did not find appropriate benchmark problems for the investigated model. We have created such inputs and we have made exhaustive comparisons, comparing the results of HH and QLM, and an exact solver using CPLEX. We note that a heuristic method can give a "near optimal" solution very fast while an exact solver provides the optimal solution, but it may need a huge amount of time to find it. In our computational evaluation we experienced that our heuristic is more effective than HH and finds the optimal solution in many cases and very fast.

AB - In process scheduling problems there are several processes and resources. Any process consists of several tasks, and there may be precedence constraints among them. In our paper we consider a special case, where the precedence constraints form short disjoint (directed) paths. This model occurs frequently in practice, but as far as we know it is considered very rarely in the literature. The goal is to find a good resource allocation (schedule) to minimize the makespan. The problem is known to be strongly NP-hard, and such hard problems are often solved by heuristic methods. We found only one paper which is closely related to our topic, this paper proposes the heuristic method HH. We propose a new heuristic called QLM which is inspired by reinforcement learning methods from the area of machine learning. As we did not find appropriate benchmark problems for the investigated model. We have created such inputs and we have made exhaustive comparisons, comparing the results of HH and QLM, and an exact solver using CPLEX. We note that a heuristic method can give a "near optimal" solution very fast while an exact solver provides the optimal solution, but it may need a huge amount of time to find it. In our computational evaluation we experienced that our heuristic is more effective than HH and finds the optimal solution in many cases and very fast.

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

U2 - 10.3311/PPci.14295

DO - 10.3311/PPci.14295

M3 - Article

VL - 63.2019

SP - 961

EP - 970

JO - Periodica Polytechnica Civil Engineering

JF - Periodica Polytechnica Civil Engineering

IS - 4

ER -