An optimal method for the preemptive job shop scheduling problem (Q502444)
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: An optimal method for the preemptive job shop scheduling problem |
scientific article; zbMATH DE number 6670621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal method for the preemptive job shop scheduling problem |
scientific article; zbMATH DE number 6670621 |
Statements
An optimal method for the preemptive job shop scheduling problem (English)
0 references
5 January 2017
0 references
scheduling
0 references
branch and bound
0 references
preemption
0 references
job shop
0 references
disjunctive graph
0 references
0.92322785
0 references
0.91379595
0 references
0.90958405
0 references
0.89703274
0 references
0.89368457
0 references
0.89310837
0 references
0 references
0.8926159
0 references
0 references
0.8876825
0 references
