Options
C Rajendran
Loading...
Preferred name
C Rajendran
Official Name
C Rajendran
Alternative Name
Rahendran, Chandrasekharan
Rajendran, C.
Rajendran, Chandrasekharan S.
Chandrasekharan, Rajendran
Rajendran, Chandrasekharan
Main Affiliation
Email
ORCID
Scopus Author ID
Google Scholar ID
2 results
Now showing 1 - 2 of 2
- PublicationDevelopment and analysis of cost-based dispatching rules for job shop scheduling(01-09-2004)
;Jayamohan, M. S.Most dispatching rules for job shop scheduling assume that the cost of holding per unit time is the same for all jobs. Likewise, it is assumed that the cost of tardiness per unit time is the same for all jobs. In other words, it is implied that the holding cost of a job is directly proportional to its flowtime, and the tardiness cost of a job is directly proportional to its positive lateness. These assumptions may not hold good in all situations. Some attempts were made to overcome this deficiency, and a couple of dispatching rules were proposed by considering different weights or penalties for different jobs. However, these dispatching rules assume that the holding and tardiness costs per unit time of a given job are the same, even though these costs may differ from job to job in practice. In this study, we propose dispatching rules by explicitly considering different weights or penalties for flowtime and tardiness of a job. Many measures of performance related to weighted flowtime and weighted tardiness of jobs are considered, and the results of simulation are presented. © 2003 Elsevier B.V. All rights reserved. - PublicationA comparative analysis of two different approaches to scheduling in flexible flow shops(01-01-2000)
;Jayamohan, M. S.This work is an investigation about the relative effectiveness of two approaches to scheduling in flexible flow shops: one approach advocating the possible use of different dispatch-ing rules at different stages of the flow shop, and the other suggesting the use of the same dispatching rule at all the stages of the flow shop. In the latter approach, the dispatching rule contains the information related to both process time and duedate. Both approaches aim at the minimization of measures related to flowtime and tardiness of jobs. This paper essentially is an attempt at exploring the relative effectiveness of these two approaches to scheduling. © 2000, Taylor & Francis Group, LLC. All rights reserved.