Efficient algorithms for production scheduling:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Kaiserslautern
2019
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | 135 Seiten Diagramme |
Internformat
MARC
| LEADER | 00000nam a22000008c 4500 | ||
|---|---|---|---|
| 001 | BV046881310 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 200903s2019 gw |||| m||| 00||| eng d | ||
| 016 | 7 | |a 1210659727 |2 DE-101 | |
| 035 | |a (OCoLC)1197717248 | ||
| 035 | |a (DE-599)DNB1210659727 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BW | ||
| 049 | |a DE-355 | ||
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Wortel, Pascal |e Verfasser |0 (DE-588)1213999790 |4 aut | |
| 245 | 1 | 0 | |a Efficient algorithms for production scheduling |c Pascal Wortel |
| 264 | 1 | |a Kaiserslautern |c 2019 | |
| 300 | |a 135 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |b Dissertation |c Technische Universität Kaiserslautern |d 2020 | ||
| 650 | 0 | 7 | |a Robuste Optimierung |0 (DE-588)7752811-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Fertigungsablauf |0 (DE-588)4240895-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Zuordnungsproblem |0 (DE-588)4068123-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Produktionsplanung |0 (DE-588)4047360-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Planungsmodell |0 (DE-588)4201187-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a NP-hartes Problem |0 (DE-588)4621705-8 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Planungsmodell |0 (DE-588)4201187-5 |D s |
| 689 | 0 | 1 | |a Robuste Optimierung |0 (DE-588)7752811-6 |D s |
| 689 | 0 | 2 | |a Fertigungsablauf |0 (DE-588)4240895-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Produktionsplanung |0 (DE-588)4047360-0 |D s |
| 689 | 1 | 1 | |a Planungsmodell |0 (DE-588)4201187-5 |D s |
| 689 | 1 | 2 | |a NP-hartes Problem |0 (DE-588)4621705-8 |D s |
| 689 | 1 | 3 | |a Zuordnungsproblem |0 (DE-588)4068123-3 |D s |
| 689 | 1 | 4 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 1 | 5 | |a Robuste Optimierung |0 (DE-588)7752811-6 |D s |
| 689 | 1 | 6 | |a Effizienter Algorithmus |0 (DE-588)4125422-3 |D s |
| 689 | 1 | |5 DE-604 | |
| 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=032291311&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032291311 | ||
Datensatz im Suchindex
| _version_ | 1804181738628317184 |
|---|---|
| adam_text | CONTENTS
1
INTRODUCTION
1
1.1
MOTIVATIONS
.......................................................................................
1
1.2
OUTLINE
OF
THE
THESIS
........................................................................
3
1.3
CREDITS
.................................................................................................
4
1
FUNDAMENTALS
5
NOMENCLATURE
7
2
DEFINITIONS
AND
PRELIMINARIES
11
2.1
LINEAR
AND
INTEGER
PROGRAMMING
......................................................
11
2.2
ROBUST
LINEAR
OPTIMIZATION
...............................................................
14
2.3
GRAPH
THEORY
........................................................................................
16
2.4
SCHEDULING
THEORY
...............................................................................
18
II
BUFFER
ALLOCATION
IN
FLOW
LINES
21
3
ROBUST
BUFFER
ALLOCATION
23
3.1
INTRODUCTION
...........................................................................................
23
3.2
DEFINITION
OF
THE
MODEL
........................................................................
25
3.2.1
THE
BUFFER
ALLOCATION
PROBLEM
IN
THE
NOMINAL
CASE
...
25
3.2.2
DEFINITION
OF
THE
UNCERTAINTY
SET
.........................................
27
3.2.3
FORMULATION
OF
THE
ROBUST
COUNTERPART
................................
29
3.2.4
A
NOTE
ON
WARM-UP
...............................................................
31
3.3
REDUCTION
TO
A
LONGEST
PATH
PROBLEM
............................................
32
3.3.1
GRAPH
REPRESENTATION
............................................................
32
3.3.2
LONGEST
PATHS
IN
THE
NOMINAL
CASE
......................................
34
3.3.3
INTRODUCTION
OF
THE
UNCERTAINTY
............................................
35
3.4
GENERAL
MIP-FORMULATION
..................................................................
39
3.4.1
LONGEST
PATH
FORMULATION
.....................................................
39
VII
3.4.2
DUALIZATION
AND
GENERAL
FORMULATION
...................................
39
3.5
REDUCING
COMPUTATION
TIMES
............................................................
41
3.5.1
DERIVATION
OF
INITIAL
BOUNDS
...................................................
41
3.5.2
SIMPLIFICATIONS
OF
THE
GRAPH
...................................................
44
3.5.3
DISCUSSION
ON
THE
INFLUENCE
OF
THE
GAMMA-PARAMETER
.
.
49
3.6
NUMERICAL
STUDY
..................................................................................
53
3.6.1
METHODOLOGY
............................................................................
53
3.6.2
RESULTS
........................................................................................
54
3.7
CONCLUSIONS
...........................................................................................
57
4
SPEEDING
UP
BUFFER
ALLOCATION
59
4.1
INTRODUCTION
...........................................................................................
59
4.2
EXACT
BUFFER
ALLOCATION
WITHOUT
WARM-UP
......................................
61
4.2.1
NOTATIONS
AND
MODELLING
.........................................................
61
4.2.2
COMBINATORIAL
CUTS
..................................................................
63
4.2.3
INDIVIDUAL
BOUNDS
BY
SUBSYSTEMS
.........................................
68
4.3
GENERALIZATION
TO
THE
CASE
USING
WARM-UP
......................................
70
4.3.1
ISSUES
WITH
THE
PREVIOUS
METHODS
.........................................
70
4.3.2
ALTERNATIVE
DEFINITION
FOR
THE
THROUGHPUT
..........................
73
4.3.3
EXTENDING
THE
SUBSYSTEMS
*
METHOD
......................................
76
4.4
USING
GLOBAL
LOWER
BOUNDS
...............................................................
78
4.5
NUMERICAL
STUDY
..................................................................................
81
4.5.1
METHODOLOGY
...........................................................................
81
4.5.2
IMPACT
OF
THE
ADAPTED
LOWER
BOUNDS
...................................
82
4.5.3
COMPARISON
WITH
THE
GLOBAL
BOUNDS
METHOD
........................
83
4.6
CONCLUSIONS
AND
OUTLOOK
.....................................................................
84
III
SCHEDULING
WITH
INVENTORY
CONSTRAINTS
87
5
SCHEDULING
WITH
PREFABRICATION
89
5.1
INTRODUCTION
........................................................................................
89
5.2
PROBLEM
DEFINITION
..............................................................................
91
5.3
RELATED
RESEARCH
..................................................................................
95
5.4
REGULAR
OBJECTIVES
..............................................................................
96
5.5
LATENESS
RELATED
OBJECTIVE
FUNCTIONS
...............................................
98
5.5.1
MAXIMUM
LATENESS
...............................................................
98
5.5.2
NUMBER
OF
TARDY
JOBS
..........................................................
101
5.6
TOTAL
COMPLETION
TIME
RELATED
OBJECTIVE
FUNCTIONS
..................
102
5.6.1
SUM
OF
COMPLETION
TIMES
...................................................
103
VIII
5.6.2
SUM
OF
WEIGHTED
COMPLETION
TIMES
.................................
109
5.7
CONCLUSIONS
AND
OUTLOOK
...................................................................
109
IV
CLOSING
113
6
CONCLUSIONS
AND
FURTHER
RESEARCH
115
BIBLIOGRAPHY
119
A
FULL
NUMERICAL
STUDY
OF
THE
NOMINAL
BAP
WITH
INITIAL
BOUNDS
127
B
COMPLEXITY
TABLES
FOR
SCHEDULING
WITH
PREFABRICATION
131
C
SCIENTIFIC
CAREER
133
D
WISSENSCHAFTLICHER
WERDEGANG
135
IX
|
| adam_txt |
CONTENTS
1
INTRODUCTION
1
1.1
MOTIVATIONS
.
1
1.2
OUTLINE
OF
THE
THESIS
.
3
1.3
CREDITS
.
4
1
FUNDAMENTALS
5
NOMENCLATURE
7
2
DEFINITIONS
AND
PRELIMINARIES
11
2.1
LINEAR
AND
INTEGER
PROGRAMMING
.
11
2.2
ROBUST
LINEAR
OPTIMIZATION
.
14
2.3
GRAPH
THEORY
.
16
2.4
SCHEDULING
THEORY
.
18
II
BUFFER
ALLOCATION
IN
FLOW
LINES
21
3
ROBUST
BUFFER
ALLOCATION
23
3.1
INTRODUCTION
.
23
3.2
DEFINITION
OF
THE
MODEL
.
25
3.2.1
THE
BUFFER
ALLOCATION
PROBLEM
IN
THE
NOMINAL
CASE
.
25
3.2.2
DEFINITION
OF
THE
UNCERTAINTY
SET
.
27
3.2.3
FORMULATION
OF
THE
ROBUST
COUNTERPART
.
29
3.2.4
A
NOTE
ON
WARM-UP
.
31
3.3
REDUCTION
TO
A
LONGEST
PATH
PROBLEM
.
32
3.3.1
GRAPH
REPRESENTATION
.
32
3.3.2
LONGEST
PATHS
IN
THE
NOMINAL
CASE
.
34
3.3.3
INTRODUCTION
OF
THE
UNCERTAINTY
.
35
3.4
GENERAL
MIP-FORMULATION
.
39
3.4.1
LONGEST
PATH
FORMULATION
.
39
VII
3.4.2
DUALIZATION
AND
GENERAL
FORMULATION
.
39
3.5
REDUCING
COMPUTATION
TIMES
.
41
3.5.1
DERIVATION
OF
INITIAL
BOUNDS
.
41
3.5.2
SIMPLIFICATIONS
OF
THE
GRAPH
.
44
3.5.3
DISCUSSION
ON
THE
INFLUENCE
OF
THE
GAMMA-PARAMETER
.
.
49
3.6
NUMERICAL
STUDY
.
53
3.6.1
METHODOLOGY
.
53
3.6.2
RESULTS
.
54
3.7
CONCLUSIONS
.
57
4
SPEEDING
UP
BUFFER
ALLOCATION
59
4.1
INTRODUCTION
.
59
4.2
EXACT
BUFFER
ALLOCATION
WITHOUT
WARM-UP
.
61
4.2.1
NOTATIONS
AND
MODELLING
.
61
4.2.2
COMBINATORIAL
CUTS
.
63
4.2.3
INDIVIDUAL
BOUNDS
BY
SUBSYSTEMS
.
68
4.3
GENERALIZATION
TO
THE
CASE
USING
WARM-UP
.
70
4.3.1
ISSUES
WITH
THE
PREVIOUS
METHODS
.
70
4.3.2
ALTERNATIVE
DEFINITION
FOR
THE
THROUGHPUT
.
73
4.3.3
EXTENDING
THE
SUBSYSTEMS
*
METHOD
.
76
4.4
USING
GLOBAL
LOWER
BOUNDS
.
78
4.5
NUMERICAL
STUDY
.
81
4.5.1
METHODOLOGY
.
81
4.5.2
IMPACT
OF
THE
ADAPTED
LOWER
BOUNDS
.
82
4.5.3
COMPARISON
WITH
THE
GLOBAL
BOUNDS
METHOD
.
83
4.6
CONCLUSIONS
AND
OUTLOOK
.
84
III
SCHEDULING
WITH
INVENTORY
CONSTRAINTS
87
5
SCHEDULING
WITH
PREFABRICATION
89
5.1
INTRODUCTION
.
89
5.2
PROBLEM
DEFINITION
.
91
5.3
RELATED
RESEARCH
.
95
5.4
REGULAR
OBJECTIVES
.
96
5.5
LATENESS
RELATED
OBJECTIVE
FUNCTIONS
.
98
5.5.1
MAXIMUM
LATENESS
.
98
5.5.2
NUMBER
OF
TARDY
JOBS
.
101
5.6
TOTAL
COMPLETION
TIME
RELATED
OBJECTIVE
FUNCTIONS
.
102
5.6.1
SUM
OF
COMPLETION
TIMES
.
103
VIII
5.6.2
SUM
OF
WEIGHTED
COMPLETION
TIMES
.
109
5.7
CONCLUSIONS
AND
OUTLOOK
.
109
IV
CLOSING
113
6
CONCLUSIONS
AND
FURTHER
RESEARCH
115
BIBLIOGRAPHY
119
A
FULL
NUMERICAL
STUDY
OF
THE
NOMINAL
BAP
WITH
INITIAL
BOUNDS
127
B
COMPLEXITY
TABLES
FOR
SCHEDULING
WITH
PREFABRICATION
131
C
SCIENTIFIC
CAREER
133
D
WISSENSCHAFTLICHER
WERDEGANG
135
IX |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Wortel, Pascal |
| author_GND | (DE-588)1213999790 |
| author_facet | Wortel, Pascal |
| author_role | aut |
| author_sort | Wortel, Pascal |
| author_variant | p w pw |
| building | Verbundindex |
| bvnumber | BV046881310 |
| ctrlnum | (OCoLC)1197717248 (DE-599)DNB1210659727 |
| discipline | Mathematik |
| discipline_str_mv | Mathematik |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02313nam a22005538c 4500</leader><controlfield tag="001">BV046881310</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">200903s2019 gw |||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1210659727</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1197717248</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1210659727</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BW</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Wortel, Pascal</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1213999790</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficient algorithms for production scheduling</subfield><subfield code="c">Pascal Wortel</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kaiserslautern</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">135 Seiten</subfield><subfield code="b">Diagramme</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="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Kaiserslautern</subfield><subfield code="d">2020</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Robuste Optimierung</subfield><subfield code="0">(DE-588)7752811-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fertigungsablauf</subfield><subfield code="0">(DE-588)4240895-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Zuordnungsproblem</subfield><subfield code="0">(DE-588)4068123-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Produktionsplanung</subfield><subfield code="0">(DE-588)4047360-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Planungsmodell</subfield><subfield code="0">(DE-588)4201187-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</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">Planungsmodell</subfield><subfield code="0">(DE-588)4201187-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Robuste Optimierung</subfield><subfield code="0">(DE-588)7752811-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Fertigungsablauf</subfield><subfield code="0">(DE-588)4240895-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Produktionsplanung</subfield><subfield code="0">(DE-588)4047360-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Planungsmodell</subfield><subfield code="0">(DE-588)4201187-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">NP-hartes Problem</subfield><subfield code="0">(DE-588)4621705-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="3"><subfield code="a">Zuordnungsproblem</subfield><subfield code="0">(DE-588)4068123-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="4"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="5"><subfield code="a">Robuste Optimierung</subfield><subfield code="0">(DE-588)7752811-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="6"><subfield code="a">Effizienter Algorithmus</subfield><subfield code="0">(DE-588)4125422-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</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=032291311&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-032291311</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV046881310 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:18:22Z |
| indexdate | 2024-07-10T08:56:26Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032291311 |
| oclc_num | 1197717248 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR |
| owner_facet | DE-355 DE-BY-UBR |
| physical | 135 Seiten Diagramme |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| record_format | marc |
| spelling | Wortel, Pascal Verfasser (DE-588)1213999790 aut Efficient algorithms for production scheduling Pascal Wortel Kaiserslautern 2019 135 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Dissertation Technische Universität Kaiserslautern 2020 Robuste Optimierung (DE-588)7752811-6 gnd rswk-swf Fertigungsablauf (DE-588)4240895-7 gnd rswk-swf Zuordnungsproblem (DE-588)4068123-3 gnd rswk-swf Produktionsplanung (DE-588)4047360-0 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Planungsmodell (DE-588)4201187-5 gnd rswk-swf NP-hartes Problem (DE-588)4621705-8 gnd rswk-swf Effizienter Algorithmus (DE-588)4125422-3 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Planungsmodell (DE-588)4201187-5 s Robuste Optimierung (DE-588)7752811-6 s Fertigungsablauf (DE-588)4240895-7 s DE-604 Produktionsplanung (DE-588)4047360-0 s NP-hartes Problem (DE-588)4621705-8 s Zuordnungsproblem (DE-588)4068123-3 s Reihenfolgeproblem (DE-588)4242167-6 s Effizienter Algorithmus (DE-588)4125422-3 s DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032291311&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Wortel, Pascal Efficient algorithms for production scheduling Robuste Optimierung (DE-588)7752811-6 gnd Fertigungsablauf (DE-588)4240895-7 gnd Zuordnungsproblem (DE-588)4068123-3 gnd Produktionsplanung (DE-588)4047360-0 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Planungsmodell (DE-588)4201187-5 gnd NP-hartes Problem (DE-588)4621705-8 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| subject_GND | (DE-588)7752811-6 (DE-588)4240895-7 (DE-588)4068123-3 (DE-588)4047360-0 (DE-588)4242167-6 (DE-588)4201187-5 (DE-588)4621705-8 (DE-588)4125422-3 (DE-588)4113937-9 |
| title | Efficient algorithms for production scheduling |
| title_auth | Efficient algorithms for production scheduling |
| title_exact_search | Efficient algorithms for production scheduling |
| title_exact_search_txtP | Efficient algorithms for production scheduling |
| title_full | Efficient algorithms for production scheduling Pascal Wortel |
| title_fullStr | Efficient algorithms for production scheduling Pascal Wortel |
| title_full_unstemmed | Efficient algorithms for production scheduling Pascal Wortel |
| title_short | Efficient algorithms for production scheduling |
| title_sort | efficient algorithms for production scheduling |
| topic | Robuste Optimierung (DE-588)7752811-6 gnd Fertigungsablauf (DE-588)4240895-7 gnd Zuordnungsproblem (DE-588)4068123-3 gnd Produktionsplanung (DE-588)4047360-0 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Planungsmodell (DE-588)4201187-5 gnd NP-hartes Problem (DE-588)4621705-8 gnd Effizienter Algorithmus (DE-588)4125422-3 gnd |
| topic_facet | Robuste Optimierung Fertigungsablauf Zuordnungsproblem Produktionsplanung Reihenfolgeproblem Planungsmodell NP-hartes Problem Effizienter Algorithmus Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=032291311&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT wortelpascal efficientalgorithmsforproductionscheduling |