Chandrasekharan Rajendran
Orcid: 0000-0001-6252-6217
According to our database1,
Chandrasekharan Rajendran
authored at least 30 papers
between 1997 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
tofee-tree: automatic feature engineering framework for modeling trend-cycle in time series forecasting.
Neural Comput. Appl., June, 2023
2019
Community detection and influential node identification in complex networks using mathematical programming.
Expert Syst. Appl., 2019
2018
Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain.
Comput. Oper. Res., 2018
Heuristics for Solving the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines.
Proceedings of the Operations Research Proceedings 2018, 2018
2017
Penalty Based Mathematical Models for Web Service Composition in a Geo-Distributed Cloud Environment.
Proceedings of the 2017 IEEE International Conference on Web Services, 2017
2016
The value of information sharing in a serial supply chain with AR(1) demand and non-zero replenishment lead times.
Eur. J. Oper. Res., 2016
2015
Comput. Oper. Res., 2015
2014
Distribution and Equitable Sharing of Value From Information Sharing Within Serial Supply Chains.
IEEE Trans. Engineering Management, 2014
The value of information sharing in a multi-product, multi-level supply chain: Impact of product substitution, demand correlation, and partial information sharing.
Decis. Support Syst., 2014
2012
A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem.
Comput. Oper. Res., 2012
2011
Rationing mechanisms and inventory control-policy parameters for a divergent supply chain operating with lost sales and costs of review.
Comput. Oper. Res., 2011
Proceedings of the World Congress on Services, 2011
Neighborhood Search Assisted Particle Swarm Optimization (NPSO) Algorithm for Partitional Data Clustering Problems.
Proceedings of the Advances in Computing and Communications, 2011
2010
An Ant-Colony Algorithm to Transform Jobshops into Flowshops: A Case of Shortest-Common-Supersequence Stringology Problem.
Proceedings of the Bio-Inspired Models of Network, Information, and Computing Systems, 2010
2009
Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs.
J. Oper. Res. Soc., 2009
2007
2006
An instrument for the measurement of customer perceptions of quality management in the software industry: An empirical study in India.
Softw. Qual. J., 2006
Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives.
Eur. J. Oper. Res., 2006
2005
A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs.
J. Oper. Res. Soc., 2005
A simulation-based genetic algorithm for inventory optimization in a serial supply chain.
Int. Trans. Oper. Res., 2005
A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs.
Eur. J. Oper. Res., 2005
Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs.
Comput. Ind. Eng., 2005
Comput. Ind. Eng., 2005
2004
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
Eur. J. Oper. Res., 2004
Eur. J. Oper. Res., 2004
2003
Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
Eur. J. Oper. Res., 2003
2001
A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs.
Eur. J. Oper. Res., 2001
Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date.
Eur. J. Oper. Res., 2001
1999
Eur. J. Oper. Res., 1999
1997