Buscar
Mostrando ítems 11-17 de 17
Artículo
The Permutation Flow Shop Scheduling Problem with Human Resources: MILP Models, Decoding Procedures, NEH-Based Heuristics, and an Iterated Greedy Algorithm
(MDPI, 2022-09-22)
In this paper, we address the permutation flow shop scheduling problem with sequence-dependent and non-anticipatory setup times. These setups are performed or supervised by multiple servers, which are renewable secondary ...
Artículo
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation
(Elsevier, 2021-08)
The assembly scheduling problem is a common layout with many applications in real manufacturing scenarios. Despite the high number of studies dealing with this problem, no benchmark has been proposed up-to-now in the ...
Artículo
A Multilayer Network Approach for the Bimodal Bus–Pedestrian Line Planning Problem
(Multidisciplinary Digital Publishing Institute (MDPI), 2023)
In this paper, we formulate and solve the urban line planning problem considering a multilayer representation of a bimodal transportation network. Classical formulations are usually constructed over a planar network, ...
Ponencia
Determinación de un plan operativo semanal para la Red Andaluza de Laboratorios Clínicos
(Universidad de Sevilla, 2010)
Presentamos un modelo para coordinar el funcionamiento en una Red Regional de Laboratorios Clínicos, cuya resolución permite la reasignación de recursos, la redistribución de cargas y la reorganización de los flujos de ...
Artículo
The Stochastic Team Orienteering Problem with Position-Dependent Rewards
(MDPI, 2022-08)
In this paper, we analyze both the deterministic and stochastic versions of a team orienteering problem (TOP) in which rewards from customers are dynamic. The typical goal of the TOP is to select a set of customers to visit ...
Artículo
Counting and enumerating feasible rotating schedules by means of Gröbner bases
(Elsevier, 2016)
This paper deals with the problem of designing and analyzing rotating schedules with an algebraic computational approach. Specifically, we determine a set of Boolean polynomials whose zeros can be uniquely identified with ...
Artículo
Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
(Springer, 2019)
This paper focuses on designing waste collection routes with a single landfill using eco-efficiency as a performance indicator. In this problem, there are a limited number of heterogeneous vehicles based at a single ...