Buscar en RiuNet

Listar

Todo RiuNet

Mi cuenta

Acceder

Ayuda RiuNet

Admin. UPV

Listar por palabra clave "Integer programming"

Mostrando ítems 1-7 de 7

Análisis del Block Relocation Problem

García Lozano, Carlos (Universitat Politècnica de València, 2021-10-15)

[ES] El Block Relocation Problem es un problema de gran interés en la logística actual. Este problema consiste en minimizar el número de recolocaciones necesarias para extraer un conjunto de bloques apilados en un orden ...
Flow shop scheduling with heterogeneous workers

Benavides, Alexander J.; Ritt, Marcus; Miralles Insa, Cristóbal Javier (Elsevier, 2014-09-01)

We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the ...
GRASP algorithms for the robust railway network design problem

García-Archilla, Bosco; Lozano, Antonio J.; Mesa, Juan A.; Perea Rojas Marcos, Federico (Springer Verlag, 2011-04)

This paper analyzes the solvability of a railway network design problem and its robust version. These problems are modeled as integer linear programming problems with binary variables, and their solutions provide topological ...
Integer programming models for the pre-marshalling problem

Parreño-Torres, Consuelo; Alvarez-Valdes, Ramon; Ruiz García, Rubén (Elsevier, 2019-04-01)

[EN] The performance of shipping companies greatly depends on reduced berthing times. The trend towards bigger ships and shorter berthing times places severe stress on container terminals, which cannot simply increase the ...
Resolution of an Antenna–Satellite assignment problem by means of Integer Linear Programming

Vazquez, Rafael; Perea Rojas Marcos, Federico; Galán Vioque, Jorge (Elsevier, 2014-12)

Every day, ground stations need to manage numerous requests for allocation of antenna time slots by customers operating satellites. For multi-antenna, multi-site ground networks serving numerous satellite operators, ...
Scheduling unrelated parallel machines with optional machines and jobs selection

Fanjul Peyró, Luis; Ruiz García, Rubén (Elsevier, 2012-07)

[EN] In this paper we study two generalizations of the well known unrelated parallel machines scheduling problem under makespan (Cmax) minimization. First, a situation in which not every available parallel machine should ...
Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times

Ruiz García, Rubén; Andrés Romano, Carlos (Springer Verlag (Germany), 2011-11)

[EN] A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. ...