GENETIC ALGORITHM AND TABU SEARCH METHODS FOR CARE SERVICE SCHEDULING PROBLEM AND COMPARISON BETWEEN THESE TWO METHODS

DOI10.15807/JORSJ.44.261MaRDI QIDQ4483765zbMATH OpenOpenAlexFDO

Authors Isao Aoyama, Hiroyuki Sato, Katsuto Nakajima

Publication date 13 October 2003

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.44.261

zbMATH Keywords

genetic algorithmmeta-heuristic methodsHome Care Service Scheduling Problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Metaheuristics for solving a multimodal home-healthcare scheduling problem
• A model-based evolutionary algorithm for home health care scheduling
• scientific article; zbMATH DE number 1683917
• A metaheuristic based on tabu search for solving a technician routing and scheduling problem
• Tabu search in audit scheduling

This page was built for publication: GENETIC ALGORITHM AND TABU SEARCH METHODS FOR CARE SERVICE SCHEDULING PROBLEM AND COMPARISON BETWEEN THESE TWO METHODS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4483765)