Scheduling algorithms: with 18 tables
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1998
|
| Ausgabe: | 2., rev. and enl. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 321 - 337 |
| Beschreibung: | XII, 342 S. graph. Darst. |
| ISBN: | 354064105X |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV011814884 | ||
| 003 | DE-604 | ||
| 005 | 19980918 | ||
| 007 | t | ||
| 008 | 980303s1998 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 953032256 |2 DE-101 | |
| 020 | |a 354064105X |9 3-540-64105-X | ||
| 035 | |a (OCoLC)613607119 | ||
| 035 | |a (DE-599)BVBBV011814884 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-739 |a DE-355 |a DE-Aug4 |a DE-945 |a DE-521 |a DE-634 |a DE-83 |a DE-188 | ||
| 050 | 0 | |a QA76.9.C63B78 1998 | |
| 082 | 0 | |a 658.5/3 21 | |
| 084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a 90B35 |2 msc | ||
| 084 | |a 27 |2 sdnb | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Brucker, Peter |d 1942- |e Verfasser |0 (DE-588)118176757 |4 aut | |
| 245 | 1 | 0 | |a Scheduling algorithms |b with 18 tables |c Peter Brucker |
| 250 | |a 2., rev. and enl. ed. | ||
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1998 | |
| 300 | |a XII, 342 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 321 - 337 | ||
| 650 | 4 | |a Computer capacity -- Planning | |
| 650 | 4 | |a Production scheduling | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Scheduling |0 (DE-588)4179449-7 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4123623-3 |a Lehrbuch |2 gnd-content | |
| 689 | 0 | 0 | |a Scheduling |0 (DE-588)4179449-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 1 | |5 DE-188 | |
| 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=007978407&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007978407 | |
Datensatz im Suchindex
| _version_ | 1807501243179859968 |
|---|---|
| adam_text |
CONTENTS
PREFACE
VII
1
CLASSIFICATION
OF
SCHEDULING
PROBLEMS
1
1.1
SCHEDULING
PROBLEMS
.
1
1.2
JOB
DATA
.
2
1.3
JOB
CHARACTERISTICS
.
3
1.4
MACHINE
ENVIRONMENT
.
4
1.5
OPTIMALITY
CRITERIA
.
6
1.6
EXAMPLES
.
7
2
SOME
PROBLEMS
IN
COMBINATORIAL
OPTIMIZATION
11
2.1
LINEAR
AND
INTEGER
PROGRAMMING
.
11
2.2
TRANSSHIPMENT
PROBLEMS
.
12
2.3
THE
MAXIMUM
FLOW
PROBLEM
.
13
2.4
BIPARTITE
MATCHING
PROBLEMS
.
14
2.5
THE
ASSIGNMENT
PROBLEM
.
17
2.6
ARC
COLORING
OF
BIPARTITE
GRAPHS
.
22
2.7
SHORTEST
PATH
PROBLEMS
AND
DYNAMIC
PROGRAMMING
.
25
3
COMPUTATIONAL
COMPLEXITY
36
3.1
THE
CLASSES
P
AND
VP
.
36
3.2
VP-COMPLETE
AND
VP-HARD
PROBLEMS
.
\
YY
YY
YY
40
3.3
SIMPLE
REDUCTIONS
BETWEEN
SCHEDULING
PROBLEMS
.
47
3.4
LIVING
WITH
.VP-HARD
PROBLEMS
'.
.
50
3.4.1
LOCAL
SEARCH
TECHNIQUES
.
51
CONTENTS
3.4.2
BRANCH-AND-BOUND
ALGORITHMS
.
55
4
SINGLE
MACHINE
SCHEDULING
PROBLEMS
61
4.1
MINIMAX
CRITERIA
.
61
4.1.1
LAWLER
'
S
ALGORITHM
FOR
1
|
PREC
|
/
MAX
.
61
4.1.2
1
|
PREC\PJ
=
L;RJ
|
/
MAX
AND
1
|
PREC-PMTN-,RJ
|
/MAX
.
63
4.2
MAXIMUM
LATENESS
AND
RELATED
CRITERIA
.
.
A
.
67
4.3
TOTAL
WEIGHTED
COMPLETION
TIME
.
73
4.3.1
1
|
TREE
|
WJCJ
.
73
4.3.2
1
|
SP-GRAPH
|
^2
W
JCJ
.
80
4.4
WEIGHTED
NUMBER
OF
LATE
JOBS
.
85
4.4.1
1
|
RF,PJ
=
1
|
^WJUJ
.
85
4.4.2
1||U,
.
87
4.4.3
1
|
RJ;PMTN
|
^WJUJ
.
89
4.5
TOTAL
WEIGHTED
TARDINESS
.
94
4.6
COMPLEXITY
OF
SINGLE
MACHINE
PROBLEMS
.
99
5
PARALLEL
MACHINES
101
F
5.1
INDEPENDENT
JOBS
.
101
5.1.1
IDENTICAL
MACHINES
.
101
5.1.2
UNIFORM
MACHINES
.
116
5.1.3
UNRELATED
MACHINES
.
128
5.2
JOBS
WITH
PRECEDENCE
CONSTRAINTS
.
131
5.2.1
P
|
TREE-,
PI
=
1
|
L
MAX
-PROBLEMS
.
132
5.2.2
PROBLEM
P2
|
PREC;P,
=
1
|
L
MAX
.
137
5.3
COMPLEXITY
RESULTS
.
142
CONTENTS
XI
6
SHOP
SCHEDULING
PROBLEMS
145
6.1
THE
DISJUNCTIVE
GRAPH
MODEL
.
145
6.2
OPEN
SHOP
PROBLEMS
.
148
6.2.1
ARBITRARY
PROCESSING
TIMES
.
148
6.2.2
UNIT
PROCESSING
TIMES
.
'
.
.
.
.
151
6.3
FLOW
SHOP
PROBLEMS
.
164
6.3.1
MINIMIZING
MAKESPAN
.
165
6.4
JOB
SHOP
PROBLEMS
.
169
6.4.1
PROBLEMS
WITH
TWO
MACHINES
.
169
6.4.2
PROBLEMS
WITH
TWO
JOBS.
A
GEOMETRIC
APPROACH
177
6.4.3
JOB
SHOP
PROBLEMS
WITH
TWO
MACHINES
.
187
6.4.4
A
BRANCH-AND-BOUND
ALGORITHM
.
192
6.4.5
APPLYING
TABU-SEARCH
TO
THE
JOB
SHOP
PROBLEM
.
211
6.5
MIXED
SHOP
PROBLEMS
.
216
6.5.1
PROBLEMS
WITH
TWO
MACHINES
.
216
6.5.2
PROBLEMS
WITH
TWO
JOBS
.
217
6.6
COMPLEXITY
OF
SHOP
SCHEDULING
PROBLEMS
.
222
7
DUE-DATE
SCHEDULING
229
7.1
PROBLEM
1
|
DOP
T
|
|
|
+W
0
YY
D
.
229
7.2
PROBLEM
1
|
D
OP
|
WFC
22
EI
+
22
TI
+
W
OD
.
233
7.3
PROBLEM
1
|
D
|
22
W
I
I
YY( )
I
.
YY
.
.
235
7.4
PROBLEM
1
|
D
|
WE
22
EI
+
WT
^T
I
.
241
7.5
PROBLEM
1
|
D
|
|
LI
|
MAX
AND
1
|
D
OPT
|
|
LI
|
MAX
.
244
7.6
PROBLEM
1
|
D
OPT
|
22
W
I
I
LI
I
.
246
7.7
PROBLEM
1
|
D
|
22
W
I
LI
|
.
248
XII
CONTENTS
8
BATCHING
PROBLEMS
252
8.1
SINGLE
MACHINE
S-BATCHING
PROBLEMS
.
252
8.2
SINGLE
MACHINE
P-BATCHING
PROBLEMS
.
256
8.2.1
THE
UNBOUNDED
MODEL
.
256
8.2.2
THE
BOUNDED
MODEL
.
261
8.3
COMPLEXITY
RESULTS
FOR
SINGLE
MACHINE
BATCHING
PROBLEMS
262
9
CHANGEOVER
TIMES
AND
TRANSPORTATION
TIMES
264
9.1
SINGLE
MACHINE
PROBLEMS
.
1
.
265
9.2
PROBLEMS
WITH
PARALLEL
MACHINES
.
269
9.3
GENERAL
SHOP
PROBLEMS
.
273
10
MULTI-PURPOSE
MACHINES
274
10.1
MPM
PROBLEMS
WITH
IDENTICAL
AND
UNIFORM
MACHINES
.
275
10.2
MPM
PROBLEMS
WITH
SHOP
CHARACTERISTICS
.
281
10.2.1
ARBITRARY
PROCESSING
TIMES
.
281
10.2.2
UNIT
PROCESSING
TIMES
.
292
10.3
COMPLEXITY
RESULTS
.
295
11
MULTIPROCESSOR
TASKS
298
11.1
MULTIPROCESSOR
TASK
SYSTEMS
.
299
11.2
SHOP
PROBLEMS
WITH
MPT:
ARBITRARY
PROCESSING
TIMES
304
11.3
SHOP
PROBLEMS
WITH
MPT:
UNIT
PROCESSING
TIMES
.
.
.
309
11.4
MULTI-MODE
MULTIPROCESSOR-TASK
SCHEDULING
PROBLEM
.
.
316
11.5
COMPLEXITY
RESULTS
.
317
REFERENCES
321
INDEX
338 |
| any_adam_object | 1 |
| author | Brucker, Peter 1942- |
| author_GND | (DE-588)118176757 |
| author_facet | Brucker, Peter 1942- |
| author_role | aut |
| author_sort | Brucker, Peter 1942- |
| author_variant | p b pb |
| building | Verbundindex |
| bvnumber | BV011814884 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.C63B78 1998 |
| callnumber-search | QA76.9.C63B78 1998 |
| callnumber-sort | QA 276.9 C63 B78 41998 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | QH 465 SK 970 |
| ctrlnum | (OCoLC)613607119 (DE-599)BVBBV011814884 |
| dewey-full | 658.5/321 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.5/3 21 |
| dewey-search | 658.5/3 21 |
| dewey-sort | 3658.5 13 221 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| edition | 2., rev. and enl. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV011814884</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980918</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">980303s1998 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">953032256</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">354064105X</subfield><subfield code="9">3-540-64105-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)613607119</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011814884</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="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-945</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.C63B78 1998</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.5/3 21</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">90B35</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">27</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Brucker, Peter</subfield><subfield code="d">1942-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118176757</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling algorithms</subfield><subfield code="b">with 18 tables</subfield><subfield code="c">Peter Brucker</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2., rev. and enl. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1998</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 342 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="500" ind1=" " ind2=" "><subfield code="a">Literaturverz. S. 321 - 337</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer capacity -- Planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</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">Scheduling</subfield><subfield code="0">(DE-588)4179449-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4123623-3</subfield><subfield code="a">Lehrbuch</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-188</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=007978407&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007978407</subfield></datafield></record></collection> |
| genre | (DE-588)4123623-3 Lehrbuch gnd-content |
| genre_facet | Lehrbuch |
| id | DE-604.BV011814884 |
| illustrated | Illustrated |
| indexdate | 2024-08-16T00:18:30Z |
| institution | BVB |
| isbn | 354064105X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007978407 |
| oclc_num | 613607119 |
| open_access_boolean | |
| owner | DE-739 DE-355 DE-BY-UBR DE-Aug4 DE-945 DE-521 DE-634 DE-83 DE-188 |
| owner_facet | DE-739 DE-355 DE-BY-UBR DE-Aug4 DE-945 DE-521 DE-634 DE-83 DE-188 |
| physical | XII, 342 S. graph. Darst. |
| publishDate | 1998 |
| publishDateSearch | 1998 |
| publishDateSort | 1998 |
| publisher | Springer |
| record_format | marc |
| spelling | Brucker, Peter 1942- Verfasser (DE-588)118176757 aut Scheduling algorithms with 18 tables Peter Brucker 2., rev. and enl. ed. Berlin [u.a.] Springer 1998 XII, 342 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 321 - 337 Computer capacity -- Planning Production scheduling Computer algorithms Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Scheduling (DE-588)4179449-7 gnd rswk-swf (DE-588)4123623-3 Lehrbuch gnd-content Scheduling (DE-588)4179449-7 s DE-604 Reihenfolgeproblem (DE-588)4242167-6 s DE-188 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007978407&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Brucker, Peter 1942- Scheduling algorithms with 18 tables Computer capacity -- Planning Production scheduling Computer algorithms Reihenfolgeproblem (DE-588)4242167-6 gnd Scheduling (DE-588)4179449-7 gnd |
| subject_GND | (DE-588)4242167-6 (DE-588)4179449-7 (DE-588)4123623-3 |
| title | Scheduling algorithms with 18 tables |
| title_auth | Scheduling algorithms with 18 tables |
| title_exact_search | Scheduling algorithms with 18 tables |
| title_full | Scheduling algorithms with 18 tables Peter Brucker |
| title_fullStr | Scheduling algorithms with 18 tables Peter Brucker |
| title_full_unstemmed | Scheduling algorithms with 18 tables Peter Brucker |
| title_short | Scheduling algorithms |
| title_sort | scheduling algorithms with 18 tables |
| title_sub | with 18 tables |
| topic | Computer capacity -- Planning Production scheduling Computer algorithms Reihenfolgeproblem (DE-588)4242167-6 gnd Scheduling (DE-588)4179449-7 gnd |
| topic_facet | Computer capacity -- Planning Production scheduling Computer algorithms Reihenfolgeproblem Scheduling Lehrbuch |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007978407&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT bruckerpeter schedulingalgorithmswith18tables |