Buscar
Mostrando ítems 1-10 de 163
Decomposition methods for large job shops
(PERGAMON-ELSEVIER SCIENCE LTD, 2001)
A rolling horizon heuristic is presented for large job shops, in which the total weighted tardiness must be minimized. The method divides a given instance into a number of subproblems, each having to correspond to a time ...
A heuristic algorithm based on multi-assignment procedures for nurse scheduling
(2013-04-03)
This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction ...
A heuristic algorithm based on multi-assignment procedures for nurse scheduling
(2013-04-03)
This paper tackles a Nurse Scheduling Problem which consists of generating work schedules for a set of nurses while considering their shift preferences and other requirements. The objective is to maximize the satisfaction ...
Metaheurística GRASP para el balanceo de carga de trabajo de médicos forenses
En este proyecto se da solución al problema de programación de turnos de los médicos
forenses del Instituto de Medicina Legal, con el fin de minimizar la máxima diferencia de
horas extras entre los médicos. Para ello ...
Metaheurística GRASP para el balanceo de carga de trabajo de médicos forenses
En este proyecto se da solución al problema de programación de turnos de los médicos
forenses del Instituto de Medicina Legal, con el fin de minimizar la máxima diferencia de
horas extras entre los médicos. Para ello ...
Reactive Scheduling Framework Based-on Domain Knowledge and Constraint Programming
(Pergamon-Elsevier Science Ltd, 2010-12)
Industrial environments frequently face disruptive events. This contribution presents a support framework, aimed at addressing the repair-based reactive scheduling problem. It is based on an explicit object-oriented domain ...
Modelo de la programación de turnos de trabajo considerando el bienestar de los empleados de las clínicas.
(2015-05-06)
El problema de la programación de turnos de trabajo, consiste en programar el horario de trabajo o los turnos de los distintos empleados buscando la minimización de los costos asociados al personal, el cual es un problema ...
Improving the shift-scheduling problem using non-stationary queueing models with local heuristic and genetic algorithm
(2020-01-01)
We improve the shift-scheduling process by using nonstationary queueing models to evaluate schedules and two heuristics to generate schedules. Firstly, we improved the fitness function and the initial population generation ...
A Reactive Scheduling Approach Based on Domain-Knowledge
(Elsevier, 2009-08)
Real world industrial environments frequently face unexpected events that generallydisrupt in-progress production schedules. This contribution presents advances in thedevelopment of a support framework to address the ...