The representation of partially-concurrent open shop problems (Q2398435)
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 6760743
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The representation of partially-concurrent open shop problems |
scientific article; zbMATH DE number 6760743 |
Statements
The representation of partially-concurrent open shop problems (English)
0 references
16 August 2017
0 references
open shop scheduling
0 references
concurrent machines
0 references
technician timetabling
0 references
matrix representation
0 references
graph orientation
0 references
reducibility
0 references
0 references
0 references
0 references
0.8567758202552795
0 references
0.7974331974983215
0 references
0.7732250094413757
0 references
0.7572004199028015
0 references
0.7523461580276489
0 references
