| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2026 | J | jnl |
J. Comb. Optim.
|
| 2026 | J | jnl |
Theor. Comput. Sci.
|
| 2025 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2025 | J | jnl |
J. Oper. Res. Soc.
|
| 2025 | J | jnl |
Two-machine permutation flow shop scheduling with generalized due dates to minimize total late work.
J. Sched.
|
| 2024 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2023 | J | jnl |
4OR
|
| 2023 | J | jnl |
Optim. Lett.
|
| 2023 | J | jnl |
Optim. Lett.
|
| 2022 | J | jnl |
Discret. Appl. Math.
|
| 2022 | J | jnl |
Optim. Lett.
|
| 2022 | J | jnl |
J. Sched.
|
| 2021 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2021 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2021 | J | jnl |
Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty.
J. Comb. Optim.
|
| 2020 | J | jnl |
Optim. Lett.
|
| 2020 | J | jnl |
J. Sched.
|
| 2020 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2020 | J | jnl |
J. Sched.
|
| 2019 | J | jnl |
Comput. Ind. Eng.
|
| 2019 | J | jnl |
J. Comb. Optim.
|
| 2019 | J | jnl |
Oper. Res. Lett.
|
| 2018 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2017 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2017 | J | jnl |
Eur. J. Oper. Res.
|
| 2016 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2016 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2015 | J | jnl |
Eur. J. Oper. Res.
|
| 2015 | J | jnl |
Comput. Oper. Res.
|
| 2015 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2014 | J | jnl |
Eur. J. Oper. Res.
|
| 2014 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2014 | J | jnl |
Theor. Comput. Sci.
|
| 2013 | J | jnl |
Discret. Appl. Math.
|
| 2013 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2013 | J | jnl |
Eur. J. Oper. Res.
|
| 2013 | J | jnl |
J. Comb. Optim.
|
| 2011 | J | jnl |
J. Comb. Optim.
|
| 2011 | J | jnl |
Eur. J. Oper. Res.
|
| 2011 | J | jnl |
Eur. J. Oper. Res.
|
| 2010 | J | jnl |
Inf. Process. Lett.
|
| 2010 | J | jnl |
Inf. Process. Lett.
|
| 2010 | J | jnl |
Oper. Res. Lett.
|
| 2010 | J | jnl |
Eur. J. Oper. Res.
|
| 2010 | J | jnl |
Eur. J. Oper. Res.
|
| 2009 | J | jnl |
Inf. Process. Lett.
|
| 2007 | J | jnl |
Networks
|
| 2007 | J | jnl |
J. Sched.
|
| 2007 | J | jnl |
Minimizing maximum completion time in a proportionate flow shop with one machine of different speed.
Eur. J. Oper. Res.
|
| 2007 | J | jnl |
Oper. Res. Lett.
|
| 2007 | J | jnl |
Eur. J. Oper. Res.
|
| 2007 | J | jnl |
Comput. Oper. Res.
|
| 2006 | — | conf |
ICCSA (3)
|