Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm
Abstract Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total co...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Yang-Yuan [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: Applied intelligence - Springer US, 1991, 52(2021), 5 vom: 20. Aug., Seite 5718-5738 |
|---|---|
| Übergeordnetes Werk: |
volume:52 ; year:2021 ; number:5 ; day:20 ; month:08 ; pages:5718-5738 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10489-021-02608-8 |
|---|
| Katalog-ID: |
OLC207818117X |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC207818117X | ||
| 003 | DE-627 | ||
| 005 | 20230505233738.0 | ||
| 007 | tu | ||
| 008 | 221220s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10489-021-02608-8 |2 doi | |
| 035 | |a (DE-627)OLC207818117X | ||
| 035 | |a (DE-He213)s10489-021-02608-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 100 | 1 | |a Li, Yang-Yuan |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm |
| 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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. | ||
| 650 | 4 | |a Multi-objective | |
| 650 | 4 | |a Jaya algorithm | |
| 650 | 4 | |a Multi-skill | |
| 650 | 4 | |a Project scheduling | |
| 700 | 1 | |a Lin, Jian |0 (orcid)0000-0003-1265-5314 |4 aut | |
| 700 | 1 | |a Wang, Zhou-Jing |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Applied intelligence |d Springer US, 1991 |g 52(2021), 5 vom: 20. Aug., Seite 5718-5738 |w (DE-627)130990515 |w (DE-600)1080229-0 |w (DE-576)029154286 |x 0924-669X |7 nnns |
| 773 | 1 | 8 | |g volume:52 |g year:2021 |g number:5 |g day:20 |g month:08 |g pages:5718-5738 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10489-021-02608-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 52 |j 2021 |e 5 |b 20 |c 08 |h 5718-5738 | ||
| author_variant |
y y l yyl j l jl z j w zjw |
|---|---|
| matchkey_str |
article:0924669X:2021----::utsileoreosriepoetceuigsnautojc |
| hierarchy_sort_str |
2021 |
| publishDate |
2021 |
| allfields |
10.1007/s10489-021-02608-8 doi (DE-627)OLC207818117X (DE-He213)s10489-021-02608-8-p DE-627 ger DE-627 rakwb eng 004 VZ Li, Yang-Yuan verfasserin aut Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm 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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. Multi-objective Jaya algorithm Multi-skill Project scheduling Lin, Jian (orcid)0000-0003-1265-5314 aut Wang, Zhou-Jing aut Enthalten in Applied intelligence Springer US, 1991 52(2021), 5 vom: 20. Aug., Seite 5718-5738 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:52 year:2021 number:5 day:20 month:08 pages:5718-5738 https://doi.org/10.1007/s10489-021-02608-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 52 2021 5 20 08 5718-5738 |
| spelling |
10.1007/s10489-021-02608-8 doi (DE-627)OLC207818117X (DE-He213)s10489-021-02608-8-p DE-627 ger DE-627 rakwb eng 004 VZ Li, Yang-Yuan verfasserin aut Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm 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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. Multi-objective Jaya algorithm Multi-skill Project scheduling Lin, Jian (orcid)0000-0003-1265-5314 aut Wang, Zhou-Jing aut Enthalten in Applied intelligence Springer US, 1991 52(2021), 5 vom: 20. Aug., Seite 5718-5738 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:52 year:2021 number:5 day:20 month:08 pages:5718-5738 https://doi.org/10.1007/s10489-021-02608-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 52 2021 5 20 08 5718-5738 |
| allfields_unstemmed |
10.1007/s10489-021-02608-8 doi (DE-627)OLC207818117X (DE-He213)s10489-021-02608-8-p DE-627 ger DE-627 rakwb eng 004 VZ Li, Yang-Yuan verfasserin aut Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm 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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. Multi-objective Jaya algorithm Multi-skill Project scheduling Lin, Jian (orcid)0000-0003-1265-5314 aut Wang, Zhou-Jing aut Enthalten in Applied intelligence Springer US, 1991 52(2021), 5 vom: 20. Aug., Seite 5718-5738 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:52 year:2021 number:5 day:20 month:08 pages:5718-5738 https://doi.org/10.1007/s10489-021-02608-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 52 2021 5 20 08 5718-5738 |
| allfieldsGer |
10.1007/s10489-021-02608-8 doi (DE-627)OLC207818117X (DE-He213)s10489-021-02608-8-p DE-627 ger DE-627 rakwb eng 004 VZ Li, Yang-Yuan verfasserin aut Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm 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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. Multi-objective Jaya algorithm Multi-skill Project scheduling Lin, Jian (orcid)0000-0003-1265-5314 aut Wang, Zhou-Jing aut Enthalten in Applied intelligence Springer US, 1991 52(2021), 5 vom: 20. Aug., Seite 5718-5738 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:52 year:2021 number:5 day:20 month:08 pages:5718-5738 https://doi.org/10.1007/s10489-021-02608-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 52 2021 5 20 08 5718-5738 |
| allfieldsSound |
10.1007/s10489-021-02608-8 doi (DE-627)OLC207818117X (DE-He213)s10489-021-02608-8-p DE-627 ger DE-627 rakwb eng 004 VZ Li, Yang-Yuan verfasserin aut Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm 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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. Multi-objective Jaya algorithm Multi-skill Project scheduling Lin, Jian (orcid)0000-0003-1265-5314 aut Wang, Zhou-Jing aut Enthalten in Applied intelligence Springer US, 1991 52(2021), 5 vom: 20. Aug., Seite 5718-5738 (DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 0924-669X nnns volume:52 year:2021 number:5 day:20 month:08 pages:5718-5738 https://doi.org/10.1007/s10489-021-02608-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT AR 52 2021 5 20 08 5718-5738 |
| language |
English |
| source |
Enthalten in Applied intelligence 52(2021), 5 vom: 20. Aug., Seite 5718-5738 volume:52 year:2021 number:5 day:20 month:08 pages:5718-5738 |
| sourceStr |
Enthalten in Applied intelligence 52(2021), 5 vom: 20. Aug., Seite 5718-5738 volume:52 year:2021 number:5 day:20 month:08 pages:5718-5738 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Multi-objective Jaya algorithm Multi-skill Project scheduling |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Applied intelligence |
| authorswithroles_txt_mv |
Li, Yang-Yuan @@aut@@ Lin, Jian @@aut@@ Wang, Zhou-Jing @@aut@@ |
| publishDateDaySort_date |
2021-08-20T00:00:00Z |
| hierarchy_top_id |
130990515 |
| dewey-sort |
14 |
| id |
OLC207818117X |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC207818117X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505233738.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10489-021-02608-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC207818117X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10489-021-02608-8-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">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Yang-Yuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm</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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-objective</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Jaya algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-skill</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Project scheduling</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lin, Jian</subfield><subfield code="0">(orcid)0000-0003-1265-5314</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Zhou-Jing</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Applied intelligence</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">52(2021), 5 vom: 20. Aug., Seite 5718-5738</subfield><subfield code="w">(DE-627)130990515</subfield><subfield code="w">(DE-600)1080229-0</subfield><subfield code="w">(DE-576)029154286</subfield><subfield code="x">0924-669X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:52</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:5</subfield><subfield code="g">day:20</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:5718-5738</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10489-021-02608-8</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-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">52</subfield><subfield code="j">2021</subfield><subfield code="e">5</subfield><subfield code="b">20</subfield><subfield code="c">08</subfield><subfield code="h">5718-5738</subfield></datafield></record></collection>
|
| author |
Li, Yang-Yuan |
| spellingShingle |
Li, Yang-Yuan ddc 004 misc Multi-objective misc Jaya algorithm misc Multi-skill misc Project scheduling Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm |
| authorStr |
Li, Yang-Yuan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130990515 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0924-669X |
| topic_title |
004 VZ Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm Multi-objective Jaya algorithm Multi-skill Project scheduling |
| topic |
ddc 004 misc Multi-objective misc Jaya algorithm misc Multi-skill misc Project scheduling |
| topic_unstemmed |
ddc 004 misc Multi-objective misc Jaya algorithm misc Multi-skill misc Project scheduling |
| topic_browse |
ddc 004 misc Multi-objective misc Jaya algorithm misc Multi-skill misc Project scheduling |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Applied intelligence |
| hierarchy_parent_id |
130990515 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Applied intelligence |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130990515 (DE-600)1080229-0 (DE-576)029154286 |
| title |
Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm |
| ctrlnum |
(DE-627)OLC207818117X (DE-He213)s10489-021-02608-8-p |
| title_full |
Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm |
| author_sort |
Li, Yang-Yuan |
| journal |
Applied intelligence |
| journalStr |
Applied intelligence |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
txt |
| container_start_page |
5718 |
| author_browse |
Li, Yang-Yuan Lin, Jian Wang, Zhou-Jing |
| container_volume |
52 |
| class |
004 VZ |
| format_se |
Aufsätze |
| author-letter |
Li, Yang-Yuan |
| doi_str_mv |
10.1007/s10489-021-02608-8 |
| normlink |
(ORCID)0000-0003-1265-5314 |
| normlink_prefix_str_mv |
(orcid)0000-0003-1265-5314 |
| dewey-full |
004 |
| title_sort |
multi-skill resource constrained project scheduling using a multi-objective discrete jaya algorithm |
| title_auth |
Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm |
| abstract |
Abstract Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| abstractGer |
Abstract Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| abstract_unstemmed |
Abstract Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP. © 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-MAT |
| container_issue |
5 |
| title_short |
Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm |
| url |
https://doi.org/10.1007/s10489-021-02608-8 |
| remote_bool |
false |
| author2 |
Lin, Jian Wang, Zhou-Jing |
| author2Str |
Lin, Jian Wang, Zhou-Jing |
| ppnlink |
130990515 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10489-021-02608-8 |
| up_date |
2024-07-03T19:12:14.109Z |
| _version_ |
1803586302494375936 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC207818117X</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505233738.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10489-021-02608-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC207818117X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10489-021-02608-8-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">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Yang-Yuan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multi-skill resource constrained project scheduling using a multi-objective discrete Jaya algorithm</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 Multi-skill resource constrained project scheduling problem (MS-RCPSP) is one of the widest investigated problems in manufacturing systems. This paper presents a multi-objective discrete Jaya (MODJaya) algorithm to address the MS-RCPSP with the objectives of minimizing makespan and total cost simultaneously. In MODJaya, the best and worst solutions are used to generate offspring. Two simple heuristics are employed to enhance the exploration ability. An efficient encoding and decoding pair is designed to construct feasible schedules, and different assignment criteria are proposed to increase solution diversity. In addition, a left-shift scheme is embedded into the decoding process for improving resource utilization. The performance of the proposed algorithm is evaluated on an intelligent multi-objective project scheduling environment benchmark dataset. Computational results and comparisons with the state-of-the-art algorithms indicate the superiority of the MODJaya in solving the multi-objective MS-RCPSP.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-objective</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Jaya algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-skill</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Project scheduling</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lin, Jian</subfield><subfield code="0">(orcid)0000-0003-1265-5314</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Zhou-Jing</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Applied intelligence</subfield><subfield code="d">Springer US, 1991</subfield><subfield code="g">52(2021), 5 vom: 20. Aug., Seite 5718-5738</subfield><subfield code="w">(DE-627)130990515</subfield><subfield code="w">(DE-600)1080229-0</subfield><subfield code="w">(DE-576)029154286</subfield><subfield code="x">0924-669X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:52</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:5</subfield><subfield code="g">day:20</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:5718-5738</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10489-021-02608-8</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-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">52</subfield><subfield code="j">2021</subfield><subfield code="e">5</subfield><subfield code="b">20</subfield><subfield code="c">08</subfield><subfield code="h">5718-5738</subfield></datafield></record></collection>
|
| score |
7.400936 |