Optimal algorithms for various classes of multiple resource-constrained project scheduling problems: proefschrift
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | Undetermined |
| Published: |
[Leuven]
Fac. der Economische en Toegepaste Economische Wetenschappen
1992
|
| Series: | Katholieke Universiteit <Louvain> / Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen
80 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | X, 180 S. graph. Darst. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008938221 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940228s1992 d||| |||| 00||| undod | ||
| 035 | |a (OCoLC)165246150 | ||
| 035 | |a (DE-599)BVBBV008938221 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-12 | ||
| 100 | 1 | |a Demeulemeester, Erik |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Optimal algorithms for various classes of multiple resource-constrained project scheduling problems |b proefschrift |c voorgedragen ... door Erik Demeulemeester |
| 264 | 1 | |a [Leuven] |b Fac. der Economische en Toegepaste Economische Wetenschappen |c 1992 | |
| 300 | |a X, 180 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Katholieke Universiteit <Louvain> / Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen |v 80 | |
| 650 | 0 | 7 | |a Projektplanung |0 (DE-588)4115649-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Erschöpfbare Ressourcen |0 (DE-588)4113467-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Projektplanung |0 (DE-588)4115649-3 |D s |
| 689 | 0 | 1 | |a Erschöpfbare Ressourcen |0 (DE-588)4113467-9 |D s |
| 689 | 0 | 2 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 3 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 810 | 2 | |a Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen |t Katholieke Universiteit <Louvain> |v 80 |w (DE-604)BV000002366 |9 80 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005895416&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005895416 | ||
Record in the Search Index
| _version_ | 1804123268209180672 |
|---|---|
| adam_text | vi
Table of contents
Table of contents vi
List of tables ix
List of figures x
Chapter 1 : Introduction 1
1.1 Problem formulation 1
1.1.1 The resource constrained, project scheduling problem .... 5
1.1.2 The generalized resource constrained project scheduling
problem 8
1.1.3 The preemptive resource constrained project scheduling
problem 11
1.1.4 The resource investment problem 13
1.2 Branch and bound 14
1.3 Definition of parameters and variables 19
1.4 Overview of the dissertation 23
Chapter 2 : The Resource Constrained Project Scheduling Problem
(RCPSP) 2 6
2.1 Literature review 2 6
2.1.1 Integer linear programming 26
2.1.2 Dynamic programming 29
2.1.3 Implicit enumeration 30
2.2 Solution methodology 38
2.2.1 A complete enumeration algorithm 39
2.2.2 Dominance rules and lower bound calculations 47
2.2.2.1 Dominance rules 47
2.2.2.2 Lower bound calculations 54
2.2.3 Branch and bound algorithm 62
2.3 Computational experience 75
2.3.1 Patterson test problems : effect of dominance rules and
lower bounds 7 5
2.3.2 Patterson test problems : comparison with Stinson s
procedure 7 8
2.3.3 The Alvarez Valdes problem set 80
vii
Chapter 3 : The Generalized Resource Constrained Project Scheduling
Problem (GRCPSP) 84
3.1 Literature review 84
3 .2 Solution methodology 85
3.2.1 Conversion of precedence diagramming relations 85
3.2.2 Ready times and due dates 87
3.2.3 Dominance rules 88
3.2.4 Lower bound calculations 92
3.2.5 The branch and bound procedure 94
3.2.6 Numerical example 97
3.3 Computational experience 104
Chapter 4 : The Preemptive Resource Constrained Project Scheduling
Problem (PRCPSP) 108
4.1 Literature review 108
4.2 Solution methodology 112
4.2.1 An additional assumption . 112
4.2.2 The introduction of subactivities 112
4.2.3 Dominance rules 113
4.2.4 Lower bound calculation 119
4.2.5 The branch and bound procedure 120
4.2.6 Numerical example 122
4.3 Computational experience 128
4.3.1 Constant resource availabilities 128
4.3.2 Variable resource availabilities 129
Chapter ^ • The Resource Investment Problem (RTP^ 133
5.1 Literature review 133
5.2 Solution methodology 135
5.2.1 Recapitulation 135
5.2.2 Search strategies 136
5.2.3 Solution procedure 139
5.2.4 Numerical example 1.43
5.3 Computational experience 145
5.3.1 Comparison with Mohring s procedure 145
5.3.2 Classical RIP 146
5.3.3 Generalized RIP 148
5.3.4 Preemptive RIP 150
viii
Chapter 6 : Summary. Conclusions and Racommfinciations for Future
Research 152
6.1 Summary and conclusions 152
6.2 Recommendations for future research 156
6.2.1 Branch and bound 156
6.2.2 Project scheduling 158
6.2.3 Production planning 159
6.2.3.1 One process batch where the process batch size
equals the transfer batch size 161
6.2.3.2 One process batch where the process batch size
is twice the transfer batch size 163
6.2.3.3 One process batch with a transfer batch size
of one 164
6.2.3.4 Two process batches where the process batch size
equals the transfer batch size 165
6.2.3.5 Two process batches where the process batch size
is twice the transfer 166
6.2.3.6 Two process batches with a transfer batch size
of one 166
Bibliography 169
List of doctoral dissertations 174
|
| any_adam_object | 1 |
| author | Demeulemeester, Erik |
| author_facet | Demeulemeester, Erik |
| author_role | aut |
| author_sort | Demeulemeester, Erik |
| author_variant | e d ed |
| building | Verbundindex |
| bvnumber | BV008938221 |
| ctrlnum | (OCoLC)165246150 (DE-599)BVBBV008938221 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02033nam a2200385 cb4500</leader><controlfield tag="001">BV008938221</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940228s1992 d||| |||| 00||| undod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)165246150</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008938221</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Demeulemeester, Erik</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimal algorithms for various classes of multiple resource-constrained project scheduling problems</subfield><subfield code="b">proefschrift</subfield><subfield code="c">voorgedragen ... door Erik Demeulemeester</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">[Leuven]</subfield><subfield code="b">Fac. der Economische en Toegepaste Economische Wetenschappen</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 180 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">Katholieke Universiteit <Louvain> / Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen</subfield><subfield code="v">80</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Projektplanung</subfield><subfield code="0">(DE-588)4115649-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erschöpfbare Ressourcen</subfield><subfield code="0">(DE-588)4113467-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Projektplanung</subfield><subfield code="0">(DE-588)4115649-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Erschöpfbare Ressourcen</subfield><subfield code="0">(DE-588)4113467-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen</subfield><subfield code="t">Katholieke Universiteit <Louvain></subfield><subfield code="v">80</subfield><subfield code="w">(DE-604)BV000002366</subfield><subfield code="9">80</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ 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=005895416&sequence=000002&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-005895416</subfield></datafield></record></collection> |
| id | DE-604.BV008938221 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:27:04Z |
| institution | BVB |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005895416 |
| oclc_num | 165246150 |
| open_access_boolean | |
| owner | DE-12 |
| owner_facet | DE-12 |
| physical | X, 180 S. graph. Darst. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Fac. der Economische en Toegepaste Economische Wetenschappen |
| record_format | marc |
| series2 | Katholieke Universiteit <Louvain> / Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen |
| spelling | Demeulemeester, Erik Verfasser aut Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift voorgedragen ... door Erik Demeulemeester [Leuven] Fac. der Economische en Toegepaste Economische Wetenschappen 1992 X, 180 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Katholieke Universiteit <Louvain> / Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen 80 Projektplanung (DE-588)4115649-3 gnd rswk-swf Erschöpfbare Ressourcen (DE-588)4113467-9 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Projektplanung (DE-588)4115649-3 s Erschöpfbare Ressourcen (DE-588)4113467-9 s Optimierung (DE-588)4043664-0 s Algorithmus (DE-588)4001183-5 s DE-604 Faculteit der Economische en Toegepaste Economische Wetenschappen: Katholieke Universiteit Leuven, Faculteit der Economische en Toegepaste Economische Wetenschappen Katholieke Universiteit <Louvain> 80 (DE-604)BV000002366 80 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005895416&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Demeulemeester, Erik Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift Projektplanung (DE-588)4115649-3 gnd Erschöpfbare Ressourcen (DE-588)4113467-9 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4115649-3 (DE-588)4113467-9 (DE-588)4043664-0 (DE-588)4001183-5 |
| title | Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift |
| title_auth | Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift |
| title_exact_search | Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift |
| title_full | Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift voorgedragen ... door Erik Demeulemeester |
| title_fullStr | Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift voorgedragen ... door Erik Demeulemeester |
| title_full_unstemmed | Optimal algorithms for various classes of multiple resource-constrained project scheduling problems proefschrift voorgedragen ... door Erik Demeulemeester |
| title_short | Optimal algorithms for various classes of multiple resource-constrained project scheduling problems |
| title_sort | optimal algorithms for various classes of multiple resource constrained project scheduling problems proefschrift |
| title_sub | proefschrift |
| topic | Projektplanung (DE-588)4115649-3 gnd Erschöpfbare Ressourcen (DE-588)4113467-9 gnd Optimierung (DE-588)4043664-0 gnd Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Projektplanung Erschöpfbare Ressourcen Optimierung Algorithmus |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005895416&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000002366 |
| work_keys_str_mv | AT demeulemeestererik optimalalgorithmsforvariousclassesofmultipleresourceconstrainedprojectschedulingproblemsproefschrift |