Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Carlos Diego Rodrigues"'
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 13, Iss 2, Pp 223-236 (2022)
This paper aims at presenting a customer order scheduling environment in which the setup times are explicit and depend on the production sequence. The considered objective function is the total tardiness minimization. Since the variant under study is
Externí odkaz:
https://doaj.org/article/0667428dff6b4a3c9a33f281e4b41d80
Autor:
Carlos Diego Rodrigues
Publikováno v:
Biblioteca Digital de Teses e Dissertações da UFCUniversidade Federal do CearáUFC.
Neste trabalho abordamos o problema de coloraÃÃo de vÃrtices via programaÃÃo inteira. Uma versÃo expandida da formulaÃÃo por conjuntos independentes à utilizada para abrigar outras sub-estruturas do grafos alÃm dos vÃrtices. Cada uma dessa
Publikováno v:
Computers & Operations Research. 149:106044
Publikováno v:
Computers & Operations Research. 145:105880
Publikováno v:
Expert Systems with Applications. 189:116097
Although the customer order scheduling problem to minimize the total completion time has received a lot of attention from researchers, the literature has not considered so far the case where there are sequence-dependent setups between jobs belonging
Publikováno v:
Computers & Operations Research. 92:145-154
This paper proposes a Path-Relinking (PR) algorithm for the well-known and NP-hard Multi-mode Resource-Constrained Project Scheduling Problem (MRCPSP). This problem generalizes the Resource-Constrained Project Scheduling Problem (RCPSP) where the pro
Publikováno v:
Computers & Industrial Engineering. 151:106962
In this paper, we study a variant of the customer order scheduling problem when sequence-dependent setup times cannot be ignored. The performance measure adopted is the makespan minimization. The existence of sequence-dependent setup times makes this
Publikováno v:
Discrete Applied Mathematics. 197:75-92
Motivated by bandwidth allocation under interference constraints in radio networks, we define and investigate an optimization problem that combines the classical flow and edge coloring problems in graphs. Let G = ( V , E ) be a graph with a demand fu
Publikováno v:
SIAM Journal on Optimization
SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2012, ⟨10.1137/110820762⟩
SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2012, ⟨10.1137/110820762⟩
International audience; This paper presents an exact solution method based on a new linearization scheme for the 0-1 quadratic knapsack problem, which consists of maximizing a quadratic pseudo-Boolean function with nonnegative coefficients subject to
Autor:
Moises Silvestre de Azevedo Martins, Sandro Fernandes da Silva, Eryclis Eduardo Miguel Nunes, Carlos Diego Rodrigues, Claudio Hernández-Mosqueira
Publikováno v:
MHSALUD: Revista en Ciencias del Movimiento Humano y Salud. 15:1
espanolEl objetivo de este estudio fue comparar las variables antropometricas y de potencia de miembros inferiores (PMI) en una muestra de jugadores de rugby-7 de diferentes posiciones. Participaron 22 jugadores universitarios clasificados de acuerdo