Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Julien Fondrevelle"'
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-26 (2023)
Abstract Due to the impact of COVID-19, a significant influx of emergency patients inundated the intensive care unit (ICU), and as a result, the treatment of elective patients was postponed or even cancelled. This paper studies ICU bed allocation for
Externí odkaz:
https://doaj.org/article/589cb1da3aed4873bf88da52c24bf4a6
Publikováno v:
Healthcare Systems. :209-222
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
International Journal of Production Research
International Journal of Production Research, Taylor & Francis, 2021, pp.1-16. ⟨10.1080/00207543.2020.1867922⟩
Universidade de São Paulo (USP)
instacron:USP
International Journal of Production Research
International Journal of Production Research, Taylor & Francis, 2021, pp.1-16. ⟨10.1080/00207543.2020.1867922⟩
This article studies the impact of flexible work contracts and multi-skilled agents on a multi-objective workforce planning problem. Each agent has a work contract with a weekly and daily work capa...
Autor:
Tao Wang, Julien Fondrevelle, Antoine Duclos, Vincent Lequertier, Vincent Augusto, Stéphanie Polazzi
Publikováno v:
CASE
Hospital beds management is critical for the quality of patient care, while length of inpatient stay is often estimated empirically by physicians or chief nurses of medical wards. Providing an efficient method for forecasting the length of stay (LOS)
Publikováno v:
8th International Conference on Industrial Engineering and Systems Management (IESM 2019)
8th International Conference on Industrial Engineering and Systems Management (IESM 2019), Sep 2019, Shanghai, China. pp.1-6, ⟨10.1109/IESM45758.2019.8948220⟩
8th International Conference on Industrial Engineering and Systems Management (IESM 2019), Sep 2019, Shanghai, China. pp.1-6, ⟨10.1109/IESM45758.2019.8948220⟩
In this article, we use a mixed integer linear programming model to study the impact of different combinations of agent work contract types on a multi-objective workforce planning problem. Agents who have different shift and non-shift contract types
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70acb2888135dafd91774e6f0fbf6963
https://hal.archives-ouvertes.fr/hal-02443339
https://hal.archives-ouvertes.fr/hal-02443339
Publikováno v:
9th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2019
9th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2019, Aug 2019, Berlin, Germany. pp.2026-2031, ⟨10.1016/j.ifacol.2019.11.503⟩
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
9th IFAC Conference on Manufacturing Modelling, Management and Control MIM 2019, Aug 2019, Berlin, Germany. pp.2026-2031, ⟨10.1016/j.ifacol.2019.11.503⟩
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
In this article, we introduce a mixed integer linear programming (MILP) model for a real bi-objective agent assignment problem in the service-to-business domain. Agents with different skill types, skill levels and work contract types have to be assig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b143d05c1471fae8be5a1a07486cceca
https://hal.archives-ouvertes.fr/hal-02443351
https://hal.archives-ouvertes.fr/hal-02443351
Publikováno v:
Journal Européen des Systèmes Automatisés. 49:233-270
This paper presents a systematic literature review on sustainable supply chain design and planning models in the field of Operations Research (OR). The goal is to analyse to which extent economic, envir onmental and social aspects are integrated into
Publikováno v:
International Journal of Production Research
International Journal of Production Research, Taylor & Francis, 2009, 47 (23), pp.6759-6775. ⟨10.1080/00207540802320164⟩
International Journal of Production Research, 2009, 47 (23), pp.6759-6775. ⟨10.1080/00207540802320164⟩
International Journal of Production Research, Taylor & Francis, 2009, 47 (23), pp.6759-6775. ⟨10.1080/00207540802320164⟩
International Journal of Production Research, 2009, 47 (23), pp.6759-6775. ⟨10.1080/00207540802320164⟩
International audience; In this paper we investigate the m-machine permutation flow shop scheduling problem where exact time lags are defined between consecutive operations of every job. This generic model can be used for the study and analysis of va
Publikováno v:
International Journal of Production Economics
International Journal of Production Economics, 2008, 112 (1), pp.168-176. ⟨10.1016/j.ijpe.2006.08.018⟩
International Journal of Production Economics, Elsevier, 2008, 112 (1), pp.168-176. ⟨10.1016/j.ijpe.2006.08.018⟩
International Journal of Production Economics, 2008, 112 (1), pp.168-176. ⟨10.1016/j.ijpe.2006.08.018⟩
International Journal of Production Economics, Elsevier, 2008, 112 (1), pp.168-176. ⟨10.1016/j.ijpe.2006.08.018⟩
International audience; In this article, we consider flowshop scheduling problems with minimal and maximal time lag constraints. Such constraints extend precedence constraints between operations in the jobs and may be used to model various industrial
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, Elsevier, 2015, 244 (1), pp.117-128. ⟨10.1016/j.ejor.2015.01.013⟩
IEEE International Conference on Control, Decision and Information Technologies, CoDIT 2013
IEEE International Conference on Control, Decision and Information Technologies, CoDIT 2013, 2013, Hammamet, Tunisia
European Journal of Operational Research, Elsevier, 2015, 244 (1), pp.117-128. ⟨10.1016/j.ejor.2015.01.013⟩
IEEE International Conference on Control, Decision and Information Technologies, CoDIT 2013
IEEE International Conference on Control, Decision and Information Technologies, CoDIT 2013, 2013, Hammamet, Tunisia
In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is characterized by two flows of jobs that cover the same machines in opposite directions. The objective is to minimize the maximal completi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1c1f6b2a0632086ab1e283f8bf14606
https://hal.archives-ouvertes.fr/hal-02162939
https://hal.archives-ouvertes.fr/hal-02162939