A simulated annealing approach to the cyclic staff-scheduling problem (Q4695782): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A simulated annealing approach to the cyclic staff-scheduling problem | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/1520-6750(199302)40:1<69::aid-nav3220400105>3.0.co;2-h / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2030235767 / rank | |||
Normal rank | |||
| Property / title | |||
A simulated annealing approach to the cyclic staff-scheduling problem (English) | |||
| Property / title: A simulated annealing approach to the cyclic staff-scheduling problem (English) / rank | |||
Normal rank | |||
Latest revision as of 10:59, 30 July 2024
scientific article; zbMATH DE number 219842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simulated annealing approach to the cyclic staff-scheduling problem |
scientific article; zbMATH DE number 219842 |
Statements
29 June 1993
0 references
simulated annealing
0 references
NP-complete cyclic staff-scheduling
0 references
branch-and- bound
0 references
A simulated annealing approach to the cyclic staff-scheduling problem (English)
0 references
