On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:07, 5 March 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