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
An instrument for measuring total quality management implementation in manufacturing-based business units in India
TL;DR: In this paper, the authors describe an empirical research on the development of an instrument for total quality management (TQM) implementation in business units in India, through a detailed analysis of the literature, they identified 150 measures of quality management.
Journal ArticleDOI
An efficient heuristic approach to the scheduling of jobs in a flowshop
TL;DR: In this article, three heuristic algorithms for flow shop scheduling with the objective of minimizing total flowtime are presented, and the proposed algorithms are found to give consistently near-optimal solutions and fare better than the existing methods.
Journal ArticleDOI
A conceptual framework of service quality in healthcare
TL;DR: This framework enables hospital managers to understand how patients and their attendants evaluate the quality of healthcare provided in respect of every dimension and would aid them to allocate resources to various aspects of healthcare, with respect to these two customer groups.
Journal ArticleDOI
Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach
TL;DR: The proposed genetic algorithm is compared with the existing multi-criterion heuristic, and results of the computational evaluation are presented, and it is found to perform well for scheduling in a flowline-based CMS.
Journal ArticleDOI
Heuristic algorithms for scheduling in the no-wait flowshop
TL;DR: In this paper, two simple heuristic algorithms for scheduling to minimize makespan in the constrained (or no-wait) flow shop are presented, and evaluated over a large number of problems of various sizes.