Login / Signup

A Matheuristic Approach for the Home Care Scheduling Problem With Chargeable Overtime and Preference Matching.

Xuran GongNa GengYanran ZhuAndrea MattaEttore Lanzarone
Published in: IEEE Trans Autom. Sci. Eng. (2021)
Keyphrases
  • scheduling problem
  • home care
  • tabu search
  • health care
  • flowshop
  • np hard
  • single machine
  • patient data
  • databases
  • layered architecture
  • artificial intelligence
  • three dimensional
  • special case
  • pervasive computing