Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis
Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS....
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Artigues, Christian [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2005 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science + Business Media, Inc. 2005 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Annals of operations research - Kluwer Academic Publishers, 1984, 138(2005), 1 vom: Sept., Seite 21-52 |
|---|---|
| Übergeordnetes Werk: |
volume:138 ; year:2005 ; number:1 ; month:09 ; pages:21-52 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10479-005-2443-4 |
|---|
| Katalog-ID: |
OLC2111134503 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2111134503 | ||
| 003 | DE-627 | ||
| 005 | 20230502202600.0 | ||
| 007 | tu | ||
| 008 | 230502s2005 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10479-005-2443-4 |2 doi | |
| 035 | |a (DE-627)OLC2111134503 | ||
| 035 | |a (DE-He213)s10479-005-2443-4-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 Artigues, Christian |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis |
| 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 We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. | ||
| 650 | 4 | |a scheduling theory | |
| 650 | 4 | |a job-shop | |
| 650 | 4 | |a sequence-dependent setup times | |
| 650 | 4 | |a schedule generation scheme | |
| 650 | 4 | |a dominance properties | |
| 650 | 4 | |a priority rules | |
| 700 | 1 | |a Lopez, Pierre |4 aut | |
| 700 | 1 | |a Ayache, Pierre-Dimitri |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Annals of operations research |d Kluwer Academic Publishers, 1984 |g 138(2005), 1 vom: Sept., Seite 21-52 |w (DE-627)12964370X |w (DE-600)252629-3 |w (DE-576)018141862 |x 0254-5330 |
| 773 | 1 | 8 | |g volume:138 |g year:2005 |g number:1 |g month:09 |g pages:21-52 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10479-005-2443-4 |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 | ||
| 951 | |a AR | ||
| 952 | |d 138 |j 2005 |e 1 |c 09 |h 21-52 | ||
| author_variant |
c a ca p l pl p d a pda |
|---|---|
| matchkey_str |
article:02545330:2005----::ceueeeainceefrhjbhprbewtsqecdpneteutmsoiacp |
| hierarchy_sort_str |
2005 |
| publishDate |
2005 |
| allfields |
10.1007/s10479-005-2443-4 doi (DE-627)OLC2111134503 (DE-He213)s10479-005-2443-4-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Artigues, Christian verfasserin aut Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. scheduling theory job-shop sequence-dependent setup times schedule generation scheme dominance properties priority rules Lopez, Pierre aut Ayache, Pierre-Dimitri aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 138(2005), 1 vom: Sept., Seite 21-52 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:138 year:2005 number:1 month:09 pages:21-52 https://doi.org/10.1007/s10479-005-2443-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 138 2005 1 09 21-52 |
| spelling |
10.1007/s10479-005-2443-4 doi (DE-627)OLC2111134503 (DE-He213)s10479-005-2443-4-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Artigues, Christian verfasserin aut Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. scheduling theory job-shop sequence-dependent setup times schedule generation scheme dominance properties priority rules Lopez, Pierre aut Ayache, Pierre-Dimitri aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 138(2005), 1 vom: Sept., Seite 21-52 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:138 year:2005 number:1 month:09 pages:21-52 https://doi.org/10.1007/s10479-005-2443-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 138 2005 1 09 21-52 |
| allfields_unstemmed |
10.1007/s10479-005-2443-4 doi (DE-627)OLC2111134503 (DE-He213)s10479-005-2443-4-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Artigues, Christian verfasserin aut Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. scheduling theory job-shop sequence-dependent setup times schedule generation scheme dominance properties priority rules Lopez, Pierre aut Ayache, Pierre-Dimitri aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 138(2005), 1 vom: Sept., Seite 21-52 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:138 year:2005 number:1 month:09 pages:21-52 https://doi.org/10.1007/s10479-005-2443-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 138 2005 1 09 21-52 |
| allfieldsGer |
10.1007/s10479-005-2443-4 doi (DE-627)OLC2111134503 (DE-He213)s10479-005-2443-4-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Artigues, Christian verfasserin aut Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. scheduling theory job-shop sequence-dependent setup times schedule generation scheme dominance properties priority rules Lopez, Pierre aut Ayache, Pierre-Dimitri aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 138(2005), 1 vom: Sept., Seite 21-52 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:138 year:2005 number:1 month:09 pages:21-52 https://doi.org/10.1007/s10479-005-2443-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 138 2005 1 09 21-52 |
| allfieldsSound |
10.1007/s10479-005-2443-4 doi (DE-627)OLC2111134503 (DE-He213)s10479-005-2443-4-p DE-627 ger DE-627 rakwb eng 004 VZ 3,2 ssgn Artigues, Christian verfasserin aut Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis 2005 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science + Business Media, Inc. 2005 Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. scheduling theory job-shop sequence-dependent setup times schedule generation scheme dominance properties priority rules Lopez, Pierre aut Ayache, Pierre-Dimitri aut Enthalten in Annals of operations research Kluwer Academic Publishers, 1984 138(2005), 1 vom: Sept., Seite 21-52 (DE-627)12964370X (DE-600)252629-3 (DE-576)018141862 0254-5330 volume:138 year:2005 number:1 month:09 pages:21-52 https://doi.org/10.1007/s10479-005-2443-4 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 AR 138 2005 1 09 21-52 |
| language |
English |
| source |
Enthalten in Annals of operations research 138(2005), 1 vom: Sept., Seite 21-52 volume:138 year:2005 number:1 month:09 pages:21-52 |
| sourceStr |
Enthalten in Annals of operations research 138(2005), 1 vom: Sept., Seite 21-52 volume:138 year:2005 number:1 month:09 pages:21-52 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
scheduling theory job-shop sequence-dependent setup times schedule generation scheme dominance properties priority rules |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Annals of operations research |
| authorswithroles_txt_mv |
Artigues, Christian @@aut@@ Lopez, Pierre @@aut@@ Ayache, Pierre-Dimitri @@aut@@ |
| publishDateDaySort_date |
2005-09-01T00:00:00Z |
| hierarchy_top_id |
12964370X |
| dewey-sort |
14 |
| id |
OLC2111134503 |
| 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">OLC2111134503</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202600.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-005-2443-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111134503</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-005-2443-4-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">Artigues, Christian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis</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 We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">scheduling theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">job-shop</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sequence-dependent setup times</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">schedule generation scheme</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">dominance properties</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">priority rules</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lopez, Pierre</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ayache, Pierre-Dimitri</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">Kluwer Academic Publishers, 1984</subfield><subfield code="g">138(2005), 1 vom: Sept., Seite 21-52</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:138</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:1</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:21-52</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-005-2443-4</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">138</subfield><subfield code="j">2005</subfield><subfield code="e">1</subfield><subfield code="c">09</subfield><subfield code="h">21-52</subfield></datafield></record></collection>
|
| author |
Artigues, Christian |
| spellingShingle |
Artigues, Christian ddc 004 ssgn 3,2 misc scheduling theory misc job-shop misc sequence-dependent setup times misc schedule generation scheme misc dominance properties misc priority rules Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis |
| authorStr |
Artigues, Christian |
| 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 aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0254-5330 |
| topic_title |
004 VZ 3,2 ssgn Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis scheduling theory job-shop sequence-dependent setup times schedule generation scheme dominance properties priority rules |
| topic |
ddc 004 ssgn 3,2 misc scheduling theory misc job-shop misc sequence-dependent setup times misc schedule generation scheme misc dominance properties misc priority rules |
| topic_unstemmed |
ddc 004 ssgn 3,2 misc scheduling theory misc job-shop misc sequence-dependent setup times misc schedule generation scheme misc dominance properties misc priority rules |
| topic_browse |
ddc 004 ssgn 3,2 misc scheduling theory misc job-shop misc sequence-dependent setup times misc schedule generation scheme misc dominance properties misc priority rules |
| 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 |
Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis |
| ctrlnum |
(DE-627)OLC2111134503 (DE-He213)s10479-005-2443-4-p |
| title_full |
Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis |
| author_sort |
Artigues, Christian |
| 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 |
2005 |
| contenttype_str_mv |
txt |
| container_start_page |
21 |
| author_browse |
Artigues, Christian Lopez, Pierre Ayache, Pierre-Dimitri |
| container_volume |
138 |
| class |
004 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Artigues, Christian |
| doi_str_mv |
10.1007/s10479-005-2443-4 |
| dewey-full |
004 |
| title_sort |
schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis |
| title_auth |
Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis |
| abstract |
Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. © Springer Science + Business Media, Inc. 2005 |
| abstractGer |
Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. © Springer Science + Business Media, Inc. 2005 |
| abstract_unstemmed |
Abstract We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances. © Springer Science + Business Media, Inc. 2005 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-WIW SSG-OLC-MAT GBV_ILN_4029 |
| container_issue |
1 |
| title_short |
Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis |
| url |
https://doi.org/10.1007/s10479-005-2443-4 |
| remote_bool |
false |
| author2 |
Lopez, Pierre Ayache, Pierre-Dimitri |
| author2Str |
Lopez, Pierre Ayache, Pierre-Dimitri |
| ppnlink |
12964370X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10479-005-2443-4 |
| up_date |
2024-07-04T08:48:38.262Z |
| _version_ |
1803637666102640640 |
| 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">OLC2111134503</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502202600.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230502s2005 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10479-005-2443-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2111134503</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10479-005-2443-4-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">Artigues, Christian</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis</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 We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristics. We study several priority rules for the problem and provide a comparative computational analysis of the different SGSs on sets of instances taken from the literature. The proposed SGSs significantly improve previously best-known results on a set of hard benchmark instances.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">scheduling theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">job-shop</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">sequence-dependent setup times</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">schedule generation scheme</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">dominance properties</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">priority rules</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lopez, Pierre</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ayache, Pierre-Dimitri</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">Kluwer Academic Publishers, 1984</subfield><subfield code="g">138(2005), 1 vom: Sept., Seite 21-52</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:138</subfield><subfield code="g">year:2005</subfield><subfield code="g">number:1</subfield><subfield code="g">month:09</subfield><subfield code="g">pages:21-52</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10479-005-2443-4</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="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">138</subfield><subfield code="j">2005</subfield><subfield code="e">1</subfield><subfield code="c">09</subfield><subfield code="h">21-52</subfield></datafield></record></collection>
|
| score |
7.4015617 |