Repository logo
Andean Publishing ↗
New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Autor "Carlos Montoya"

Filter results by typing the first few letters
Now showing 1 - 5 of 5
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    Item type: Item ,
    A Multi-Objective Approach for the Nurse Scheduling Problem. A Home Health Care Delivery Case Study
    (RELX Group (Netherlands), 2025) Andrés Ramos; Fabián Castaño; Nubia Velasco; Carlos Montoya
  • Loading...
    Thumbnail Image
    Item type: Item ,
    A Multi-Objective Approach for the Nurse Scheduling Problem. A Home Health Care Delivery Case Study
    (RELX Group (Netherlands), 2025) António Ramos; Fabián Castaño; Nubia Velasco; Carlos Montoya
  • Loading...
    Thumbnail Image
    Item type: Item ,
    Applications of resource assignment and scheduling with Petri Nets and heuristic search
    (Springer Science+Business Media, 2010) Gonzalo Mejía; Carlos Montoya
  • Loading...
    Thumbnail Image
    Item type: Item ,
    Heuristic Algorithm for Workforce Scheduling Problems
    (LA Referencia, 2010) Carlos Montoya; Gonzalo Mejía
    In this paper we present a heuristic approach for solving workforce scheduling problems. The primary goal is to minimize the number of required workers given a pre-established shift demand over a planning horizon. The proposed algorithm startswith an initial solution (initial number of workers and their shift assignment) and iteratively searches the state space, moving towards better solutions via a local search procedure. Local optima are avoided by guaranteeing that the algorithm never returns to a previously visited solution. The algorithm stops after a termination criterion is met. The solution provides a detailed schedule of each worker on each shift. A number of constraints such as minimum and maximum number of working hours, rest days, and maximum number of continuous working hours are considered. The algorithm was tested on a number of randomly generated problems of different sizes. A Mixed Integer Programming (MIP) formulation is proposed and used as a benchmark. Computational experiments show that the algorithm always found optimal or near-optimal solutions with signifi cantly less computer effort.
  • Loading...
    Thumbnail Image
    Item type: Item ,
    Managing Random Events in the Home Healthcare Scheduling and Routing Problem
    (RELX Group (Netherlands), 2025) Fabián Castaño; Carlos Montoya; Andrés Ramos; Nubia Velasco

Andean Library © 2026 · Andean Publishing

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback