An acyclic days-off scheduling problem (Q862817)
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 5118375
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An acyclic days-off scheduling problem |
scientific article; zbMATH DE number 5118375 |
Statements
An acyclic days-off scheduling problem (English)
0 references
24 January 2007
0 references
workforce scheduling
0 references
discrete tomography
0 references
maximum flow
0 references
polynomial time algorithm
0 references
acyclic scheduling
0 references
0.831207275390625
0 references
0.8205286860466003
0 references
0.8165749907493591
0 references
0.8160433173179626
0 references
0.8120531439781189
0 references
