On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:09, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of two machine job-shop scheduling with regular objective functions |
scientific article |
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
