Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Birgin, Ernesto G."'
The flexible job shop scheduling problem with sequencing flexibility and position-based learning effect is considered in the present work. In [K. A. G. Araujo, E. G. Birgin, and D. P. Ronconi, Technical Report MCDO02022024, 2024], models, constructiv
Externí odkaz:
http://arxiv.org/abs/2403.16787
This paper addresses the flexible job shop scheduling problem with sequencing flexibility and position-based learning effect. In this variant of the flexible job shop scheduling problem, precedence constraints of the operations constituting a job are
Externí odkaz:
http://arxiv.org/abs/2403.16766
Minimization diagrams encompass a large class of diagrams of interest in the literature, such as generalized Voronoi diagrams. We develop an abstract perturbation theory and perform a sensitivity analysis for functions depending on sets defined throu
Externí odkaz:
http://arxiv.org/abs/2112.08160
Publikováno v:
SIAM Journal on Scientific Computing 44, pp. A798-A824, 2022
The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of balls. This
Externí odkaz:
http://arxiv.org/abs/2106.03641
Spectral residual methods are powerful tools for solving nonlinear systems of equations without derivatives. In a recent paper, it was shown that an acceleration technique based on the Sequential Secant Method can greatly improve its efficiency and r
Externí odkaz:
http://arxiv.org/abs/2104.13447
Autor:
Birgin, Ernesto G., Martínez, J. M.
Publikováno v:
SIAM Journal on Numerical Analysis 60, pp. 3145-3180, 2022
Sequential Residual Methods try to solve nonlinear systems of equations $F(x)=0$ by iteratively updating the current approximate solution along a residual-related direction. Therefore, memory requirements are minimal and, consequently, these methods
Externí odkaz:
http://arxiv.org/abs/2012.13251
Publikováno v:
Journal of Computational and Applied Mathematics 410, 114193, 2022
The Inexact Restoration approach has proved to be an adequate tool for handling the problem of minimizing an expensive function within an arbitrary feasible set by using different degrees of precision in the objective function. The Inexact Restoratio
Externí odkaz:
http://arxiv.org/abs/2009.09062
In this work, the online printing shop scheduling problem is considered. This challenging real problem, that appears in the nowadays printing industry, can be seen as a flexible job shop scheduling problem with sequence flexibility in which precedenc
Externí odkaz:
http://arxiv.org/abs/2006.13064
In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem, Computers & Operations Research, to appear) i
Externí odkaz:
http://arxiv.org/abs/2006.12344
Publikováno v:
In Expert Systems With Applications 1 August 2023 223