T. T. Narendran

According to our database, T. T. Narendran authored at least 15 papers between 1990 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Multi-period multi-product closed loop supply chain network design: A relaxation approach.

Subramanian Pazhani, Abraham Mendoza, Ramkumar Nambirajan, T. T. Narendran, K. Ganesh, Elías Olivares Benítez

Comput. Ind. Eng., 2021

2020

CAR: heuristics for the inventory routing problem.

Ramkumar Nambirajan, Abraham Mendoza, Subramanian Pazhani, T. T. Narendran, K. Ganesh

Wirel. Networks, 2020

2018

A model for planning the product portfolio and launch timings under resource constraints.

Binay Dash, M. S. Gajanand, T. T. Narendran

Int. J. Prod. Res., 2018

2016

CARE: Heuristics for two-stage multi-product inventory routing problems with replenishments.

Ramkumar Nambirajan, Abraham Mendoza, Subramanian Pazhani, T. T. Narendran, K. Ganesh

Comput. Ind. Eng., 2016

2013

An Approach for Setting Inventory Norms for a Two-Echelon Supply Chain.

N. Ramkumar, P. Subramanian, T. T. Narendran, K. Ganesh

Int. J. Inf. Syst. Supply Chain Manag., 2013

PRISM: PRIority based SiMulated annealing for a closed loop supply chain network design problem.

P. Subramanian, N. Ramkumar, T. T. Narendran, K. Ganesh

Appl. Soft Comput., 2013

2012

Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization.

A. Chandramouli, L. Vivek Srinivasan, T. T. Narendran

Int. J. Green Comput., 2012

2011

On the usage of Lagrangean Relaxation for the convoy movement problem.

P. N. Ram Kumar, T. T. Narendran

J. Oper. Res. Soc., 2011

2010

Mathematical model for multi-echelon, multi-product, single time-period closed loop supply chain.

P. Subramanian, N. Ramkumar, T. T. Narendran

Int. J. Bus. Perform. Supply Chain Model., 2010

2008

Integer programming formulation for convoy movement problem.

P. N. Ram Kumar, T. T. Narendran

Int. J. Intell. Def. Support Syst., 2008

2007

CLOVES: A cluster-and-search heuristic to solve the vehicle routing problem with delivery and pick-up.

K. Ganesh, T. T. Narendran

Eur. J. Oper. Res., 2007

Freight Train Routing and Scheduling in a passenger rail Network: Computational Complexity and the Stepwise Dispatching Heuristic.

T. Godwin, Ram Gopalan, T. T. Narendran

Asia Pac. J. Oper. Res., 2007

2006

Locomotive assignment and freight train scheduling using genetic algorithms.

T. Godwin, Ram Gopalan, T. T. Narendran

Int. Trans. Oper. Res., 2006

1997

On the use of the asymptotic forms of the boolean matrix for designing cellular manufacturing systems - An improved approach.

G. Jayakrishnan Nair, T. T. Narendran

Eur. J. Oper. Res., 1997

1990

An interactive procedure for multiobjective optimization using nash bargaining principle.

V. Venugopal, T. T. Narendran

Decis. Support Syst., 1990