On not-first/not-last conditions in disjunctive scheduling (Q1590039)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On not-first/not-last conditions in disjunctive scheduling |
scientific article; zbMATH DE number 1545195
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On not-first/not-last conditions in disjunctive scheduling |
scientific article; zbMATH DE number 1545195 |
Statements
On not-first/not-last conditions in disjunctive scheduling (English)
0 references
19 December 2000
0 references
constraint propagation
0 references
edge-finding
0 references
time-bound adjustment
0 references
branch and bound
0 references
job shop
0 references
lower bounds
0 references
0 references
0 references
0 references
0.83641464
0 references
0.8215356
0 references
0.81850207
0 references
0.8168762
0 references
0.81553483
0 references
0.81553483
0 references
0.81235576
0 references
