A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205)
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 matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem |
scientific article; zbMATH DE number 6968102
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem |
scientific article; zbMATH DE number 6968102 |
Statements
A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (English)
0 references
30 October 2018
0 references
scheduling
0 references
shift scheduling problem
0 references
context-free grammar
0 references
Lagrangian relaxation
0 references
matheuristic
0 references
0 references
0 references
0 references
0 references
0.8803712
0 references
0.87644017
0 references
0.8700487
0 references
0.8647529
0 references
0.8644669
0 references
0.85316443
0 references
