A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows (Q3157711): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1057/palgrave.jors.2600472 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064678792 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:55, 19 March 2024
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
