Matching formulation of the staff transfer problem: meta-heuristic approaches

DOI10.1007/s12597-019-00432-wOpenAlexW2994909727WikidataQ126561789 ScholiaQ126561789MaRDI QIDQ2656523

Yanyan Li

Publication date: 11 March 2021

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-019-00432-w

zbMATH Keywords

optimizationmeta-heuristicsstable matchinghuman resource planningstaff transfer

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tabu search/path relinking algorithm to solve the job shop scheduling problem
• Using simulated annealing to optimize the feature selection problem in marketing applications
• Size versus stability in the marriage problem
• Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
• A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
• Solving the response time variability problem by means of a genetic algorithm
• A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
• Constraint satisfaction methods for solving the staff transfer problem
• A Constraint Programming Approach to the Hospitals / Residents Problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

This page was built for publication: Matching formulation of the staff transfer problem: meta-heuristic approaches