Robust scheduling for multi-objective flexible job-shop problems with flexible workdays
This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is dete...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Zhang, Jiae [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2016 |
|---|
| Rechteinformationen: |
Nutzungsrecht: © 2016 Taylor & Francis 2016 |
|---|
| Schlagwörter: |
goal-guided multi-objective search |
|---|
| Übergeordnetes Werk: |
Enthalten in: Engineering optimization - London : Gordon & Breach, 1974, 48(2016), 11, Seite 1973-1989 |
|---|---|
| Übergeordnetes Werk: |
volume:48 ; year:2016 ; number:11 ; pages:1973-1989 |
| Links: |
|---|
| DOI / URN: |
10.1080/0305215X.2016.1145216 |
|---|
| Katalog-ID: |
OLC1984058207 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1984058207 | ||
| 003 | DE-627 | ||
| 005 | 20220216053306.0 | ||
| 007 | tu | ||
| 008 | 161202s2016 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1080/0305215X.2016.1145216 |2 doi | |
| 028 | 5 | 2 | |a PQ20170301 |
| 035 | |a (DE-627)OLC1984058207 | ||
| 035 | |a (DE-599)GBVOLC1984058207 | ||
| 035 | |a (PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0 | ||
| 035 | |a (KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 690 |q DE-600 |
| 084 | |a 50.03 |2 bkl | ||
| 100 | 1 | |a Zhang, Jiae |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Robust scheduling for multi-objective flexible job-shop problems with flexible workdays |
| 264 | 1 | |c 2016 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. | ||
| 540 | |a Nutzungsrecht: © 2016 Taylor & Francis 2016 | ||
| 650 | 4 | |a goal-guided multi-objective search | |
| 650 | 4 | |a flexible workdays | |
| 650 | 4 | |a multi-objective flexible job shop | |
| 650 | 4 | |a robust scheduling | |
| 650 | 4 | |a Production scheduling | |
| 650 | 4 | |a Job shops | |
| 700 | 1 | |a Yang, Jianjun |4 oth | |
| 700 | 1 | |a Zhou, Yong |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Engineering optimization |d London : Gordon & Breach, 1974 |g 48(2016), 11, Seite 1973-1989 |w (DE-627)129422339 |w (DE-600)190503-X |w (DE-576)014797917 |x 0305-215X |7 nnns |
| 773 | 1 | 8 | |g volume:48 |g year:2016 |g number:11 |g pages:1973-1989 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1080/0305215X.2016.1145216 |3 Volltext |
| 856 | 4 | 2 | |u http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216 |
| 856 | 4 | 2 | |u http://search.proquest.com/docview/1815374878 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-UMW | ||
| 912 | |a SSG-OLC-ARC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a GBV_ILN_70 | ||
| 936 | b | k | |a 50.03 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 48 |j 2016 |e 11 |h 1973-1989 | ||
| author_variant |
j z jz |
|---|---|
| matchkey_str |
article:0305215X:2016----::outceuigomlibetvfeiljbhprbes |
| hierarchy_sort_str |
2016 |
| bklnumber |
50.03 |
| publishDate |
2016 |
| allfields |
10.1080/0305215X.2016.1145216 doi PQ20170301 (DE-627)OLC1984058207 (DE-599)GBVOLC1984058207 (PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0 (KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr DE-627 ger DE-627 rakwb eng 690 DE-600 50.03 bkl Zhang, Jiae verfasserin aut Robust scheduling for multi-objective flexible job-shop problems with flexible workdays 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. Nutzungsrecht: © 2016 Taylor & Francis 2016 goal-guided multi-objective search flexible workdays multi-objective flexible job shop robust scheduling Production scheduling Job shops Yang, Jianjun oth Zhou, Yong oth Enthalten in Engineering optimization London : Gordon & Breach, 1974 48(2016), 11, Seite 1973-1989 (DE-627)129422339 (DE-600)190503-X (DE-576)014797917 0305-215X nnns volume:48 year:2016 number:11 pages:1973-1989 http://dx.doi.org/10.1080/0305215X.2016.1145216 Volltext http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216 http://search.proquest.com/docview/1815374878 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-UMW SSG-OLC-ARC SSG-OLC-TEC GBV_ILN_70 50.03 AVZ AR 48 2016 11 1973-1989 |
| spelling |
10.1080/0305215X.2016.1145216 doi PQ20170301 (DE-627)OLC1984058207 (DE-599)GBVOLC1984058207 (PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0 (KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr DE-627 ger DE-627 rakwb eng 690 DE-600 50.03 bkl Zhang, Jiae verfasserin aut Robust scheduling for multi-objective flexible job-shop problems with flexible workdays 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. Nutzungsrecht: © 2016 Taylor & Francis 2016 goal-guided multi-objective search flexible workdays multi-objective flexible job shop robust scheduling Production scheduling Job shops Yang, Jianjun oth Zhou, Yong oth Enthalten in Engineering optimization London : Gordon & Breach, 1974 48(2016), 11, Seite 1973-1989 (DE-627)129422339 (DE-600)190503-X (DE-576)014797917 0305-215X nnns volume:48 year:2016 number:11 pages:1973-1989 http://dx.doi.org/10.1080/0305215X.2016.1145216 Volltext http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216 http://search.proquest.com/docview/1815374878 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-UMW SSG-OLC-ARC SSG-OLC-TEC GBV_ILN_70 50.03 AVZ AR 48 2016 11 1973-1989 |
| allfields_unstemmed |
10.1080/0305215X.2016.1145216 doi PQ20170301 (DE-627)OLC1984058207 (DE-599)GBVOLC1984058207 (PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0 (KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr DE-627 ger DE-627 rakwb eng 690 DE-600 50.03 bkl Zhang, Jiae verfasserin aut Robust scheduling for multi-objective flexible job-shop problems with flexible workdays 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. Nutzungsrecht: © 2016 Taylor & Francis 2016 goal-guided multi-objective search flexible workdays multi-objective flexible job shop robust scheduling Production scheduling Job shops Yang, Jianjun oth Zhou, Yong oth Enthalten in Engineering optimization London : Gordon & Breach, 1974 48(2016), 11, Seite 1973-1989 (DE-627)129422339 (DE-600)190503-X (DE-576)014797917 0305-215X nnns volume:48 year:2016 number:11 pages:1973-1989 http://dx.doi.org/10.1080/0305215X.2016.1145216 Volltext http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216 http://search.proquest.com/docview/1815374878 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-UMW SSG-OLC-ARC SSG-OLC-TEC GBV_ILN_70 50.03 AVZ AR 48 2016 11 1973-1989 |
| allfieldsGer |
10.1080/0305215X.2016.1145216 doi PQ20170301 (DE-627)OLC1984058207 (DE-599)GBVOLC1984058207 (PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0 (KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr DE-627 ger DE-627 rakwb eng 690 DE-600 50.03 bkl Zhang, Jiae verfasserin aut Robust scheduling for multi-objective flexible job-shop problems with flexible workdays 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. Nutzungsrecht: © 2016 Taylor & Francis 2016 goal-guided multi-objective search flexible workdays multi-objective flexible job shop robust scheduling Production scheduling Job shops Yang, Jianjun oth Zhou, Yong oth Enthalten in Engineering optimization London : Gordon & Breach, 1974 48(2016), 11, Seite 1973-1989 (DE-627)129422339 (DE-600)190503-X (DE-576)014797917 0305-215X nnns volume:48 year:2016 number:11 pages:1973-1989 http://dx.doi.org/10.1080/0305215X.2016.1145216 Volltext http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216 http://search.proquest.com/docview/1815374878 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-UMW SSG-OLC-ARC SSG-OLC-TEC GBV_ILN_70 50.03 AVZ AR 48 2016 11 1973-1989 |
| allfieldsSound |
10.1080/0305215X.2016.1145216 doi PQ20170301 (DE-627)OLC1984058207 (DE-599)GBVOLC1984058207 (PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0 (KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr DE-627 ger DE-627 rakwb eng 690 DE-600 50.03 bkl Zhang, Jiae verfasserin aut Robust scheduling for multi-objective flexible job-shop problems with flexible workdays 2016 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. Nutzungsrecht: © 2016 Taylor & Francis 2016 goal-guided multi-objective search flexible workdays multi-objective flexible job shop robust scheduling Production scheduling Job shops Yang, Jianjun oth Zhou, Yong oth Enthalten in Engineering optimization London : Gordon & Breach, 1974 48(2016), 11, Seite 1973-1989 (DE-627)129422339 (DE-600)190503-X (DE-576)014797917 0305-215X nnns volume:48 year:2016 number:11 pages:1973-1989 http://dx.doi.org/10.1080/0305215X.2016.1145216 Volltext http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216 http://search.proquest.com/docview/1815374878 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-UMW SSG-OLC-ARC SSG-OLC-TEC GBV_ILN_70 50.03 AVZ AR 48 2016 11 1973-1989 |
| language |
English |
| source |
Enthalten in Engineering optimization 48(2016), 11, Seite 1973-1989 volume:48 year:2016 number:11 pages:1973-1989 |
| sourceStr |
Enthalten in Engineering optimization 48(2016), 11, Seite 1973-1989 volume:48 year:2016 number:11 pages:1973-1989 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
goal-guided multi-objective search flexible workdays multi-objective flexible job shop robust scheduling Production scheduling Job shops |
| dewey-raw |
690 |
| isfreeaccess_bool |
false |
| container_title |
Engineering optimization |
| authorswithroles_txt_mv |
Zhang, Jiae @@aut@@ Yang, Jianjun @@oth@@ Zhou, Yong @@oth@@ |
| publishDateDaySort_date |
2016-01-01T00:00:00Z |
| hierarchy_top_id |
129422339 |
| dewey-sort |
3690 |
| id |
OLC1984058207 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1984058207</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220216053306.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">161202s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/0305215X.2016.1145216</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170301</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1984058207</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1984058207</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr</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">690</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.03</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Jiae</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust scheduling for multi-objective flexible job-shop problems with flexible workdays</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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="520" ind1=" " ind2=" "><subfield code="a">This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Taylor & Francis 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">goal-guided multi-objective search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">flexible workdays</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multi-objective flexible job shop</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">robust scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Job shops</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Jianjun</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhou, Yong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Engineering optimization</subfield><subfield code="d">London : Gordon & Breach, 1974</subfield><subfield code="g">48(2016), 11, Seite 1973-1989</subfield><subfield code="w">(DE-627)129422339</subfield><subfield code="w">(DE-600)190503-X</subfield><subfield code="w">(DE-576)014797917</subfield><subfield code="x">0305-215X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:48</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:11</subfield><subfield code="g">pages:1973-1989</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/0305215X.2016.1145216</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1815374878</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-UMW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-ARC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.03</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">48</subfield><subfield code="j">2016</subfield><subfield code="e">11</subfield><subfield code="h">1973-1989</subfield></datafield></record></collection>
|
| author |
Zhang, Jiae |
| spellingShingle |
Zhang, Jiae ddc 690 bkl 50.03 misc goal-guided multi-objective search misc flexible workdays misc multi-objective flexible job shop misc robust scheduling misc Production scheduling misc Job shops Robust scheduling for multi-objective flexible job-shop problems with flexible workdays |
| authorStr |
Zhang, Jiae |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129422339 |
| format |
Article |
| dewey-ones |
690 - Buildings |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0305-215X |
| topic_title |
690 DE-600 50.03 bkl Robust scheduling for multi-objective flexible job-shop problems with flexible workdays goal-guided multi-objective search flexible workdays multi-objective flexible job shop robust scheduling Production scheduling Job shops |
| topic |
ddc 690 bkl 50.03 misc goal-guided multi-objective search misc flexible workdays misc multi-objective flexible job shop misc robust scheduling misc Production scheduling misc Job shops |
| topic_unstemmed |
ddc 690 bkl 50.03 misc goal-guided multi-objective search misc flexible workdays misc multi-objective flexible job shop misc robust scheduling misc Production scheduling misc Job shops |
| topic_browse |
ddc 690 bkl 50.03 misc goal-guided multi-objective search misc flexible workdays misc multi-objective flexible job shop misc robust scheduling misc Production scheduling misc Job shops |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
j y jy y z yz |
| hierarchy_parent_title |
Engineering optimization |
| hierarchy_parent_id |
129422339 |
| dewey-tens |
690 - Building & construction |
| hierarchy_top_title |
Engineering optimization |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129422339 (DE-600)190503-X (DE-576)014797917 |
| title |
Robust scheduling for multi-objective flexible job-shop problems with flexible workdays |
| ctrlnum |
(DE-627)OLC1984058207 (DE-599)GBVOLC1984058207 (PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0 (KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr |
| title_full |
Robust scheduling for multi-objective flexible job-shop problems with flexible workdays |
| author_sort |
Zhang, Jiae |
| journal |
Engineering optimization |
| journalStr |
Engineering optimization |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2016 |
| contenttype_str_mv |
txt |
| container_start_page |
1973 |
| author_browse |
Zhang, Jiae |
| container_volume |
48 |
| class |
690 DE-600 50.03 bkl |
| format_se |
Aufsätze |
| author-letter |
Zhang, Jiae |
| doi_str_mv |
10.1080/0305215X.2016.1145216 |
| dewey-full |
690 |
| title_sort |
robust scheduling for multi-objective flexible job-shop problems with flexible workdays |
| title_auth |
Robust scheduling for multi-objective flexible job-shop problems with flexible workdays |
| abstract |
This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. |
| abstractGer |
This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. |
| abstract_unstemmed |
This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-UMW SSG-OLC-ARC SSG-OLC-TEC GBV_ILN_70 |
| container_issue |
11 |
| title_short |
Robust scheduling for multi-objective flexible job-shop problems with flexible workdays |
| url |
http://dx.doi.org/10.1080/0305215X.2016.1145216 http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216 http://search.proquest.com/docview/1815374878 |
| remote_bool |
false |
| author2 |
Yang, Jianjun Zhou, Yong |
| author2Str |
Yang, Jianjun Zhou, Yong |
| ppnlink |
129422339 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1080/0305215X.2016.1145216 |
| up_date |
2024-07-03T23:00:25.536Z |
| _version_ |
1803600659055902722 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1984058207</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220216053306.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">161202s2016 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/0305215X.2016.1145216</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20170301</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1984058207</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1984058207</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1908-ef4fa57bbe278592699809e902e180a6f812e6a348b0362f835763f35eb74ccc0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0011445620160000048001101973robustschedulingformultiobjectiveflexiblejobshoppr</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">690</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.03</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Zhang, Jiae</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Robust scheduling for multi-objective flexible job-shop problems with flexible workdays</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2016</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="520" ind1=" " ind2=" "><subfield code="a">This study determines a robust schedule for a flexible job-shop scheduling problem with flexible workdays. The performance criteria considered in this study are tardiness, overtime and robustness. Furthermore, the problem is addressed in a Pareto manner, and a set of Pareto-optimal solutions is determined for this purpose. In consideration of all the aforementioned features, a goal-guided neighbourhood function is proposed based on efficient problem-dependent move-filtering methods. Two metaheuristic algorithms, named goal-guided multi-objective tabu search and goal-guided multi-objective hybrid search, are proposed in this work based on this neighbourhood function. The effectiveness of these approaches is demonstrated via empirical studies.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2016 Taylor & Francis 2016</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">goal-guided multi-objective search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">flexible workdays</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">multi-objective flexible job shop</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">robust scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Job shops</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Yang, Jianjun</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhou, Yong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Engineering optimization</subfield><subfield code="d">London : Gordon & Breach, 1974</subfield><subfield code="g">48(2016), 11, Seite 1973-1989</subfield><subfield code="w">(DE-627)129422339</subfield><subfield code="w">(DE-600)190503-X</subfield><subfield code="w">(DE-576)014797917</subfield><subfield code="x">0305-215X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:48</subfield><subfield code="g">year:2016</subfield><subfield code="g">number:11</subfield><subfield code="g">pages:1973-1989</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/0305215X.2016.1145216</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1145216</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://search.proquest.com/docview/1815374878</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-UMW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-ARC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.03</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">48</subfield><subfield code="j">2016</subfield><subfield code="e">11</subfield><subfield code="h">1973-1989</subfield></datafield></record></collection>
|
| score |
7.401288 |