Constraint-based scheduling: applying constraint programming to scheduling problems
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Boston [u.a.]
Kluwer
2001
|
Schriftenreihe: | International series in operations research & management science
39 |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | XII, 198 S. graph. Darst. |
ISBN: | 0792374088 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV014181975 | ||
003 | DE-604 | ||
005 | 20120903 | ||
007 | t | ||
008 | 020301s2001 d||| |||| 00||| eng d | ||
020 | |a 0792374088 |9 0-7923-7408-8 | ||
035 | |a (OCoLC)248170887 | ||
035 | |a (DE-599)BVBBV014181975 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-20 |a DE-703 |a DE-945 |a DE-83 | ||
050 | 0 | |a TS157.5 | |
082 | 0 | |a 658.53 | |
084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
084 | |a ST 302 |0 (DE-625)143652: |2 rvk | ||
084 | |a 90B35 |2 msc | ||
100 | 1 | |a Baptiste, Philippe |e Verfasser |4 aut | |
245 | 1 | 0 | |a Constraint-based scheduling |b applying constraint programming to scheduling problems |c Philippe Baptiste ; Claude Le Pape ; Wim Nuijten |
246 | 1 | 3 | |a Constraint based scheduling |
264 | 1 | |a Boston [u.a.] |b Kluwer |c 2001 | |
300 | |a XII, 198 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a International series in operations research & management science |v 39 | |
650 | 4 | |a Constraints (Artificial intelligence) | |
650 | 4 | |a Production scheduling | |
650 | 0 | 7 | |a Ablaufplanung |0 (DE-588)4122751-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Maschinelles Lernen |0 (DE-588)4193754-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Constraint-Programmierung |0 (DE-588)4567206-4 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
689 | 0 | 1 | |a Ablaufplanung |0 (DE-588)4122751-7 |D s |
689 | 0 | 2 | |a Constraint-Programmierung |0 (DE-588)4567206-4 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Maschinelles Lernen |0 (DE-588)4193754-5 |D s |
689 | 1 | 1 | |a Künstliche Intelligenz |0 (DE-588)4033447-8 |D s |
689 | 1 | |5 DE-604 | |
700 | 1 | |a Le Pape, Claude |e Verfasser |4 aut | |
700 | 1 | |a Nuijten, Wim |e Verfasser |4 aut | |
830 | 0 | |a International series in operations research & management science |v 39 |w (DE-604)BV011630976 |9 39 | |
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=009720092&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
999 | |a oai:aleph.bib-bvb.de:BVB01-009720092 |
Datensatz im Suchindex
_version_ | 1804129058970140672 |
---|---|
adam_text | Foreword ix
Preface xi
Acknowledgments xiii
1. INTRODUCTION 1
1.1 Introduction to Constraint Programming 1
1.2 Scheduling Theory 9
1.2.1 Graham s Classification 10
1.3 A Constraint Based Scheduling Model 12
1.3.1 Activities 12
1.3.2 Temporal Relations 15
1.3.3 Resource Constraints 15
1.3.4 Extensions of the Model 16
1.3.5 Objective Function 18
2. PROPAGATION OF THE ONE MACHINE RESOURCE
CONSTRAINT 19
2.1 Non Preemptive Problems 19
2.1.1 Time Table Constraint 19
2.1.2 Disjunctive Constraint Propagation 21
2.1.3 Edge Finding 22
2.1.4 Not First, Not Last 26
2.1.5 More Propagation 29
2.2 Preemptive Problems 31
2.2.1 Time Table Constraint 32
2.2.2 Disjunctive Constraint Propagation 33
2.2.3 Network Flow Based Constraints 33
2.2.4 Preemptive Edge Finding 37
3. PROPAGATION OF CUMULATIVE CONSTRAINTS 43
3.1 Fully Elastic Problems 44
3.2 Preemptive Problems 46
3.2.1 Time Table Constraint 46
3.2.2 Disjunctive Constraint 46
3.2.3 Partially Elastic Relaxation 46
3.3 Non Preemptive Problems 58 r
3.3.1 Time Table Constraint 58
3.3.2 Disjunctive Constraint 59
3.3.3 Edge Finding 59
3.3.4 Extended Edge Finding 64
3.3.5 Not First, Not Last 65
3.3.6 Energetic Reasoning 67
[. COMPARISON OF PROPAGATION TECHNIQUES 77
4.1 Constraint Propagation Rules 77
4.1.1 Time Table Constraints 80
4.1.2 Disjunctive Constraints 81
4.1.3 Edge Finding 81
4.1.4 Not First, Not Last 83
4.1.5 Energetic Reasoning 83
4.2 Dominance Relations 85
4.2.1 The Fully Elastic Case 87
4.2.2 The Cumulative Preemptive Case 87
4.2.3 The One Machine Preemptive Case 87
4.2.4 The Cumulative Non Preemptive Case , 88
4.2.5 The One Machine Non Preemptive Case 91
4.3 Non Dominance Relations 92
4.3.1 General Counterexamples 93
4.3.2 A One Machine Preemptive Counterexample 96
4.3.3 Cumulative Counterexamples 96
4.4 Summary 99
4.4.1 The Fully Elastic Case 99
4.4.2 The Cumulative Preemptive Case 100
4.4.3 The One Machine Preemptive Case 100
4.4.4 The Cumulative Non Preemptive Case 100
4.4.5 The One Machine Non Preemptive Case 101
5. PROPAGATION OF OBJECTIVE FUNCTIONS 105
5.1 Total Weighted Number of Late Activities 105
5.1.1 Complexity Results 106
5.1.2 A Lower Bound of the Number of Late Activities 108
5.1.3 Constraint Propagation 117
5.2 Sum of Transition Times and Sum of Transition Costs 122 r
5.2.1 Route Optimization Constraint 124 I
5.2.2 Precedence Graph Constraint 126
5.3 Conclusion 127
6. RESOLUTION OF DISJUNCTIVE PROBLEMS 129
6.1 Job Shop Scheduling 129
6.1.1 Branching Scheme 130
6.1.2 Computational Results 131
6.2 Open Shop Scheduling 132
6.2.1 Branching Scheme 132
6.2.2 More and More Propagation: Shaving 132
6.2.3 Computational Results 133
6.2.4 Conclusion 134
6.3 Preemptive Job Shop Scheduling 135
6.3.1 Dominance Relation 136
6.3.2 Branching Scheme 138
6.3.3 Heuristic Algorithms 140
6.3.4 Limited Discrepancy Search 142
7. CUMULATIVE SCHEDULING PROBLEMS 149
7.1 General Framework 151
7.2 Hybrid Flow Shop Scheduling 154
7.3 Resource Constrained Project Scheduling 155
7.4 Conclusion 156
8. MIN SUM SCHEDULING PROBLEMS 159
8.1 Minimizing the Weighted Number of Late Jobs 159
8.1.1 Dominance Relations 160
8.1.2 Branching Scheme 163
8.1.3 Computational Results 164
8.2 Minimizing Makespan and Sum of Transition Times 166
8.2.1 Problem Definition 166
8.2.2 Problem Solving 167
8.2.3 Computational Results 169
9. CONCLUSION 175
10. SUMMARY OF NOTATION 179
References
183
Index
197
|
any_adam_object | 1 |
author | Baptiste, Philippe Le Pape, Claude Nuijten, Wim |
author_facet | Baptiste, Philippe Le Pape, Claude Nuijten, Wim |
author_role | aut aut aut |
author_sort | Baptiste, Philippe |
author_variant | p b pb p c l pc pcl w n wn |
building | Verbundindex |
bvnumber | BV014181975 |
callnumber-first | T - Technology |
callnumber-label | TS157 |
callnumber-raw | TS157.5 |
callnumber-search | TS157.5 |
callnumber-sort | TS 3157.5 |
callnumber-subject | TS - Manufactures |
classification_rvk | QH 465 SK 970 ST 302 |
ctrlnum | (OCoLC)248170887 (DE-599)BVBBV014181975 |
dewey-full | 658.53 |
dewey-hundreds | 600 - Technology (Applied sciences) |
dewey-ones | 658 - General management |
dewey-raw | 658.53 |
dewey-search | 658.53 |
dewey-sort | 3658.53 |
dewey-tens | 650 - Management and auxiliary services |
discipline | Informatik Mathematik Wirtschaftswissenschaften |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02381nam a2200565 cb4500</leader><controlfield tag="001">BV014181975</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120903 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020301s2001 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792374088</subfield><subfield code="9">0-7923-7408-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248170887</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014181975</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-945</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TS157.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.53</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 465</subfield><subfield code="0">(DE-625)141600:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 302</subfield><subfield code="0">(DE-625)143652:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">90B35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baptiste, Philippe</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Constraint-based scheduling</subfield><subfield code="b">applying constraint programming to scheduling problems</subfield><subfield code="c">Philippe Baptiste ; Claude Le Pape ; Wim Nuijten</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Constraint based scheduling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Kluwer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 198 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">International series in operations research & management science</subfield><subfield code="v">39</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraints (Artificial intelligence)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Ablaufplanung</subfield><subfield code="0">(DE-588)4122751-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Maschinelles Lernen</subfield><subfield code="0">(DE-588)4193754-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint-Programmierung</subfield><subfield code="0">(DE-588)4567206-4</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">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="689" ind1="0" ind2="0"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Ablaufplanung</subfield><subfield code="0">(DE-588)4122751-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Constraint-Programmierung</subfield><subfield code="0">(DE-588)4567206-4</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">Maschinelles Lernen</subfield><subfield code="0">(DE-588)4193754-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Le Pape, Claude</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nuijten, Wim</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">International series in operations research & management science</subfield><subfield code="v">39</subfield><subfield code="w">(DE-604)BV011630976</subfield><subfield code="9">39</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=009720092&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-009720092</subfield></datafield></record></collection> |
id | DE-604.BV014181975 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:59:06Z |
institution | BVB |
isbn | 0792374088 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009720092 |
oclc_num | 248170887 |
open_access_boolean | |
owner | DE-20 DE-703 DE-945 DE-83 |
owner_facet | DE-20 DE-703 DE-945 DE-83 |
physical | XII, 198 S. graph. Darst. |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Kluwer |
record_format | marc |
series | International series in operations research & management science |
series2 | International series in operations research & management science |
spelling | Baptiste, Philippe Verfasser aut Constraint-based scheduling applying constraint programming to scheduling problems Philippe Baptiste ; Claude Le Pape ; Wim Nuijten Constraint based scheduling Boston [u.a.] Kluwer 2001 XII, 198 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier International series in operations research & management science 39 Constraints (Artificial intelligence) Production scheduling Ablaufplanung (DE-588)4122751-7 gnd rswk-swf Maschinelles Lernen (DE-588)4193754-5 gnd rswk-swf Constraint-Programmierung (DE-588)4567206-4 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Künstliche Intelligenz (DE-588)4033447-8 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 s Ablaufplanung (DE-588)4122751-7 s Constraint-Programmierung (DE-588)4567206-4 s DE-604 Maschinelles Lernen (DE-588)4193754-5 s Künstliche Intelligenz (DE-588)4033447-8 s Le Pape, Claude Verfasser aut Nuijten, Wim Verfasser aut International series in operations research & management science 39 (DE-604)BV011630976 39 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009720092&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Baptiste, Philippe Le Pape, Claude Nuijten, Wim Constraint-based scheduling applying constraint programming to scheduling problems International series in operations research & management science Constraints (Artificial intelligence) Production scheduling Ablaufplanung (DE-588)4122751-7 gnd Maschinelles Lernen (DE-588)4193754-5 gnd Constraint-Programmierung (DE-588)4567206-4 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd |
subject_GND | (DE-588)4122751-7 (DE-588)4193754-5 (DE-588)4567206-4 (DE-588)4242167-6 (DE-588)4033447-8 |
title | Constraint-based scheduling applying constraint programming to scheduling problems |
title_alt | Constraint based scheduling |
title_auth | Constraint-based scheduling applying constraint programming to scheduling problems |
title_exact_search | Constraint-based scheduling applying constraint programming to scheduling problems |
title_full | Constraint-based scheduling applying constraint programming to scheduling problems Philippe Baptiste ; Claude Le Pape ; Wim Nuijten |
title_fullStr | Constraint-based scheduling applying constraint programming to scheduling problems Philippe Baptiste ; Claude Le Pape ; Wim Nuijten |
title_full_unstemmed | Constraint-based scheduling applying constraint programming to scheduling problems Philippe Baptiste ; Claude Le Pape ; Wim Nuijten |
title_short | Constraint-based scheduling |
title_sort | constraint based scheduling applying constraint programming to scheduling problems |
title_sub | applying constraint programming to scheduling problems |
topic | Constraints (Artificial intelligence) Production scheduling Ablaufplanung (DE-588)4122751-7 gnd Maschinelles Lernen (DE-588)4193754-5 gnd Constraint-Programmierung (DE-588)4567206-4 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd Künstliche Intelligenz (DE-588)4033447-8 gnd |
topic_facet | Constraints (Artificial intelligence) Production scheduling Ablaufplanung Maschinelles Lernen Constraint-Programmierung Reihenfolgeproblem Künstliche Intelligenz |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009720092&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
volume_link | (DE-604)BV011630976 |
work_keys_str_mv | AT baptistephilippe constraintbasedschedulingapplyingconstraintprogrammingtoschedulingproblems AT lepapeclaude constraintbasedschedulingapplyingconstraintprogrammingtoschedulingproblems AT nuijtenwim constraintbasedschedulingapplyingconstraintprogrammingtoschedulingproblems AT baptistephilippe constraintbasedscheduling AT lepapeclaude constraintbasedscheduling AT nuijtenwim constraintbasedscheduling |