| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
Comput. Oper. Res.
|
| 2026 | J | jnl |
A hybrid population-based ruin-and-recreate algorithm for the blocking flow shop scheduling problem.
Eur. J. Oper. Res.
|
| 2026 | J | jnl |
Comput. Oper. Res.
|
| 2025 | J | jnl |
CoRR
|
| 2025 | J | jnl |
J. Oper. Res. Soc.
|
| 2025 | — | conf |
CDC
|
| 2025 | J | jnl |
Optim. Lett.
|
| 2025 | J | jnl |
Comput. Oper. Res.
|
| 2024 | J | jnl |
Comput. Oper. Res.
|
| 2024 | — | conf |
ICEIS (1)
|
| 2024 | J | jnl |
Oper. Res. Lett.
|
| 2024 | J | jnl |
Eur. J. Oper. Res.
|
| 2024 | J | jnl |
Eur. J. Oper. Res.
|
| 2023 | J | jnl |
Transp. Sci.
|
| 2023 | J | jnl |
Comput. Oper. Res.
|
| 2023 | Misc | conf |
WSC
|
| 2022 | J | jnl |
Eur. J. Oper. Res.
|
| 2022 | J | jnl |
INFORMS J. Comput.
|
| 2022 | J | jnl |
J. Heuristics
|
| 2022 | J | jnl |
OR Spectr.
|
| 2022 | J | jnl |
J. Oper. Res. Soc.
|
| 2021 | J | jnl |
Comput. Oper. Res.
|
| 2021 | J | jnl |
Eur. J. Oper. Res.
|
| 2021 | J | jnl |
Comput. Oper. Res.
|
| 2021 | — | conf |
ICEIS (1)
|
| 2021 | J | jnl |
J. Oper. Res. Soc.
|
| 2021 | J | jnl |
J. Glob. Optim.
|
| 2021 | J | jnl |
J. Heuristics
|
| 2021 | J | jnl |
Optim. Lett.
|
| 2021 | J | jnl |
CoRR
|
| 2020 | J | jnl |
Comput. Networks
|
| 2020 | J | jnl |
J. Sched.
|
| 2020 | J | jnl |
Eur. J. Oper. Res.
|
| 2020 | J | jnl |
Comput. Oper. Res.
|
| 2020 | J | jnl |
Optim. Lett.
|
| 2019 | J | jnl |
Ann. Oper. Res.
|
| 2019 | J | jnl |
Expert Syst. Appl.
|
| 2019 | J | jnl |
CoRR
|
| 2019 | J | jnl |
J. Sched.
|
| 2019 | J | jnl |
Transp. Sci.
|
| 2018 | J | jnl |
Optim. Lett.
|
| 2018 | J | jnl |
Networks
|
| 2018 | J | jnl |
Appl. Soft Comput.
|
| 2018 | J | jnl |
Comput. Oper. Res.
|
| 2018 | J | jnl |
Eur. J. Oper. Res.
|
| 2018 | J | jnl |
J. Oper. Res. Soc.
|
| 2018 | J | jnl |
J. Oper. Res. Soc.
|
| 2018 | J | jnl |
Eur. J. Oper. Res.
|
| 2017 | J | jnl |
Comput. Oper. Res.
|
| 2017 | J | jnl |
Discret. Appl. Math.
|
| 2017 | J | jnl |
Comput. Optim. Appl.
|
| 2017 | J | jnl |
Comput. Oper. Res.
|
| 2017 | J | jnl |
Comput. Oper. Res.
|
| 2017 | J | jnl |
Eur. J. Oper. Res.
|
| 2016 | J | jnl |
INFORMS J. Comput.
|
| 2016 | J | jnl |
CoRR
|
| 2016 | J | jnl |
J. Comb. Optim.
|
| 2016 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
Comput. Oper. Res.
|
| 2015 | — | conf |
SBESC
|
| 2015 | J | jnl |
CoRR
|
| 2015 | J | jnl |
Comput. Oper. Res.
|
| 2014 | J | jnl |
CoRR
|
| 2014 | J | jnl |
Eur. J. Oper. Res.
|
| 2014 | J | jnl |
CoRR
|
| 2013 | J | jnl |
Comput. Oper. Res.
|
| 2013 | J | jnl |
J. Heuristics
|
| 2013 | J | jnl |
J. Oper. Res. Soc.
|
| 2013 | J | jnl |
An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems.
Expert Syst. Appl.
|
| 2013 | J | jnl |
Optim. Lett.
|
| 2013 | J | jnl |
Comput. Oper. Res.
|
| 2013 | J | jnl |
CoRR
|
| 2012 | J | jnl |
Comput. Ind. Eng.
|
| 2012 | J | jnl |
Eur. J. Oper. Res.
|
| 2012 | J | jnl |
Eur. J. Oper. Res.
|
| 2012 | J | jnl |
Optim. Lett.
|
| 2011 | J | jnl |
Oper. Res. Lett.
|
| 2010 | J | jnl |
Comput. Oper. Res.
|
| 2010 | B | conf |
SEA
|
| 2008 | B | conf |
EvoCOP
|