A novel discrete state transition algorithm for staff assignment problem

DOI10.7641/CTA.2016.50982MaRDI QIDQ5276604zbMATH OpenFDO

Authors Tianxue Dong, Xiaojun Zhou, Chunhua Yang, Weihua Gui

Publication date 14 July 2017

Full work available at URL https://doi.org/10.7641/CTA.2016.50982

zbMATH Keywords

assignment problemdiscrete state transition algorithminteger programmingsecond transitionstagnation backtracking

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• Staff assignment with lexicographically ordered acceptance levels
• An Evolutionary Algorithm for Sub-Daily/Sub-Shift Staff Scheduling
• Constraint satisfaction methods for solving the staff transfer problem
• Models and algorithms for a staff scheduling problem
• Staff scheduling and rostering: a review of applications, methods and models.

Cited in

(2)

• Constraint satisfaction methods for solving the staff transfer problem
• Matching formulation of the staff transfer problem: meta-heuristic approaches

This page was built for publication: A novel discrete state transition algorithm for staff assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276604)