Heuristics and metaheuristics for heavily constrained hybrid flowshop problems:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Abschlussarbeit Buch |
Sprache: | English |
Veröffentlicht: |
Heidelberg
Akad. Verl.-Ges. AKA [u.a.]
2011
|
Schriftenreihe: | Dissertationen zur künstlichen Intelligenz
331 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XXXI, 315 S. graph. Darst. |
ISBN: | 9781607506782 9783898383318 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV036957226 | ||
003 | DE-604 | ||
005 | 20160830 | ||
007 | t | ||
008 | 110114s2011 d||| m||| 00||| eng d | ||
016 | 7 | |a 642911959 |2 DE-101 | |
020 | |a 9781607506782 |c (IOS Press) |9 978-1-607-50678-2 | ||
020 | |a 9783898383318 |c (AKA) |9 978-3-89838-331-8 | ||
035 | |a (OCoLC)706871793 | ||
035 | |a (DE-599)GBV642911959 | ||
040 | |a DE-604 |b ger | ||
041 | 0 | |a eng | |
049 | |a DE-91G |a DE-355 | ||
084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
084 | |a DAT 700d |2 stub | ||
084 | |a MAT 906d |2 stub | ||
100 | 1 | |a Urlings, Thijs |e Verfasser |4 aut | |
245 | 1 | 0 | |a Heuristics and metaheuristics for heavily constrained hybrid flowshop problems |c Thijs Urlings |
264 | 1 | |a Heidelberg |b Akad. Verl.-Ges. AKA [u.a.] |c 2011 | |
300 | |a XXXI, 315 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Dissertationen zur künstlichen Intelligenz |v 331 | |
502 | |a Zugl.: Valencia, Univ., Diss., 2010 | ||
650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Memetischer Algorithmus |0 (DE-588)4625421-3 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Genetischer Algorithmus |0 (DE-588)4265092-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Flow-shop-Problem |0 (DE-588)4335204-2 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Genetischer Algorithmus |0 (DE-588)4265092-6 |D s |
689 | 0 | 1 | |a Memetischer Algorithmus |0 (DE-588)4625421-3 |D s |
689 | 0 | 2 | |a Scheduling |0 (DE-588)4179449-7 |D s |
689 | 0 | 3 | |a Flow-shop-Problem |0 (DE-588)4335204-2 |D s |
689 | 0 | 4 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |D s |
689 | 0 | |5 DE-604 | |
830 | 0 | |a Dissertationen zur künstlichen Intelligenz |v 331 |w (DE-604)BV005345280 |9 331 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020872174&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-020872174 |
Datensatz im Suchindex
_version_ | 1804143680784695296 |
---|---|
adam_text | IMAGE 1
CONTENTS
1 INTRODUCTION AND OBJECTIVES 1
1.1 MOTIVATION 3
1.2 CLASSIFICATION OF SCHEDULING PROBLEMS 5
1.3 OBJECTIVES 7
2 THE HYBRID FLEXIBLE FLOW LINE PROBLEM 11
2.1 EXAMPLE INSTANCE 19
2.2 LITERATURE REVIEW 21
2.2.1 GENETIC ALGORITHM APPLICATIONS IN REALISTIC SCHEDULING . 21 2.2.2
GENETIC ALGORITHMS FOR HYBRID FLOWSHOP PROBLEMS . .. 24 2.2.3
REPRESENTATION SCHEMES FOR GA APPLICATIONS 27
3 MATHEMATICAL MODEL 31
3.1 INTRODUCTION 31
3.2 THE MIP MODEL FORMULATION 32
3.3 COMPUTATIONAL EVALUATION 34
3.3.1 MIP MODEL EVALUATION . 36
3.3.2 MIP MODEL STATISTICAL ANALYSIS 40
3.4 CONCLUSIONS 48
4 HEURISTICS 51
4.1 INTRODUCTION 51
4.2 MACHINE ASSIGNMENT RULES 53
4.2.1 RULES BASED ON CURRENT JOB, CURRENT STAGE 55
XV
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/1009315390
DIGITALISIERT DURCH
IMAGE 2
XVI CONTENTS
4.2.2 LOOK-AHEAD RULES 56
4.3 SOLUTION REPRESENTATIONS 68
4.3.1 PERMUTATION WITH A SINGLE RULE FOR MACHINE ASSIGNMENT 69 4.3.2
PERMUTATION WITH AN ASSIGNMENT RULE FOR EACH JOB . .. 73 4.3.3
PERMUTATION WITH THE MACHINE ASSIGNMENTS FOR EACH JOB 76 4.3.4 ORDERED
LIST OF TASKS FOR EACH MACHINE 79
4.4 DISPATCHING RULES 86
4.5 NEH HEURISTIC 88
4.6 CONCLUSIONS 93
5 GENETIC ALGORITHMS 97
5.1 BGA 98
5.2 SGA 103
5.3 SGAR 103
5.4 SGAM 104
5.5 EGA 104
5.5.1 SPECIFIC CROSSOVER OPERATORS 105
5.5.2 SPECIFIC MUTATION OPERATORS 106
5.6 COMPUTATIONAL EVALUATION 108
5.6.1 CALIBRATIONS 109
5.6.2 COMPARISON AMONG GENETIC ALGORITHMS 114
5.6.3 COMPARISON WITH OTHER METHODS 119
5.7 CONCLUSIONS 124
6 LOCAL SEARCH ALGORITHMS 125
6.1 INTRODUCTION 126
6.2 MEMETIC ALGORITHM 137
6.3 ITERATED LOCAL SEARCH . 142
6.4 ITERATED GREEDY 144
6.5 COMPUTATIONAL EVALUATION 146
6.6 CONCLUSIONS 149
IMAGE 3
CONTENTS XVII
7 SHIFTING REPRESENTATION ALGORITHMS 151
7.1 MIXED GENETIC ALGORITHM 152
7.2 SHIFTING REPRESENTATION SEARCH 159
7.3 COMPUTATIONAL EVALUATION 166
7.4 CONCLUSIONS 173
8 MULTI-OBJECTIVE SCHEDULING 175
8.1 INTRODUCTION 176
8.1.1 WEIGHTED OBJECTIVES 176
8.1.2 LEXICOGRAPHICAL APPROACHES 177
8.1.3 PARETO OPTIMISATION 177
8.2 MULTI-OBJECTIVE QUALITY MEASURES 180
8.2.1 QUALITY INDICATORS 181
8.2.2 EMPIRICAL ATTAINMENT FUNCTIONS 185
8.3 PROBLEM DESCRIPTION 188
8.4 PROPOSED ALGORITHMS 193
8.4.1 NSGA-II 195
8.4.2 RIPG 196
8.5 COMPUTATIONAL EVALUATION 198
8.5.1 CALIBRATIONS 199
8.5.2 COMPARISON AMONG MULTI-OBJECTIVE ALGORITHMS . . .. 215 8.6
CONCLUSIONS 232
9 CONCLUSIONS AND FUTURE RESEARCH 235
9.1 SCHEDULING SOFTWARE 239
9.2 FUTURE RESEARCH 244
9.3 PUBLICATIONS 245
BIBLIOGRAPHY 249
A DATA FOR FIGURES 265
B ANOVA TABLES 283
C BEST SOLUTION VALUES 301
|
any_adam_object | 1 |
author | Urlings, Thijs |
author_facet | Urlings, Thijs |
author_role | aut |
author_sort | Urlings, Thijs |
author_variant | t u tu |
building | Verbundindex |
bvnumber | BV036957226 |
classification_rvk | ST 300 |
classification_tum | DAT 700d MAT 906d |
ctrlnum | (OCoLC)706871793 (DE-599)GBV642911959 |
discipline | Informatik Mathematik |
format | Thesis Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02163nam a2200505 cb4500</leader><controlfield tag="001">BV036957226</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160830 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">110114s2011 d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">642911959</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781607506782</subfield><subfield code="c">(IOS Press)</subfield><subfield code="9">978-1-607-50678-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783898383318</subfield><subfield code="c">(AKA)</subfield><subfield code="9">978-3-89838-331-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)706871793</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV642911959</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 700d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 906d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Urlings, Thijs</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Heuristics and metaheuristics for heavily constrained hybrid flowshop problems</subfield><subfield code="c">Thijs Urlings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Heidelberg</subfield><subfield code="b">Akad. Verl.-Ges. AKA [u.a.]</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXXI, 315 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Dissertationen zur künstlichen Intelligenz</subfield><subfield code="v">331</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Valencia, Univ., Diss., 2010</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Memetischer Algorithmus</subfield><subfield code="0">(DE-588)4625421-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Genetischer Algorithmus</subfield><subfield code="0">(DE-588)4265092-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Flow-shop-Problem</subfield><subfield code="0">(DE-588)4335204-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Genetischer Algorithmus</subfield><subfield code="0">(DE-588)4265092-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Memetischer Algorithmus</subfield><subfield code="0">(DE-588)4625421-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Flow-shop-Problem</subfield><subfield code="0">(DE-588)4335204-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="4"><subfield code="a">Künstliche Intelligenz</subfield><subfield code="0">(DE-588)4033447-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Dissertationen zur künstlichen Intelligenz</subfield><subfield code="v">331</subfield><subfield code="w">(DE-604)BV005345280</subfield><subfield code="9">331</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020872174&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-020872174</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV036957226 |
illustrated | Illustrated |
indexdate | 2024-07-09T22:51:31Z |
institution | BVB |
isbn | 9781607506782 9783898383318 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-020872174 |
oclc_num | 706871793 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM DE-355 DE-BY-UBR |
owner_facet | DE-91G DE-BY-TUM DE-355 DE-BY-UBR |
physical | XXXI, 315 S. graph. Darst. |
publishDate | 2011 |
publishDateSearch | 2011 |
publishDateSort | 2011 |
publisher | Akad. Verl.-Ges. AKA [u.a.] |
record_format | marc |
series | Dissertationen zur künstlichen Intelligenz |
series2 | Dissertationen zur künstlichen Intelligenz |
spelling | Urlings, Thijs Verfasser aut Heuristics and metaheuristics for heavily constrained hybrid flowshop problems Thijs Urlings Heidelberg Akad. Verl.-Ges. AKA [u.a.] 2011 XXXI, 315 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Dissertationen zur künstlichen Intelligenz 331 Zugl.: Valencia, Univ., Diss., 2010 Scheduling (DE-588)4179449-7 gnd rswk-swf Memetischer Algorithmus (DE-588)4625421-3 gnd rswk-swf Künstliche Intelligenz (DE-588)4033447-8 gnd rswk-swf Genetischer Algorithmus (DE-588)4265092-6 gnd rswk-swf Flow-shop-Problem (DE-588)4335204-2 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Genetischer Algorithmus (DE-588)4265092-6 s Memetischer Algorithmus (DE-588)4625421-3 s Scheduling (DE-588)4179449-7 s Flow-shop-Problem (DE-588)4335204-2 s Künstliche Intelligenz (DE-588)4033447-8 s DE-604 Dissertationen zur künstlichen Intelligenz 331 (DE-604)BV005345280 331 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020872174&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Urlings, Thijs Heuristics and metaheuristics for heavily constrained hybrid flowshop problems Dissertationen zur künstlichen Intelligenz Scheduling (DE-588)4179449-7 gnd Memetischer Algorithmus (DE-588)4625421-3 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd Genetischer Algorithmus (DE-588)4265092-6 gnd Flow-shop-Problem (DE-588)4335204-2 gnd |
subject_GND | (DE-588)4179449-7 (DE-588)4625421-3 (DE-588)4033447-8 (DE-588)4265092-6 (DE-588)4335204-2 (DE-588)4113937-9 |
title | Heuristics and metaheuristics for heavily constrained hybrid flowshop problems |
title_auth | Heuristics and metaheuristics for heavily constrained hybrid flowshop problems |
title_exact_search | Heuristics and metaheuristics for heavily constrained hybrid flowshop problems |
title_full | Heuristics and metaheuristics for heavily constrained hybrid flowshop problems Thijs Urlings |
title_fullStr | Heuristics and metaheuristics for heavily constrained hybrid flowshop problems Thijs Urlings |
title_full_unstemmed | Heuristics and metaheuristics for heavily constrained hybrid flowshop problems Thijs Urlings |
title_short | Heuristics and metaheuristics for heavily constrained hybrid flowshop problems |
title_sort | heuristics and metaheuristics for heavily constrained hybrid flowshop problems |
topic | Scheduling (DE-588)4179449-7 gnd Memetischer Algorithmus (DE-588)4625421-3 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd Genetischer Algorithmus (DE-588)4265092-6 gnd Flow-shop-Problem (DE-588)4335204-2 gnd |
topic_facet | Scheduling Memetischer Algorithmus Künstliche Intelligenz Genetischer Algorithmus Flow-shop-Problem Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=020872174&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV005345280 |
work_keys_str_mv | AT urlingsthijs heuristicsandmetaheuristicsforheavilyconstrainedhybridflowshopproblems |