Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ruiz, Rubén [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2007 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2007 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Springer US, 1984, 156(2007), 1 vom: 23. Aug., Seite 143-171 |
|---|---|
| Übergeordnetes Werk: |
volume:156 ; year:2007 ; number:1 ; day:23 ; month:08 ; pages:143-171 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10479-007-0227-8 |
|---|
| Katalog-ID: |
OLC2111139440 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2111139440 | ||
| 003 | DE-627 | ||
| 005 | 20230502202638.0 | ||
| 007 | tu | ||
| 008 | 230502s2007 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10479-007-0227-8 |2 doi | |
| 035 | |a (DE-627)OLC2111139440 | ||
| 035 | |a (DE-He213)s10479-007-0227-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Ruiz, Rubén |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Some effective heuristics for no-wait flowshops with setup times to minimize total completion time |
| 264 | 1 | |c 2007 | |
| 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 © Springer Science+Business Media, LLC 2007 | ||
| 520 | |a Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. | ||
| 650 | 4 | |a Flowshop | |
| 650 | 4 | |a No-wait | |
| 650 | 4 | |a Setup times | |
| 650 | 4 | |a Total flowtime | |
| 650 | 4 | |a Stochastic local search | |
| 700 | 1 | |a Allahverdi, Ali |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Springer US, 1984 |g 156(2007), 1 vom: 23. Aug., Seite 143-171 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:156 |g year:2007 |g number:1 |g day:23 |g month:08 |g pages:143-171 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10479-007-0227-8 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_4029 | ||
| 912 | |a GBV_ILN_4317 | ||
| 951 | |a AR | ||
| 952 | |d 156 |j 2007 |e 1 |b 23 |c 08 |h 143-171 | ||
| author_variant |
r r rr a a aa |
|---|---|
| matchkey_str |
article:02545330:2007----::oefetvhuitcfroatlwhpwtstpietmnm |
| hierarchy_sort_str |
2007 |
| publishDate |
2007 |
| allfields |
10.1007/s10479-007-0227-8 doi (DE-627)OLC2111139440 (DE-He213)s10479-007-0227-8-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Ruiz, Rubén verfasserin aut Some effective heuristics for no-wait flowshops with setup times to minimize total completion time 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. Flowshop No-wait Setup times Total flowtime Stochastic local search Allahverdi, Ali aut Enthalten in Annals of operations research Springer US, 1984 156(2007), 1 vom: 23. Aug., Seite 143-171 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:156 year:2007 number:1 day:23 month:08 pages:143-171 https://doi.org/10.1007/s10479-007-0227-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 156 2007 1 23 08 143-171 |
| spelling |
10.1007/s10479-007-0227-8 doi (DE-627)OLC2111139440 (DE-He213)s10479-007-0227-8-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Ruiz, Rubén verfasserin aut Some effective heuristics for no-wait flowshops with setup times to minimize total completion time 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. Flowshop No-wait Setup times Total flowtime Stochastic local search Allahverdi, Ali aut Enthalten in Annals of operations research Springer US, 1984 156(2007), 1 vom: 23. Aug., Seite 143-171 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:156 year:2007 number:1 day:23 month:08 pages:143-171 https://doi.org/10.1007/s10479-007-0227-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 156 2007 1 23 08 143-171 |
| allfields_unstemmed |
10.1007/s10479-007-0227-8 doi (DE-627)OLC2111139440 (DE-He213)s10479-007-0227-8-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Ruiz, Rubén verfasserin aut Some effective heuristics for no-wait flowshops with setup times to minimize total completion time 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. Flowshop No-wait Setup times Total flowtime Stochastic local search Allahverdi, Ali aut Enthalten in Annals of operations research Springer US, 1984 156(2007), 1 vom: 23. Aug., Seite 143-171 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:156 year:2007 number:1 day:23 month:08 pages:143-171 https://doi.org/10.1007/s10479-007-0227-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 156 2007 1 23 08 143-171 |
| allfieldsGer |
10.1007/s10479-007-0227-8 doi (DE-627)OLC2111139440 (DE-He213)s10479-007-0227-8-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Ruiz, Rubén verfasserin aut Some effective heuristics for no-wait flowshops with setup times to minimize total completion time 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. Flowshop No-wait Setup times Total flowtime Stochastic local search Allahverdi, Ali aut Enthalten in Annals of operations research Springer US, 1984 156(2007), 1 vom: 23. Aug., Seite 143-171 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:156 year:2007 number:1 day:23 month:08 pages:143-171 https://doi.org/10.1007/s10479-007-0227-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 156 2007 1 23 08 143-171 |
| allfieldsSound |
10.1007/s10479-007-0227-8 doi (DE-627)OLC2111139440 (DE-He213)s10479-007-0227-8-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Ruiz, Rubén verfasserin aut Some effective heuristics for no-wait flowshops with setup times to minimize total completion time 2007 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2007 Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. Flowshop No-wait Setup times Total flowtime Stochastic local search Allahverdi, Ali aut Enthalten in Annals of operations research Springer US, 1984 156(2007), 1 vom: 23. Aug., Seite 143-171 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:156 year:2007 number:1 day:23 month:08 pages:143-171 https://doi.org/10.1007/s10479-007-0227-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 AR 156 2007 1 23 08 143-171 |
| language |
English |
| source |
Enthalten in Annals of operations research 156(2007), 1 vom: 23. Aug., Seite 143-171 volume:156 year:2007 number:1 day:23 month:08 pages:143-171 |
| sourceStr |
Enthalten in Annals of operations research 156(2007), 1 vom: 23. Aug., Seite 143-171 volume:156 year:2007 number:1 day:23 month:08 pages:143-171 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Flowshop No-wait Setup times Total flowtime Stochastic local search |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
Ruiz, Rubén @@aut@@ Allahverdi, Ali @@aut@@ |
| publishDateDaySort_date |
2007-08-23T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC2111139440 |
| 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">OLC2111139440</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202638.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-007-0227-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111139440</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-007-0227-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="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ruiz, Rubén</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Some effective heuristics for no-wait flowshops with setup times to minimize total completion time</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</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">© Springer Science+Business Media, LLC 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Flowshop</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">No-wait</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Setup times</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Total flowtime</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic local search</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Allahverdi, Ali</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Springer US, 1984</subfield><subfield code="g">156(2007), 1 vom: 23. Aug., Seite 143-171</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:156</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:1</subfield><subfield code="g">day:23</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:143-171</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-007-0227-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-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">156</subfield><subfield code="j">2007</subfield><subfield code="e">1</subfield><subfield code="b">23</subfield><subfield code="c">08</subfield><subfield code="h">143-171</subfield></datafield></record></collection>
|
| author |
Ruiz, Rubén |
| spellingShingle |
Ruiz, Rubén ddc 004 ssgn 3,2 misc Flowshop misc No-wait misc Setup times misc Total flowtime misc Stochastic local search Some effective heuristics for no-wait flowshops with setup times to minimize total completion time |
| authorStr |
Ruiz, Rubén |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)12964370X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 VZ 3,2 ssgn Some effective heuristics for no-wait flowshops with setup times to minimize total completion time Flowshop No-wait Setup times Total flowtime Stochastic local search |
| topic |
ddc 004 ssgn 3,2 misc Flowshop misc No-wait misc Setup times misc Total flowtime misc Stochastic local search |
| topic_unstemmed |
ddc 004 ssgn 3,2 misc Flowshop misc No-wait misc Setup times misc Total flowtime misc Stochastic local search |
| topic_browse |
ddc 004 ssgn 3,2 misc Flowshop misc No-wait misc Setup times misc Total flowtime misc Stochastic local search |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Annals of operations research |
| hierarchy_parent_id |
12964370X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Annals of operations research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 |
| title |
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time |
| ctrlnum |
(DE-627)OLC2111139440 (DE-He213)s10479-007-0227-8-p |
| title_full |
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time |
| author_sort |
Ruiz, Rubén |
| journal |
Annals of operations research |
| journalStr |
Annals of operations research |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2007 |
| contenttype_str_mv |
txt |
| container_start_page |
143 |
| author_browse |
Ruiz, Rubén Allahverdi, Ali |
| container_volume |
156 |
| class |
004 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Ruiz, Rubén |
| doi_str_mv |
10.1007/s10479-007-0227-8 |
| dewey-full |
004 |
| title_sort |
some effective heuristics for no-wait flowshops with setup times to minimize total completion time |
| title_auth |
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time |
| abstract |
Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. © Springer Science+Business Media, LLC 2007 |
| abstractGer |
Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. © Springer Science+Business Media, LLC 2007 |
| abstract_unstemmed |
Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem. © Springer Science+Business Media, LLC 2007 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 GBV_ILN_4317 |
| container_issue |
1 |
| title_short |
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time |
| url |
https://doi.org/10.1007/s10479-007-0227-8 |
| remote_bool |
false |
| author2 |
Allahverdi, Ali |
| author2Str |
Allahverdi, Ali |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10479-007-0227-8 |
| up_date |
2024-07-04T08:49:25.611Z |
| _version_ |
1803637715751665664 |
| 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">OLC2111139440</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202638.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2007 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-007-0227-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111139440</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-007-0227-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="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ruiz, Rubén</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Some effective heuristics for no-wait flowshops with setup times to minimize total completion time</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2007</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">© Springer Science+Business Media, LLC 2007</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this work, we consider a complex flowshop scheduling problem in which both no-wait and separate setup times are considered. The optimisation criterion is the minimisation of the total completion time. We propose an effective dominance rule for the four machine case that can also be used for m machines. Five simple and fast heuristics are proposed along with two easy to code stochastic local search methods, one of them being based on Iterated Local Search (ILS). An extensive computational evaluation is carried out with two sets of 5,400 instances. All seven methods are compared to two recent algorithms. The results, confirmed by thorough statistical analyses, show that the proposed methods are more effective and efficient when compared to the best existing algorithms in the literature for the considered problem.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Flowshop</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">No-wait</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Setup times</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Total flowtime</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Stochastic local search</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Allahverdi, Ali</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of operations research</subfield><subfield code="d">Springer US, 1984</subfield><subfield code="g">156(2007), 1 vom: 23. Aug., Seite 143-171</subfield><subfield code="w">(DE-627)12964370X</subfield><subfield code="w">(DE-600)252629-3</subfield><subfield code="w">(DE-576)018141862</subfield><subfield code="x">0254-5330</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:156</subfield><subfield code="g">year:2007</subfield><subfield code="g">number:1</subfield><subfield code="g">day:23</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:143-171</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-007-0227-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-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">156</subfield><subfield code="j">2007</subfield><subfield code="e">1</subfield><subfield code="b">23</subfield><subfield code="c">08</subfield><subfield code="h">143-171</subfield></datafield></record></collection>
|
| score |
7.403078 |