A practical use of Jackson's preemptive schedule for solving the job shop problem (Q922282)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4167837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A practical use of Jackson's preemptive schedule for solving the job shop problem |
scientific article; zbMATH DE number 4167837 |
Statements
A practical use of Jackson's preemptive schedule for solving the job shop problem (English)
0 references
1990
0 references
polynomial algorithm
0 references
job shop
0 references
Jackson's preemptive schedule
0 references
branch and bound
0 references
0.89703274
0 references
0.8821592
0 references
0.8757322
0 references
0.8591802
0 references
0.8568861
0 references
0.85656756
0 references
0.8515976
0 references
0.8510233
0 references
0.8466747
0 references
