T. T. Narendran

15 papers Journal 15
YearRankTypeTitle / Venue / Authors
2021 J jnl
Multi-period multi-product closed loop supply chain network design: A relaxation approach.
Comput. Ind. Eng.
Subramanian Pazhani, Abraham Mendoza, Ramkumar Nambirajan, T. T. Narendran, K. Ganesh, Elías Olivares Benítez
2020 J jnl
CAR: heuristics for the inventory routing problem.
Wirel. Networks
Ramkumar Nambirajan, Abraham Mendoza, Subramanian Pazhani, T. T. Narendran, K. Ganesh
2018 J jnl
A model for planning the product portfolio and launch timings under resource constraints.
Int. J. Prod. Res.
Binay Dash, M. S. Gajanand, T. T. Narendran
2016 J jnl
CARE: Heuristics for two-stage multi-product inventory routing problems with replenishments.
Comput. Ind. Eng.
Ramkumar Nambirajan, Abraham Mendoza, Subramanian Pazhani, T. T. Narendran, K. Ganesh
2013 J jnl
An Approach for Setting Inventory Norms for a Two-Echelon Supply Chain.
Int. J. Inf. Syst. Supply Chain Manag.
N. Ramkumar, P. Subramanian, T. T. Narendran, K. Ganesh
2013 J jnl
PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem.
Appl. Soft Comput.
P. Subramanian, N. Ramkumar, T. T. Narendran, K. Ganesh
2012 J jnl
Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization.
Int. J. Green Comput.
A. Chandramouli, L. Vivek Srinivasan, T. T. Narendran
2011 J jnl
On the usage of Lagrangean Relaxation for the convoy movement problem.
J. Oper. Res. Soc.
P. N. Ram Kumar, T. T. Narendran
2010 J jnl
Mathematical model for multi-echelon, multi-product, single time-period closed loop supply chain.
Int. J. Bus. Perform. Supply Chain Model.
P. Subramanian, N. Ramkumar, T. T. Narendran
2008 J jnl
Integer programming formulation for convoy movement problem.
Int. J. Intell. Def. Support Syst.
P. N. Ram Kumar, T. T. Narendran
2007 J jnl
CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up.
Eur. J. Oper. Res.
K. Ganesh, T. T. Narendran
2007 J jnl
Freight Train Routing and Scheduling in a passenger rail Network: Computational Complexity and the Stepwise Dispatching Heuristic.
Asia Pac. J. Oper. Res.
T. Godwin, Ram Gopalan, T. T. Narendran
2006 J jnl
Locomotive assignment and freight train scheduling using genetic algorithms.
Int. Trans. Oper. Res.
T. Godwin, Ram Gopalan, T. T. Narendran
1997 J jnl
On the use of the asymptotic forms of the boolean matrix for designing cellular manufacturing systems - An improved approach.
Eur. J. Oper. Res.
G. Jayakrishnan Nair, T. T. Narendran
1990 J jnl
An interactive procedure for multiobjective optimization using nash bargaining principle.
Decis. Support Syst.
V. Venugopal, T. T. Narendran