Genetic based discrete particle swarm optimization for elderly day care center timetabling
From MaRDI portal
Publication:342133
DOI10.1016/j.cor.2015.07.010zbMath1349.90374OpenAlexW1435381774MaRDI QIDQ342133
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/54185/
tabu searchgenetic algorithmdiscrete particle swarm optimizationmaximum constraint satisfaction problemMIN-conflict random walkmin-conflict random-walk algorithmNP-hardnon-deterministic polynomial hardtimetabling problemweighted MAX-constraint satisfaction problem
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Cites Work
- Integer programming methods for large-scale practical classroom assignment problems
- Hybrid bee colony optimization for examination timetabling problems
- A two-phase adaptive variable neighborhood approach for nurse rostering
- A constraint programming based column generation approach to nurse rostering problems
- A variable neighborhood search based matheuristic for nurse rostering problems
- A survey of school timetabling research
- A survey of search methodologies and automated system development for examination timetabling
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- A branch and bound algorithm for numerical Max-CSP
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Solving university course timetabling problems using constriction particle swarm optimization with local search
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- Nominal and robust train timetabling problems
- New approaches to nurse rostering benchmark instances
- Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
- Sports scheduling: Problems and applications
