On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404)
From MaRDI portal
!
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 1094845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of two machine job-shop scheduling with regular objective functions |
scientific article; zbMATH DE number 1094845 |
Statements
On the complexity of two machine job-shop scheduling with regular objective functions (English)
0 references
4 December 1997
0 references
nonpreemptive two machine job-shop scheduling
0 references
polynomial time
0 references
0 references
0.92197067
0 references
0.8875935
0 references
0.8795074
0 references
0.8776599
0 references
0.87689257
0 references
0.87524354
0 references
0.87459403
0 references
0.87346023
0 references
0.87261736
0 references
