A simulated annealing approach to the cyclic staff‐scheduling problem

Michael J. Brusco and Larry W. Jacobs

Naval Research Logistics (NRL), 1993, vol. 40, issue 1, 69-84

Abstract: This article presents the application of a simulated annealing heuristic to an NP‐complete cyclic staff‐scheduling problem. The new heuristic is compared to branch‐and‐bound integer programming algorithms, as well as construction and linear programming‐based heuristics. It is designed for use in a continuously operating scheduling environment with the objective of minimizing the number of employees necessary to satisfy forecast demand. The results indicate that the simulated annealing‐based method tends to dominate the branch‐and‐bound algorithms and the other heuristics in terms of solution quality. Moreover, the annealing algorithm exhibited rapid convergence to a low‐cost solution. The simulated annealing heuristic is executed in a single program and does not require mathematical programming software. © 1993 John Wiley & Sons, Inc.

Date: 1993
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199302)40:13.0.CO;2-H

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:40:y:1993:i:1:p:69-84

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().