C
Chandrasekharan Rajendran
Researcher at Indian Institute of Technology Madras
Publications - 197
Citations - 10083
Chandrasekharan Rajendran is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Job shop scheduling & Supply chain. The author has an hindex of 52, co-authored 192 publications receiving 9404 citations. Previous affiliations of Chandrasekharan Rajendran include Indian Institutes of Technology & VIT University.
Papers
More filters
Journal ArticleDOI
Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers
TL;DR: In this paper, the problem of scheduling in a Kanban flow shop with the objective of minimizing the sum of weighted flowtime, weighted tardiness and weighted earliness of containers is considered.
Journal ArticleDOI
A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
TL;DR: In this paper, the problem of scheduling in dynamic flowshops with buffer constraints is addressed, and the best dispatching rules for scheduling in unconstrained shops have been identified from the existing literature.
Journal ArticleDOI
A genetic algorithmic approach to multi-objective scheduling in a Kanban-controlled flowshop with intermediate buffer and transport constraints
TL;DR: In this article, a non-dominated and normalized distance-ranked sorting multi-objective genetic algorithm (NDSMGA) was proposed to solve the problem of extended permutation flowshop scheduling with the intermediate buffers.
Journal ArticleDOI
Due-date setting methodologies based on simulated annealing—an experimental study in a real-life job shop
TL;DR: In this paper, the authors present a real-life study of a job shop manufacturing ball screws and suggest an efficient scheduling and due-date setting policy for the shop, which is based on a search algorithm, simulated annealing algorithm, and a combination of simulated AN algorithm and regression analysis.
Journal ArticleDOI
The value of information sharing in a serial supply chain with AR(1) demand and non-zero replenishment lead times
TL;DR: It is proved for a multi-stage supply chain that there exists no difference, in terms of the expectation and the variance of total demand over lead time, between supply-chain-wide information sharing and VMI, and the value of information sharing is always greater than or equal to those obtained by an existing study.