A simulated annealing approach to the cyclic staff-scheduling problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 0769.90056
author: Michael J. Brusco
author: Larry W. Jacobs
publication date: 1993-06-29T00:00:00Z
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 219842
zbMATH Keywords: simulated annealing
zbMATH Keywords: NP-complete cyclic staff-scheduling
zbMATH Keywords: branch-and- bound
MaRDI profile type: Publication
cites work: Q5602518
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
OpenAlex ID: W2030235767
title: A simulated annealing approach to the cyclic staff-scheduling problem
Recommended article: A simulated annealing approach to the solution of job rotation scheduling problems
Recommended article: Q4216477
Recommended article: Solving Scheduling Problems by Simulated Annealing
Recommended article: Simulated annealing for resource-constrained scheduling
Recommended article: A simulated-annealing heuristic for shift scheduling using non-continuously available employees
Recommended article: Some new results on simulated annealing applied to the job shop scheduling problem
DOI: 10.1002/1520-6750(199302)40:1%3C69::AID-NAV3220400105%3E3.0.CO;2-H
full work available at URL: https://doi.org/10.1002/1520-6750(199302)40:1%3C69::aid-nav3220400105%3E3.0.co
description: scientific article; zbMATH DE number 219842