|
|
|
|
|
Bruno Colonetti, Erlon Cristian Finardi and Welington de Oliveira
Independent System Operators (ISOs) worldwide face the ever-increasing challenge of coping with uncertainties, which requires sophisticated algorithms for solving unit-commitment (UC) problems of increasing complexity in less-and-less time. Hence, decomp...
ver más
|
|
|
|
|
|
|
|
|
Apolinar Velarde Martinez
The problem of scheduling parallel tasks graphs (PTGs) represented by directed acyclic graphs (DAGs) in heterogeneous distributed computing systems (HDCSs) is considered an nondeterministic polynomial time (NP) problem due to the diversity of characteris...
ver más
|
|
|
|
|
|
|
|
|
Frantisek Franek and Michael Liut
There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal Ly...
ver más
|
|
|
|
|
|
|
|
|
Cheol Min Joo and Byung Soo Kim
This article addresses an integrated problem of one batching and two scheduling decisions between a manufacturing plant and multi-delivery sites. In this problem, two scheduling problems and one batching problem must be simultaneously determined. In the ...
ver más
|
|
|
|
|
|
|
|
|
Francois Belletti, Alexandre M. Bayen
Pág. 1000 - 1024
On-demand traffic fleet optimization requires operating Mobility as a Service (MaaS) companies such as Uber, Lyft to locally match the offer of available vehicles with their expected number of requests referred to as demand (as well as to take into accou...
ver más
|
|
|
|