Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Anis Mjirda"'
Publikováno v:
International Journal of Healthcare Management. 14:813-828
The problem treated in this work is the management of the home health care service. Especially, we studied the caregivers’ tours problem and the management of conflict sanitary visits. Home health ...
Publikováno v:
Operations Research and Simulation in Healthcare ISBN: 9783030452223
In this chapter, we try to improve health care services, particularly the Home Health Care Problem (HHCP). In fact, Home Health Care Service (HHCS) is known as a care mode allowing patients who suffer from complex and evolving diseases to benefit at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53a18935d4e9b001f2d8d84a2b1d3de0
https://doi.org/10.1007/978-3-030-45223-0_7
https://doi.org/10.1007/978-3-030-45223-0_7
Publikováno v:
Electronic Notes in Discrete Mathematics. 58:71-78
We address a multi-product version of the IRP, in which a supplier is responsible for the distribution of several products to a set of geographically dispersed customers using a feet of heterogeneous vehicles. We deal with a deterministic version of
Publikováno v:
IFAC-PapersOnLine. 49:881-885
In this paper, we propose a new model for the joint optimization of the periodic preventive maintenance and spare parts inventory problem. It consist to find an optimal maintenance schedule of M machine over a cyclic horizon composed of τ periods wi
Publikováno v:
ICCS
We address a vehicle routing problem with time windows (VRPTW) that also contains vehicle with preventive maintenance constraints (VRPTW-PM) and propose a MIP mathematical formulation as well as a general variable neighborhood search metaheuristic (V
Publikováno v:
Computers & Operations Research. 52:291-299
We address a multi-product inventory routing problem and propose a two-phase Variable Neighborhood Search (VNS) metaheuristic to solve it. In the first phase, VNS is used to solve a capacitated vehicle routing problem at each period to find an initia
Publikováno v:
Optimization Letters. 11:1047-1056
In this paper, we present two General Variable Neighborhood Search for the Traveling Salesman Problem with Draft Limits (TSPDL), a recent variant of the Traveling Salesman Problem. TSPDL arises in the context of maritime transportation. It consists o
Publikováno v:
IMA Journal of Management Mathematics
IMA Journal of Management Mathematics, Oxford University Press (OUP), 2016, 27 (1), pp.39-54. ⟨10.1093/imaman/dpu020⟩
IMA Journal of Management Mathematics, Oxford University Press (OUP), 2016, 27 (1), pp.39-54. ⟨10.1093/imaman/dpu020⟩
International audience; The inventory routing problem (IRP) deals with the study of the inter-relationship between two important activities in the supply chain: transportation of commodities and inventory management. In this paper, we study a variant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b301efc12290750cbc81c98c17e9e36
https://hal-uphf.archives-ouvertes.fr/hal-03400808
https://hal-uphf.archives-ouvertes.fr/hal-03400808
Publikováno v:
Electronic Notes in Discrete Mathematics. 39:91-98
We address a multi-product inventory routing problem, and propose a two-phase variable neighborhood search (VNS) metaheuristic to solve it. In the first phase, VNS is used to solve a capacitated vehicle routing problem, period by period, to find an i
Publikováno v:
2015 4th International Conference on Advanced Logistics and Transport (ICALT).
In this paper, we propose a semi-automatic system to deal with the undesired events that may happen in the medical field. Based on algorithms of textual extraction and classifications, it performs a preprocessing of undesired events' declarations. Th