Scheduling tasks with sequence-dependent processing times (Q3786260)
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: Scheduling tasks with sequence-dependent processing times |
scientific article; zbMATH DE number 4049365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling tasks with sequence-dependent processing times |
scientific article; zbMATH DE number 4049365 |
Statements
1988
0 references
minimal completion time
0 references
asymmetric traveling salesman
0 references
single machine
0 references
branch-and-bound
0 references
lower bounds
0 references
dominance criteria
0 references
Scheduling tasks with sequence-dependent processing times (English)
0 references
0.8395869135856628
0 references
0.8381271362304688
0 references
0.8216582536697388
0 references
0.8214989900588989
0 references
0.8164392709732056
0 references
