A Computational Study of the Job-Shop Scheduling Problem (Q4025904)
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 124254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Computational Study of the Job-Shop Scheduling Problem |
scientific article; zbMATH DE number 124254 |
Statements
A Computational Study of the Job-Shop Scheduling Problem (English)
0 references
18 February 1993
0 references
job-shop scheduling
0 references
heuristic procedure
0 references
cutting-plane method
0 references
lower bounds
0 references
branch and bound
0 references
0.8838698267936707
0 references
0.8822704553604126
0 references
0.8645704388618469
0 references
0.8361647725105286
0 references
0.8322259187698364
0 references
