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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-012-1075-8 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-012-1075-8 / rank | |||
Normal rank | |||
Latest revision as of 09:09, 11 December 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
