Constraint satisfaction methods for solving the staff transfer problem

DOI10.1007/BF03398729MaRDI QIDQ2476428zbMATH OpenFDO

Authors Sriyankar Acharyya, Amitava Bagchi

Publication date 19 March 2008

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

simulated annealinggenetic algorithmssatisfiabilityhuman resource managementconflict directed backjumpingGSAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1215040
• Constraint satisfaction problems: Algorithms and applications
• A simulated annealing approach to the cyclic staff-scheduling problem
• Modelling and solving employee timetabling problems
• A novel discrete state transition algorithm for staff assignment problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1131224 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A theoretical evaluation of selected backtracking algorithms.
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

Cited in

(2)

• Matching formulation of the staff transfer problem: meta-heuristic approaches
• A novel discrete state transition algorithm for staff assignment problem

This page was built for publication: Constraint satisfaction methods for solving the staff transfer problem

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