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
New dispatching rules for scheduling in a job shop — An experimental study
TL;DR: In this paper, two new dispatching rules for scheduling in a job shop are presented, which combine the process-time and work-content in the queue for the next operation on a job, by making use of additive and alternative approaches.
Journal ArticleDOI
A simulated annealing heuristic for scheduling in a flowshop with bicriteria
TL;DR: The Simulated Annealing technique is applied to develop the proposed heuristic for minimizing makespan and total flowtime and when compared with the existing heuristics, the proposed SA heuristic is found to perform much better.
Journal ArticleDOI
A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell
TL;DR: In this article, the problem of family and job scheduling in a flowline-based manufacturing cell is considered with the criterion of minimizing makespan, followed by minimizing total flowtime, and finally with the bi-criteria of minimizing the makespan and total flow time.
Journal ArticleDOI
Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
TL;DR: An attempt is made to develop efficient dispatching rules by incorporating the relative costs of holding and tardiness of jobs in the form of scalar weights, and the proposed rules are effective in minimizing the means and maximums of the primary measure.
Journal ArticleDOI
Heuristics for scheduling in a flowshop with setup, processing and removal times separated
TL;DR: The problem of scheduling in a flowshop, where setup, processing and removal times are separable, is considered with the objective of minimizing makespan and heuristic algorithms are developed by the introduction of simplifying assumptions.