New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (Q1761791): 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 05:36, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan |
scientific article |
Statements
New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan (English)
0 references
15 November 2012
0 references
scheduling
0 references
open shop
0 references
comparability graph
0 references
reducibility
0 references
complexity
0 references