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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10479-012-1075-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979873925 / rank | |||
Normal rank | |||
Revision as of 19:28, 19 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
