Matching formulation of the staff transfer problem: meta-heuristic approaches
From MaRDI portal
Publication:2656523
Recommendations
- Constraint satisfaction methods for solving the staff transfer problem
- Staff assignment with lexicographically ordered acceptance levels
- Local search approaches in stable matching problems
- Stable multi-skill workforce assignments
- A novel discrete state transition algorithm for staff assignment problem
Cites work
- 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 Constraint Programming Approach to the Hospitals / Residents Problem
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- A tabu search/path relinking algorithm to solve the job shop scheduling problem
- Constraint satisfaction methods for solving the staff transfer problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Size versus stability in the marriage problem
- Solving the response time variability problem by means of a genetic algorithm
- Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
- Using simulated annealing to optimize the feature selection problem in marketing applications
This page was built for publication: Matching formulation of the staff transfer problem: meta-heuristic approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656523)
