A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows (Q3157711)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows |
scientific article |
Statements
A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows (English)
0 references
19 January 2005
0 references
shift scheduling
0 references
service operations management
0 references
integer programming
0 references
