Reinforcement learning applications to machine scheduling problems: a comprehensive literature review
Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging meth...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Kayhan, Behice Meltem [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of intelligent manufacturing - Springer US, 1990, 34(2021), 3 vom: 19. Okt., Seite 905-929 |
|---|---|
| Übergeordnetes Werk: |
volume:34 ; year:2021 ; number:3 ; day:19 ; month:10 ; pages:905-929 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10845-021-01847-3 |
|---|
| Katalog-ID: |
OLC2133921001 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2133921001 | ||
| 003 | DE-627 | ||
| 005 | 20230506155124.0 | ||
| 007 | tu | ||
| 008 | 230506s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10845-021-01847-3 |2 doi | |
| 035 | |a (DE-627)OLC2133921001 | ||
| 035 | |a (DE-He213)s10845-021-01847-3-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |a 004 |q VZ |
| 100 | 1 | |a Kayhan, Behice Meltem |e verfasserin |0 (orcid)0000-0001-6881-2580 |4 aut | |
| 245 | 1 | 0 | |a Reinforcement learning applications to machine scheduling problems: a comprehensive literature review |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 | ||
| 520 | |a Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. | ||
| 650 | 4 | |a Reinforcement learning | |
| 650 | 4 | |a Q-learning | |
| 650 | 4 | |a Machine scheduling | |
| 650 | 4 | |a Job shop scheduling problem | |
| 650 | 4 | |a Parallel machine scheduling problems | |
| 700 | 1 | |a Yildiz, Gokalp |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of intelligent manufacturing |d Springer US, 1990 |g 34(2021), 3 vom: 19. Okt., Seite 905-929 |w (DE-627)130892815 |w (DE-600)1041378-9 |w (DE-576)026321106 |x 0956-5515 |7 nnns |
| 773 | 1 | 8 | |g volume:34 |g year:2021 |g number:3 |g day:19 |g month:10 |g pages:905-929 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10845-021-01847-3 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 34 |j 2021 |e 3 |b 19 |c 10 |h 905-929 | ||
| author_variant |
b m k bm bmk g y gy |
|---|---|
| matchkey_str |
article:09565515:2021----::enocmnlannapiaintmcieceuigrbescmr |
| hierarchy_sort_str |
2021 |
| publishDate |
2021 |
| allfields |
10.1007/s10845-021-01847-3 doi (DE-627)OLC2133921001 (DE-He213)s10845-021-01847-3-p DE-627 ger DE-627 rakwb eng 620 004 VZ Kayhan, Behice Meltem verfasserin (orcid)0000-0001-6881-2580 aut Reinforcement learning applications to machine scheduling problems: a comprehensive literature review 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. Reinforcement learning Q-learning Machine scheduling Job shop scheduling problem Parallel machine scheduling problems Yildiz, Gokalp aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 34(2021), 3 vom: 19. Okt., Seite 905-929 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:34 year:2021 number:3 day:19 month:10 pages:905-929 https://doi.org/10.1007/s10845-021-01847-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 34 2021 3 19 10 905-929 |
| spelling |
10.1007/s10845-021-01847-3 doi (DE-627)OLC2133921001 (DE-He213)s10845-021-01847-3-p DE-627 ger DE-627 rakwb eng 620 004 VZ Kayhan, Behice Meltem verfasserin (orcid)0000-0001-6881-2580 aut Reinforcement learning applications to machine scheduling problems: a comprehensive literature review 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. Reinforcement learning Q-learning Machine scheduling Job shop scheduling problem Parallel machine scheduling problems Yildiz, Gokalp aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 34(2021), 3 vom: 19. Okt., Seite 905-929 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:34 year:2021 number:3 day:19 month:10 pages:905-929 https://doi.org/10.1007/s10845-021-01847-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 34 2021 3 19 10 905-929 |
| allfields_unstemmed |
10.1007/s10845-021-01847-3 doi (DE-627)OLC2133921001 (DE-He213)s10845-021-01847-3-p DE-627 ger DE-627 rakwb eng 620 004 VZ Kayhan, Behice Meltem verfasserin (orcid)0000-0001-6881-2580 aut Reinforcement learning applications to machine scheduling problems: a comprehensive literature review 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. Reinforcement learning Q-learning Machine scheduling Job shop scheduling problem Parallel machine scheduling problems Yildiz, Gokalp aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 34(2021), 3 vom: 19. Okt., Seite 905-929 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:34 year:2021 number:3 day:19 month:10 pages:905-929 https://doi.org/10.1007/s10845-021-01847-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 34 2021 3 19 10 905-929 |
| allfieldsGer |
10.1007/s10845-021-01847-3 doi (DE-627)OLC2133921001 (DE-He213)s10845-021-01847-3-p DE-627 ger DE-627 rakwb eng 620 004 VZ Kayhan, Behice Meltem verfasserin (orcid)0000-0001-6881-2580 aut Reinforcement learning applications to machine scheduling problems: a comprehensive literature review 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. Reinforcement learning Q-learning Machine scheduling Job shop scheduling problem Parallel machine scheduling problems Yildiz, Gokalp aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 34(2021), 3 vom: 19. Okt., Seite 905-929 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:34 year:2021 number:3 day:19 month:10 pages:905-929 https://doi.org/10.1007/s10845-021-01847-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 34 2021 3 19 10 905-929 |
| allfieldsSound |
10.1007/s10845-021-01847-3 doi (DE-627)OLC2133921001 (DE-He213)s10845-021-01847-3-p DE-627 ger DE-627 rakwb eng 620 004 VZ Kayhan, Behice Meltem verfasserin (orcid)0000-0001-6881-2580 aut Reinforcement learning applications to machine scheduling problems: a comprehensive literature review 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. Reinforcement learning Q-learning Machine scheduling Job shop scheduling problem Parallel machine scheduling problems Yildiz, Gokalp aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 34(2021), 3 vom: 19. Okt., Seite 905-929 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:34 year:2021 number:3 day:19 month:10 pages:905-929 https://doi.org/10.1007/s10845-021-01847-3 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 34 2021 3 19 10 905-929 |
| language |
English |
| source |
Enthalten in Journal of intelligent manufacturing 34(2021), 3 vom: 19. Okt., Seite 905-929 volume:34 year:2021 number:3 day:19 month:10 pages:905-929 |
| sourceStr |
Enthalten in Journal of intelligent manufacturing 34(2021), 3 vom: 19. Okt., Seite 905-929 volume:34 year:2021 number:3 day:19 month:10 pages:905-929 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Reinforcement learning Q-learning Machine scheduling Job shop scheduling problem Parallel machine scheduling problems |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Journal of intelligent manufacturing |
| authorswithroles_txt_mv |
Kayhan, Behice Meltem @@aut@@ Yildiz, Gokalp @@aut@@ |
| publishDateDaySort_date |
2021-10-19T00:00:00Z |
| hierarchy_top_id |
130892815 |
| dewey-sort |
3620 |
| id |
OLC2133921001 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2133921001</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506155124.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230506s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10845-021-01847-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2133921001</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10845-021-01847-3-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kayhan, Behice Meltem</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6881-2580</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reinforcement learning applications to machine scheduling problems: a comprehensive literature review</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reinforcement learning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Q-learning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Job shop scheduling problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel machine scheduling problems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yildiz, Gokalp</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of intelligent manufacturing</subfield><subfield code="d">Springer US, 1990</subfield><subfield code="g">34(2021), 3 vom: 19. Okt., Seite 905-929</subfield><subfield code="w">(DE-627)130892815</subfield><subfield code="w">(DE-600)1041378-9</subfield><subfield code="w">(DE-576)026321106</subfield><subfield code="x">0956-5515</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:3</subfield><subfield code="g">day:19</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:905-929</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10845-021-01847-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2021</subfield><subfield code="e">3</subfield><subfield code="b">19</subfield><subfield code="c">10</subfield><subfield code="h">905-929</subfield></datafield></record></collection>
|
| author |
Kayhan, Behice Meltem |
| spellingShingle |
Kayhan, Behice Meltem ddc 620 misc Reinforcement learning misc Q-learning misc Machine scheduling misc Job shop scheduling problem misc Parallel machine scheduling problems Reinforcement learning applications to machine scheduling problems: a comprehensive literature review |
| authorStr |
Kayhan, Behice Meltem |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130892815 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0956-5515 |
| topic_title |
620 004 VZ Reinforcement learning applications to machine scheduling problems: a comprehensive literature review Reinforcement learning Q-learning Machine scheduling Job shop scheduling problem Parallel machine scheduling problems |
| topic |
ddc 620 misc Reinforcement learning misc Q-learning misc Machine scheduling misc Job shop scheduling problem misc Parallel machine scheduling problems |
| topic_unstemmed |
ddc 620 misc Reinforcement learning misc Q-learning misc Machine scheduling misc Job shop scheduling problem misc Parallel machine scheduling problems |
| topic_browse |
ddc 620 misc Reinforcement learning misc Q-learning misc Machine scheduling misc Job shop scheduling problem misc Parallel machine scheduling problems |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of intelligent manufacturing |
| hierarchy_parent_id |
130892815 |
| dewey-tens |
620 - Engineering 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Journal of intelligent manufacturing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 |
| title |
Reinforcement learning applications to machine scheduling problems: a comprehensive literature review |
| ctrlnum |
(DE-627)OLC2133921001 (DE-He213)s10845-021-01847-3-p |
| title_full |
Reinforcement learning applications to machine scheduling problems: a comprehensive literature review |
| author_sort |
Kayhan, Behice Meltem |
| journal |
Journal of intelligent manufacturing |
| journalStr |
Journal of intelligent manufacturing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
txt |
| container_start_page |
905 |
| author_browse |
Kayhan, Behice Meltem Yildiz, Gokalp |
| container_volume |
34 |
| class |
620 004 VZ |
| format_se |
Aufsätze |
| author-letter |
Kayhan, Behice Meltem |
| doi_str_mv |
10.1007/s10845-021-01847-3 |
| normlink |
(ORCID)0000-0001-6881-2580 |
| normlink_prefix_str_mv |
(orcid)0000-0001-6881-2580 |
| dewey-full |
620 004 |
| title_sort |
reinforcement learning applications to machine scheduling problems: a comprehensive literature review |
| title_auth |
Reinforcement learning applications to machine scheduling problems: a comprehensive literature review |
| abstract |
Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| abstractGer |
Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| abstract_unstemmed |
Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT |
| container_issue |
3 |
| title_short |
Reinforcement learning applications to machine scheduling problems: a comprehensive literature review |
| url |
https://doi.org/10.1007/s10845-021-01847-3 |
| remote_bool |
false |
| author2 |
Yildiz, Gokalp |
| author2Str |
Yildiz, Gokalp |
| ppnlink |
130892815 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10845-021-01847-3 |
| up_date |
2024-07-03T22:22:49.695Z |
| _version_ |
1803598293574352896 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2133921001</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506155124.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230506s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10845-021-01847-3</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2133921001</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10845-021-01847-3-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kayhan, Behice Meltem</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6881-2580</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Reinforcement learning applications to machine scheduling problems: a comprehensive literature review</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Reinforcement learning (RL) is one of the most remarkable branches of machine learning and attracts the attention of researchers from numerous fields. Especially in recent years, the RL methods have been applied to machine scheduling problems and are among the top five most encouraging methods for scheduling literature. Therefore, in this study, a comprehensive literature review about RL methods applications to machine scheduling problems was conducted. In this regard, Scopus and Web of Science databases were searched very inclusively using the proper keywords. As a result of the comprehensive research, 80 papers were found, published between 1995 and 2020. These papers were analyzed considering different aspects of the problem such as applied algorithms, machine environments, job and machine characteristics, objectives, benchmark methods, and a detailed classification scheme was constructed. Job shop scheduling, unrelated parallel machine scheduling, and single machine scheduling problems were found as the most studied problem type. The main contributions of the study are to examine essential aspects of reinforcement learning in machine scheduling problems, identify the most frequently investigated problem types, objectives, and constraints, and reveal the deficiencies and promising areas in the related literature. This study can help researchers who wish to study in this field through the comprehensive analysis of the related literature.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Reinforcement learning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Q-learning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Job shop scheduling problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel machine scheduling problems</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yildiz, Gokalp</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of intelligent manufacturing</subfield><subfield code="d">Springer US, 1990</subfield><subfield code="g">34(2021), 3 vom: 19. Okt., Seite 905-929</subfield><subfield code="w">(DE-627)130892815</subfield><subfield code="w">(DE-600)1041378-9</subfield><subfield code="w">(DE-576)026321106</subfield><subfield code="x">0956-5515</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:34</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:3</subfield><subfield code="g">day:19</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:905-929</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10845-021-01847-3</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">34</subfield><subfield code="j">2021</subfield><subfield code="e">3</subfield><subfield code="b">19</subfield><subfield code="c">10</subfield><subfield code="h">905-929</subfield></datafield></record></collection>
|
| score |
7.400531 |