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 OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q2744381 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the set of solutions of the open shop problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4882995 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3517651 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithmic graph theory and perfect graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comparability graphs and a new matroid / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Modular decomposition and transitive orientation / rank | |||
Normal rank | |||
Latest revision as of 21:00, 5 July 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
