| Year | Rank | Type | Title / Venue / Authors |
|---|---|---|---|
| 2022 | J | jnl |
INFORMS J. Comput.
|
| 2020 | J | jnl |
Eur. J. Oper. Res.
|
| 2019 | J | jnl |
Transp. Sci.
|
| 2019 | J | jnl |
Oper. Res.
|
| 2016 | J | jnl |
J. Oper. Res. Soc.
|
| 2016 | J | jnl |
Inf. Process. Lett.
|
| 2016 | J | jnl |
Discret. Appl. Math.
|
| 2016 | J | jnl |
Asia Pac. J. Oper. Res.
|
| 2016 | J | jnl |
Interfaces
|
| 2015 | J | jnl |
Theor. Comput. Sci.
|
| 2015 | J | jnl |
J. Oper. Res. Soc.
|
| 2014 | J | jnl |
SIAM J. Discret. Math.
|
| 2012 | J | jnl |
J. Oper. Res. Soc.
|
| 2012 | J | jnl |
Eur. J. Oper. Res.
|
| 2010 | J | jnl |
Eur. J. Oper. Res.
|
| 2009 | J | jnl |
Eur. J. Oper. Res.
|
| 2009 | — | conf |
CCA/ISIC
|
| 2009 | J | jnl |
Oper. Res. Lett.
|
| 2008 | J | jnl |
J. Oper. Res. Soc.
|
| 2008 | J | jnl |
Eur. J. Oper. Res.
|
| 2008 | J | jnl |
An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs.
Comput. Oper. Res.
|
| 2008 | — | conf |
APPROX-RANDOM
|
| 2008 | A* | conf |
SODA
|
| 2008 | J | jnl |
Oper. Res. Lett.
|
| 2006 | J | jnl |
Eur. J. Oper. Res.
|
| 2005 | J | jnl |
Comput. Oper. Res.
|
| 2005 | J | jnl |
Eur. J. Oper. Res.
|
| 2004 | J | jnl |
Oper. Res.
|
| 2004 | — | conf |
SMC (2)
|
| 2003 | B | conf |
SMC
|
| 2002 | J | jnl |
Oper. Res. Lett.
|
| 2002 | J | jnl |
Transp. Sci.
|
| 2001 | J | jnl |
Comput. Aided Des.
|
| 2001 | J | jnl |
Inf. Process. Lett.
|
| 1999 | J | jnl |
Comput. Aided Des.
|
| 1996 | J | jnl |
Discret. Appl. Math.
|
| 1996 | J | jnl |
Oper. Res. Lett.
|
| 1995 | J | jnl |
Comput. Oper. Res.
|
| 1995 | J | jnl |
Comput. Oper. Res.
|
| 1993 | J | jnl |
Oper. Res. Lett.
|
| 1992 | J | jnl |
Ann. Oper. Res.
|
| 1992 | J | jnl |
Networks
|
| 1992 | J | jnl |
Oper. Res.
|
| 1992 | J | jnl |
Oper. Res. Lett.
|
| 1992 | J | jnl |
Discret. Appl. Math.
|
| 1990 | J | jnl |
Discret. Math.
|
| 1990 | J | jnl |
Discret. Appl. Math.
|
| 1990 | J | jnl |
INFORMS J. Comput.
|