A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage
Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually d...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Li, Shaohua [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2005 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, Inc. 2005 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of intelligent manufacturing - Kluwer Academic Publishers, 1990, 16(2005), 4-5 vom: Okt., Seite 463-477 |
|---|---|
| Übergeordnetes Werk: |
volume:16 ; year:2005 ; number:4-5 ; month:10 ; pages:463-477 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10845-005-1658-1 |
|---|
| Katalog-ID: |
OLC2066765147 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2066765147 | ||
| 003 | DE-627 | ||
| 005 | 20230503115531.0 | ||
| 007 | tu | ||
| 008 | 200820s2005 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10845-005-1658-1 |2 doi | |
| 035 | |a (DE-627)OLC2066765147 | ||
| 035 | |a (DE-He213)s10845-005-1658-1-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |a 004 |q VZ |
| 100 | 1 | |a Li, Shaohua |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage |
| 264 | 1 | |c 2005 | |
| 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, Inc. 2005 | ||
| 520 | |a Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. | ||
| 650 | 4 | |a Finite intermediate storage | |
| 650 | 4 | |a permutation flow-shop scheduling | |
| 650 | 4 | |a tabu search | |
| 650 | 4 | |a block properties | |
| 650 | 4 | |a hybrid algorithm | |
| 700 | 1 | |a Tang, Lixin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of intelligent manufacturing |d Kluwer Academic Publishers, 1990 |g 16(2005), 4-5 vom: Okt., Seite 463-477 |w (DE-627)130892815 |w (DE-600)1041378-9 |w (DE-576)026321106 |x 0956-5515 |7 nnns |
| 773 | 1 | 8 | |g volume:16 |g year:2005 |g number:4-5 |g month:10 |g pages:463-477 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10845-005-1658-1 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4324 | ||
| 951 | |a AR | ||
| 952 | |d 16 |j 2005 |e 4-5 |c 10 |h 463-477 | ||
| author_variant |
s l sl l t lt |
|---|---|
| matchkey_str |
article:09565515:2005----::tbsacagrtmaeonwlcpoeteadpeumtofremttofosow |
| hierarchy_sort_str |
2005 |
| publishDate |
2005 |
| allfields |
10.1007/s10845-005-1658-1 doi (DE-627)OLC2066765147 (DE-He213)s10845-005-1658-1-p DE-627 ger DE-627 rakwb eng 620 004 VZ Li, Shaohua verfasserin aut A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2005 Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. Finite intermediate storage permutation flow-shop scheduling tabu search block properties hybrid algorithm Tang, Lixin aut Enthalten in Journal of intelligent manufacturing Kluwer Academic Publishers, 1990 16(2005), 4-5 vom: Okt., Seite 463-477 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:16 year:2005 number:4-5 month:10 pages:463-477 https://doi.org/10.1007/s10845-005-1658-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_4324 AR 16 2005 4-5 10 463-477 |
| spelling |
10.1007/s10845-005-1658-1 doi (DE-627)OLC2066765147 (DE-He213)s10845-005-1658-1-p DE-627 ger DE-627 rakwb eng 620 004 VZ Li, Shaohua verfasserin aut A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2005 Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. Finite intermediate storage permutation flow-shop scheduling tabu search block properties hybrid algorithm Tang, Lixin aut Enthalten in Journal of intelligent manufacturing Kluwer Academic Publishers, 1990 16(2005), 4-5 vom: Okt., Seite 463-477 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:16 year:2005 number:4-5 month:10 pages:463-477 https://doi.org/10.1007/s10845-005-1658-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_4324 AR 16 2005 4-5 10 463-477 |
| allfields_unstemmed |
10.1007/s10845-005-1658-1 doi (DE-627)OLC2066765147 (DE-He213)s10845-005-1658-1-p DE-627 ger DE-627 rakwb eng 620 004 VZ Li, Shaohua verfasserin aut A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2005 Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. Finite intermediate storage permutation flow-shop scheduling tabu search block properties hybrid algorithm Tang, Lixin aut Enthalten in Journal of intelligent manufacturing Kluwer Academic Publishers, 1990 16(2005), 4-5 vom: Okt., Seite 463-477 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:16 year:2005 number:4-5 month:10 pages:463-477 https://doi.org/10.1007/s10845-005-1658-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_4324 AR 16 2005 4-5 10 463-477 |
| allfieldsGer |
10.1007/s10845-005-1658-1 doi (DE-627)OLC2066765147 (DE-He213)s10845-005-1658-1-p DE-627 ger DE-627 rakwb eng 620 004 VZ Li, Shaohua verfasserin aut A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2005 Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. Finite intermediate storage permutation flow-shop scheduling tabu search block properties hybrid algorithm Tang, Lixin aut Enthalten in Journal of intelligent manufacturing Kluwer Academic Publishers, 1990 16(2005), 4-5 vom: Okt., Seite 463-477 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:16 year:2005 number:4-5 month:10 pages:463-477 https://doi.org/10.1007/s10845-005-1658-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_4324 AR 16 2005 4-5 10 463-477 |
| allfieldsSound |
10.1007/s10845-005-1658-1 doi (DE-627)OLC2066765147 (DE-He213)s10845-005-1658-1-p DE-627 ger DE-627 rakwb eng 620 004 VZ Li, Shaohua verfasserin aut A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, Inc. 2005 Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. Finite intermediate storage permutation flow-shop scheduling tabu search block properties hybrid algorithm Tang, Lixin aut Enthalten in Journal of intelligent manufacturing Kluwer Academic Publishers, 1990 16(2005), 4-5 vom: Okt., Seite 463-477 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:16 year:2005 number:4-5 month:10 pages:463-477 https://doi.org/10.1007/s10845-005-1658-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_4324 AR 16 2005 4-5 10 463-477 |
| language |
English |
| source |
Enthalten in Journal of intelligent manufacturing 16(2005), 4-5 vom: Okt., Seite 463-477 volume:16 year:2005 number:4-5 month:10 pages:463-477 |
| sourceStr |
Enthalten in Journal of intelligent manufacturing 16(2005), 4-5 vom: Okt., Seite 463-477 volume:16 year:2005 number:4-5 month:10 pages:463-477 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Finite intermediate storage permutation flow-shop scheduling tabu search block properties hybrid algorithm |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Journal of intelligent manufacturing |
| authorswithroles_txt_mv |
Li, Shaohua @@aut@@ Tang, Lixin @@aut@@ |
| publishDateDaySort_date |
2005-10-01T00:00:00Z |
| hierarchy_top_id |
130892815 |
| dewey-sort |
3620 |
| id |
OLC2066765147 |
| 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">OLC2066765147</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503115531.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10845-005-1658-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066765147</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10845-005-1658-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Shaohua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2005</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, Inc. 2005</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite intermediate storage</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">permutation flow-shop scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">tabu search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">block properties</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">hybrid algorithm</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tang, Lixin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of intelligent manufacturing</subfield><subfield code="d">Kluwer Academic Publishers, 1990</subfield><subfield code="g">16(2005), 4-5 vom: Okt., Seite 463-477</subfield><subfield code="w">(DE-627)130892815</subfield><subfield code="w">(DE-600)1041378-9</subfield><subfield code="w">(DE-576)026321106</subfield><subfield code="x">0956-5515</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:4-5</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:463-477</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10845-005-1658-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2005</subfield><subfield code="e">4-5</subfield><subfield code="c">10</subfield><subfield code="h">463-477</subfield></datafield></record></collection>
|
| author |
Li, Shaohua |
| spellingShingle |
Li, Shaohua ddc 620 misc Finite intermediate storage misc permutation flow-shop scheduling misc tabu search misc block properties misc hybrid algorithm A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage |
| authorStr |
Li, Shaohua |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130892815 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0956-5515 |
| topic_title |
620 004 VZ A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage Finite intermediate storage permutation flow-shop scheduling tabu search block properties hybrid algorithm |
| topic |
ddc 620 misc Finite intermediate storage misc permutation flow-shop scheduling misc tabu search misc block properties misc hybrid algorithm |
| topic_unstemmed |
ddc 620 misc Finite intermediate storage misc permutation flow-shop scheduling misc tabu search misc block properties misc hybrid algorithm |
| topic_browse |
ddc 620 misc Finite intermediate storage misc permutation flow-shop scheduling misc tabu search misc block properties misc hybrid algorithm |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of intelligent manufacturing |
| hierarchy_parent_id |
130892815 |
| dewey-tens |
620 - Engineering 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Journal of intelligent manufacturing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 |
| title |
A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage |
| ctrlnum |
(DE-627)OLC2066765147 (DE-He213)s10845-005-1658-1-p |
| title_full |
A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage |
| author_sort |
Li, Shaohua |
| journal |
Journal of intelligent manufacturing |
| journalStr |
Journal of intelligent manufacturing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2005 |
| contenttype_str_mv |
txt |
| container_start_page |
463 |
| author_browse |
Li, Shaohua Tang, Lixin |
| container_volume |
16 |
| class |
620 004 VZ |
| format_se |
Aufsätze |
| author-letter |
Li, Shaohua |
| doi_str_mv |
10.1007/s10845-005-1658-1 |
| dewey-full |
620 004 |
| title_sort |
a tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage |
| title_auth |
A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage |
| abstract |
Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. © Springer Science+Business Media, Inc. 2005 |
| abstractGer |
Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. © Springer Science+Business Media, Inc. 2005 |
| abstract_unstemmed |
Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search. © Springer Science+Business Media, Inc. 2005 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_70 GBV_ILN_4324 |
| container_issue |
4-5 |
| title_short |
A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage |
| url |
https://doi.org/10.1007/s10845-005-1658-1 |
| remote_bool |
false |
| author2 |
Tang, Lixin |
| author2Str |
Tang, Lixin |
| ppnlink |
130892815 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10845-005-1658-1 |
| up_date |
2024-07-04T05:14:49.904Z |
| _version_ |
1803624214584885248 |
| 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">OLC2066765147</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503115531.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10845-005-1658-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066765147</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10845-005-1658-1-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Shaohua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2005</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, Inc. 2005</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper deals with a permutation flow-shop scheduling problem with finite intermediate storage (PFSFIS) between successive machines so as to minimize makespan. In such a problem the intermediate storage capacity constraints are considered besides the machine-related constraints usually discussed in the general permutation flow-shop. This feature adds extra difficulties to the scheduling problem. In this paper, we present some new block properties and a speed-up method using a forward-backward hybrid algorithm to compute makespan. Applied in a tabu search algorithm, the new block properties greatly reduce the neighborhood size and thus shorten the search time. Also, the speed-up method eliminates redundant computation for the objective function and reduces a majority of the running time. Computational experiments (up to 200 jobs and 20 machines) are given to demonstrate the effectiveness of new block neighborhood characteristics and the speed-up method. Compared with the results yielded by the best-known algorithm, the objective function is improved by 0.14% if the new block neighborhood characteristics are used; furthermore, the running time is reduced by 53.7% on the average if the speed-up method is used. Under the condition that both of the algorithms have the same running time the objective function is improved by 0.24% if both of the two above improvement methods are applied in the original tabu search.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Finite intermediate storage</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">permutation flow-shop scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">tabu search</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">block properties</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">hybrid algorithm</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tang, Lixin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of intelligent manufacturing</subfield><subfield code="d">Kluwer Academic Publishers, 1990</subfield><subfield code="g">16(2005), 4-5 vom: Okt., Seite 463-477</subfield><subfield code="w">(DE-627)130892815</subfield><subfield code="w">(DE-600)1041378-9</subfield><subfield code="w">(DE-576)026321106</subfield><subfield code="x">0956-5515</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:16</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:4-5</subfield><subfield code="g">month:10</subfield><subfield code="g">pages:463-477</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10845-005-1658-1</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">16</subfield><subfield code="j">2005</subfield><subfield code="e">4-5</subfield><subfield code="c">10</subfield><subfield code="h">463-477</subfield></datafield></record></collection>
|
| score |
7.4010506 |