A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:54, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job |
scientific article |
Statements
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (English)
0 references
13 May 2016
0 references
mixed-shop scheduling
0 references
polynomial-time algorithms
0 references
preemption
0 references