A polynomial algorithm for an open shop problem with unit processing times and tree constraints (Q1804876): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(93)e0156-s / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003459360 / rank | |||
Normal rank | |||
Latest revision as of 10:22, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for an open shop problem with unit processing times and tree constraints |
scientific article |
Statements
A polynomial algorithm for an open shop problem with unit processing times and tree constraints (English)
0 references
17 May 1995
0 references
open shop problem
0 references
unit processing times
0 references
tree constraints
0 references
polynomial algorithm
0 references
0 references
