Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Alexander J. Benavides"'
Autor:
Antony Vera, Alexander J. Benavides
Publikováno v:
European Journal of Operational Research. 297:407-421
The best performing approximate methods proposed for the permutational flow shop scheduling problem with makespan minimization are the well known NEH constructive heuristic and the iterated greedy algorithm. Both methods are based on the successive i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6dda904d3a8a929e9fad9f2f1369382c
https://doi.org/10.1016/j.ejor.2021.05.014
https://doi.org/10.1016/j.ejor.2021.05.014
Autor:
Marcus Ritt, Alexander J. Benavides
Publikováno v:
GECCO
There has been intensive research on tiebreakers for insertion-based constructive heuristics in the permutation flow shop scheduling problem when the objective is to minimize the makespan. In this paper we analyze the space of all possible tie-breaki
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99bad91a05ec3ea0d772081caad6bf07
https://doi.org/10.1145/3449639.3459344
https://doi.org/10.1145/3449639.3459344
Autor:
Alexander J. Benavides, Marcus Ritt
Publikováno v:
Computers & Operations Research. 66:160-169
We propose a constructive and an iterated local search heuristic for minimizing the makespan in the non-permutation flow shop scheduling problem. Both heuristics are based on the observation that optimal non-permutation schedules often exhibit a perm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3642a7c36b7a97e01f505996d1805cd7
https://doi.org/10.1016/j.cor.2015.08.001
https://doi.org/10.1016/j.cor.2015.08.001
Publikováno v:
EasyChair Preprints.
This paper presents a new Iterated Semi-Greedy Algorithm (ISGA) for the 0-1 Quadratic Knapsack Problem.The proposed ISGA is easier to implement, runs faster, and produces comparable results than state-of-the-art methods. Computational evaluation is p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23620befc97f26a071cd16e5071020a4
https://doi.org/10.29007/fx82
https://doi.org/10.29007/fx82
Autor:
Alexander J. Benavides
Publikováno v:
EasyChair Preprints.
The most efficient constructive heuristic so far for the Permutation Flow shop Scheduling Problem (PFSSP) with makespan minimization criterion is the NEH heuristic. It iteratively inserts a non-scheduled job into the position of the partial schedule
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::539753238fffc5bd57f51a60872e0f84
https://doi.org/10.29007/ch1l
https://doi.org/10.29007/ch1l
Publikováno v:
Computers & Operations Research. 40:24-32
We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches in electrical distribution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d05980d65794d89ee7e27ec5369289d
https://doi.org/10.1016/j.cor.2012.05.006
https://doi.org/10.1016/j.cor.2012.05.006
Publikováno v:
CASE
Persons with disabilities have severe problems participating in the job market and their unemployment rate is usually much higher than the average of the population. This motivates the research of new modes of production which allow to include these
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bda53c872334e083aaacc09a133c46f
https://doi.org/10.1109/coase.2015.7294227
https://doi.org/10.1109/coase.2015.7294227
Publikováno v:
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname
instname
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 workstations, and solving the corres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7c1751172dba93cbf85546c061bc1e4
https://hdl.handle.net/10251/61069
https://hdl.handle.net/10251/61069
Autor:
Leonardo F. S. Moura, Guilherme Grochau Azzi, Alexander J. Benavides, Maicon de Brito do Amarante, Luciana S. Buriol, Tiago Sommer, Ana L. C. Bazzan, Marcus Ritt
Publikováno v:
ECMS
Cellular automata models for traffic movement assume that vehicles are particles without routes. However, if one is interested in analysing microscopic properties, it is necessary to assign a route to each trip. This paper discusses the latest develo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b25a9eff7a8a5a1c9ec778502b45b2f5
https://doi.org/10.7148/2011-0091-0097
https://doi.org/10.7148/2011-0091-0097
Autor:
Bazzan, Ana L. C., Do Amarante, Maicon B., Azzi, Guilherme G., Alexander J. Benavides, Buriol, Luciana S., Moura, Leonardo, Ritt, Marcus P., Sommer, Tiago
Publikováno v:
Alexander J. Benavides
Publons
Publons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::469cb336b10ceaa94c15fc1f0d07aea1
https://publons.com/publon/9337127/
https://publons.com/publon/9337127/