default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChandrasekharan Rajendran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Teena Thomas
, Sharan Srinivas, Chandrasekharan Rajendran:
Collaborative truck multi-drone delivery system considering drone scheduling and en route operations. Ann. Oper. Res. 339(1-2): 693-739 (2024)- 2023
- [j25]Santhosh Kumar Selvam, Chandrasekharan Rajendran:
tofee-tree: automatic feature engineering framework for modeling trend-cycle in time series forecasting. Neural Comput. Appl. 35(16): 11563-11582 (2023)
2010 – 2019
- 2019
- [j24]Sharan Srinivas, Chandrasekharan Rajendran:
Community detection and influential node identification in complex networks using mathematical programming. Expert Syst. Appl. 135: 296-312 (2019) - 2018
- [j23]Sakthivel Madankumar, Chandrasekharan Rajendran:
Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain. Comput. Oper. Res. 89: 183-192 (2018) - [c5]Dorothea Calmels, Chandrasekharan Rajendran, Hans Ziegler:
Heuristics for Solving the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines. OR 2018: 459-465 - 2017
- [c4]Bharathan S, Chandrasekharan Rajendran, Sundarraj RP:
Penalty Based Mathematical Models for Web Service Composition in a Geo-Distributed Cloud Environment. ICWS 2017: 886-889 - 2016
- [j22]Devarajulu Sabitha, Chandrasekharan Rajendran, S. Kalpakam, Hans Ziegler:
The value of information sharing in a serial supply chain with AR(1) demand and non-zero replenishment lead times. Eur. J. Oper. Res. 255(3): 758-777 (2016) - 2015
- [j21]Rainer Leisten, Chandrasekharan Rajendran:
Variability of completion time differences in permutation flow shop scheduling. Comput. Oper. Res. 54: 155-167 (2015) - 2014
- [j20]Muthusamy Ganesh, Srinivasan Raghunathan, Chandrasekharan Rajendran:
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. 58: 79-94 (2014) - [j19]Muthusamy Ganesh, Srinivasan Raghunathan, Chandrasekharan Rajendran:
Distribution and Equitable Sharing of Value From Information Sharing Within Serial Supply Chains. IEEE Trans. Engineering Management 61(2): 225-236 (2014) - 2012
- [j18]K. Antony Arokia Durai Raj, Chandrasekharan Rajendran:
A genetic algorithm for solving the fixed-charge transportation model: Two-stage problem. Comput. Oper. Res. 39(9): 2016-2032 (2012) - 2011
- [j17]Brijesh Paul, Chandrasekharan Rajendran:
Rationing mechanisms and inventory control-policy parameters for a divergent supply chain operating with lost sales and costs of review. Comput. Oper. Res. 38(8): 1117-1130 (2011) - [c3]R. Karthi, Chandrasekharan Rajendran, K. Rameshkumar:
Neighborhood Search Assisted Particle Swarm Optimization (NPSO) Algorithm for Partitional Data Clustering Problems. ACC (3) 2011: 552-561 - [c2]V. Krithika, Arshinder Kaur, K. Chandra Sekaran, Chandrasekharan Rajendran:
Developing a Conceptual Relationship between Web Service Supply Chain Entities. SERVICES 2011: 97-98 - 2010
- [c1]Suchithra Rajendran, Chandrasekharan Rajendran, Hans Ziegler:
An Ant-Colony Algorithm to Transform Jobshops into Flowshops: A Case of Shortest-Common-Supersequence Stringology Problem. BIONETICS 2010: 413-424
2000 – 2009
- 2009
- [j16]N. Madhushini, Chandrasekharan Rajendran, Y. Deepa:
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. 60(7): 991-1004 (2009) - 2007
- [j15]Chandrasekharan Rajendran, Knut Alicke:
Dispatching in flowshops with bottleneck machines. Comput. Ind. Eng. 52(1): 89-106 (2007) - 2006
- [j14]J. Sudhir Ryan Daniel, Chandrasekharan Rajendran:
Heuristic approaches to determine base-stock levels in a serial supply chain with a single objective and with multiple objectives. Eur. J. Oper. Res. 175(1): 566-592 (2006) - [j13]George Issac, Chandrasekharan Rajendran, R. N. Anantharaman:
An instrument for the measurement of customer perceptions of quality management in the software industry: An empirical study in India. Softw. Qual. J. 14(4): 291-308 (2006) - 2005
- [j12]Chandrasekharan Rajendran, Hans Ziegler:
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Comput. Ind. Eng. 48(4): 789-797 (2005) - [j11]S. Thiagarajan, Chandrasekharan Rajendran:
Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Comput. Ind. Eng. 49(4): 463-503 (2005) - [j10]T. K. Varadharajan, Chandrasekharan Rajendran:
A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs. Eur. J. Oper. Res. 167(3): 772-795 (2005) - [j9]J. Sudhir Ryan Daniel, Chandrasekharan Rajendran:
A simulation-based genetic algorithm for inventory optimization in a serial supply chain. Int. Trans. Oper. Res. 12(1): 101-127 (2005) - [j8]Oliver Holthaus, Chandrasekharan Rajendran:
A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs. J. Oper. Res. Soc. 56(8): 947-953 (2005) - 2004
- [j7]Chandrasekharan Rajendran, Hans Ziegler:
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur. J. Oper. Res. 155(2): 426-438 (2004) - [j6]M. S. Jayamohan, Chandrasekharan Rajendran:
Development and analysis of cost-based dispatching rules for job shop scheduling. Eur. J. Oper. Res. 157(2): 307-321 (2004) - 2003
- [j5]Chandrasekharan Rajendran, Hans Ziegler:
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. 149(3): 513-522 (2003) - 2001
- [j4]Chandrasekharan Rajendran, Hans Ziegler:
A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs. Eur. J. Oper. Res. 131(3): 622-634 (2001) - [j3]K. Gowrishankar, Chandrasekharan Rajendran, G. Srinivasan:
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. 132(3): 643-665 (2001)
1990 – 1999
- 1999
- [j2]Chandrasekharan Rajendran, Oliver Holthaus:
A comparative study of dispatching rules in dynamic flowshops and jobshops. Eur. J. Oper. Res. 116(1): 156-170 (1999) - 1997
- [j1]Kurt Marti, Chandrasekharan Rajendran, Joachim R. Daduna, Peter Brucker:
Book reviews. Math. Methods Oper. Res. 45(1): 161-166 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
