New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent

DOI10.1016/j.endm.2014.11.024zbMath1362.90194OpenAlexW1980828939MaRDI QIDQ2631255

Eric Marcon, Khaled Ghédira, Issam Zidi, Brahim Issaoui

Publication date: 29 July 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.11.024

zbMATH Keywords

metaheuristicmathematical modellingshortest processing timelongest processing timestatic problem of home care servicesvariable neighbourhood descent

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A survey on the applications of variable neighborhood search algorithm in healthcare management ⋮ Bicriteria vehicle routing problem with preferences and timing constraints in home health care services

Uses Software

• PARPAP

Cites Work

• Variable neighborhood search
• A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem

This page was built for publication: New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent