A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6580424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job |
scientific article; zbMATH DE number 6580424 |
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
0 references
0.8407110571861267
0 references
0.8151304125785828
0 references
0.8143905401229858
0 references
0.8049328923225403
0 references
0.8030484914779663
0 references
