Showing papers by "Chandrasekharan Rajendran published in 1999"
TL;DR: A comparative study on the performance of dispatching rules in the following sets of dynamic manufacturing systems: flowshop and jobshops, and flowshops with missing operations and job shops reveals some interesting observations on the relative performance.
242 citations
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.
Abstract: Total Quality Management (TQM) is an integrative management philosophy aimed at continuously improving the quality of products and processes to achieve customer satisfaction. The TQM literature is replete with practitioner oriented 'do-everything-right' articles and case studies. There is no complete agreement on operating system elements of TQM. The objective of this paper is to describe an empirical research on the development of an instrument for TQM implementation in business units in India. Through a detailed analysis of the literature, this research identified 150 measures of quality management. After a pre-test, 111 measures were used to develop a questionnaire. These items were empirically tested by data collected from 50 respondents. A factor analysis uncovered ten underlying dimensions of TQM with a total of 106 items. These factors and items were found to be reliable and valid.
119 citations
TL;DR: The results of the computational evaluation reveal that the proposed heuristic performs better than the existing one and is relatively evaluated against the existing heuristic for scheduling to minimize the weighted sum of the makespan and maximum tardy of a job.
Abstract: This article deals with the development of a heuristic for scheduling in a flowshop with the objective of minimizing the makespan and maximum tardiness of a job. The heuristic makes use of the simulated annealing technique. The proposed heuristic is relatively evaluated against the existing heuristic for scheduling to minimize the weighted sum of the makespan and maximum tardiness of a job. The results of the computational evaluation reveal that the proposed heuristic performs better than the existing one.
58 citations
TL;DR: In this article, the problem of scheduling in two different types of flowshops (all jobs available at time zero, different job availability times known a priori) and in flowline-based manufacturing cells is considered with the objective of minimizing the sum of weighted flowtime and weighted tardiness of jobs.
26 citations
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.
Abstract: The problem of scheduling in a Kanban flowshop is considered with the objective of minimizing the sum of weighted flowtime, weighted tardiness and weighted earliness of containers. The Kanban flowshop is characterized by the presence of separate input and output buffers between workstations, material handling between workstations, blocking mechanism due to part-type, Production and Withdrawal Kanbans, and setup times separated from process times of containers. First, mathematical formulations for time-tabling of containers for different types of problems are proposed. The development of a simple heuristic to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers is subsequently presented. An improvement scheme is supplemented to the proposed heuristic to enhance the quality of the final solution. The proposed heuristic and the existing heuristics are evaluated in a large number of randomly generated problems of different sizes.
23 citations