A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q826116 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Sergey Sevast'janov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / 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: An Algorithm for the Open-Shop Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4744042 / rank | |||
Normal rank | |||
Latest revision as of 15:50, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time open-shop problem with an arbitrary number of machines |
scientific article |
Statements
A polynomial-time open-shop problem with an arbitrary number of machines (English)
0 references
20 January 1997
0 references
open-shop problem
0 references
scheduling theory
0 references
