Matching formulation of the staff transfer problem: meta-heuristic approaches
From MaRDI portal
Publication:2656523
DOI10.1007/S12597-019-00432-WOpenAlexW2994909727WikidataQ126561789 ScholiaQ126561789MaRDI QIDQ2656523FDOQ2656523
Authors: 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
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Size versus stability in the marriage problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- 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
- 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
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- Solving the response time variability problem by means of a genetic algorithm
- Title not available (Why is that?)
- A Constraint Programming Approach to the Hospitals / Residents Problem
- Constraint satisfaction methods for solving the staff transfer problem
Uses Software
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)
