Cildoz Esquíroz, Marta
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
Cildoz Esquíroz
First Name
Marta
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
ORCID
person.page.observainves
person.page.upna
Name
- Publications
- item.page.relationships.isAdvisorOfPublication
- item.page.relationships.isAdvisorTFEOfPublication
- item.page.relationships.isAuthorMDOfPublication
2 results
Search Results
Now showing 1 - 2 of 2
Publication Open Access The optimal container selection problem for parts transportation in the automotive sector(Elsevier, 2024) Cildoz Esquíroz, Marta; Mateo, Pedro; Alonso, María Teresa; Parreño, Francisco; Alvarez-Valdes, Ramon; Mallor Giménez, Fermín; Estadística, Informática y Matemáticas; Estatistika, Informatika eta Matematika; Institute of Smart Cities - ISCToday's automotive factories are essentially assembly plants that receive parts from a vast network of suppliers around the world. Transporting thousands of part types over very long distances is a major logistic problem whose solution is a critical factor in the factory management. In this study we have developed a statistical and optimization methodology implemented in a software tool to help the decision makers select the most appropriate container for each part. A key element is to determine the number of parts that fit in a given container. Two optimization procedures have been developed, depending on the type of part, and used to calculate costs of each container. These costs include not only transporting parts from supplier to factory, but also the costs of handling parts within the factory and returning the empty containers to the supplier.Publication Open Access A GRASP-based algorithm for solving the emergency room physician scheduling problem(Elsevier, 2021) Cildoz Esquíroz, Marta; Mallor Giménez, Fermín; Mateo, Pedro; Institute of Smart Cities - ISCThis paper addresses a physician scheduling problem in an Emergency Room (ER) requiring a long-term work calendar to allocate work days and types of shift among all the doctors. The mathematical model is created without simplifications, using the real calendar, including holidays. This precludes the possibility of cyclic-type solutions, and involves numerous and varied constraints (demand, workload, ergonomics, fairness, etc.). An effective solution to this very difficult practical problem cannot be obtained, for large instances, with exact solution methods. We formulate a mathematical representation of a real-world ER physician scheduling problem featuring a hybrid algorithm combining continuous linear programming with a greedy randomized adaptive search procedure (GRASP). Linear programming is used to model a general physician-demand covering problem, where the solution is used to guide the construction phase of the GRASP, to obtain initial full schedules for subsequent improvement by iterative application of Variable Neighborhood Descent Search (VNDS) and Network Flow Optimization (NFO). A computational study shows the superiority of our approach over the Integer Linear Programming method in a set of instances of varying size and difficulty inspired by a real setting. The methodology is embedded in a software tool for generating one-year-ahead physician schedules for a local ER. These solutions, which are now in use, outperform the manually-created schedules used previously. © 2021 Elsevier B.V.