S
S. Thiagarajan
Researcher at Indian Institute of Technology Madras
Publications - 6
Citations - 209
S. Thiagarajan is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Job shop scheduling & Flow shop scheduling. The author has an hindex of 5, co-authored 6 publications receiving 196 citations.
Papers
More filters
Journal ArticleDOI
Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs
TL;DR: An attempt is made to present dispatching rules by incorporating the relative costs of earliness, tardiness and holding of jobs in the form of scalar weights, and the proposed rules are found to be effective in minimizing the mean and maximum values of the measures of performance.
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
Performance enhancement by using non-permutation schedules in flowline-based manufacturing systems
TL;DR: In this paper, a simple heuristic procedure to derive non-permutation schedules from a given permutation schedule is proposed, with makespan as the primary criterion and total flowtime as the secondary criterion.
Journal ArticleDOI
Generating non-permutation schedules in flowline-based manufacturing sytems with sequence-dependent setup times of jobs: a heuristic approach
TL;DR: In this paper, the problem of non-permutation scheduling in a flowline-based manufacturing system is considered with the focus on the development of nonpermutation schedules, and a simple heuristic procedure to derive non- permutation schedules from a given permutation sequence is proposed.
Journal ArticleDOI
Relative performance evaluation of permutation and non-permutation schedules in flowline-based manufacturing systems with flowtime objective
TL;DR: In this paper, a heuristic procedure to derive non-permutation schedules from a given permutation schedule is proposed, where the minimization of total flowtime of jobs is considered as the objective in the first instance, followed by the consideration of the minimisation of total weighted flow time of jobs.