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
- PublicationA heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs(01-01-1997)
; Ziegler, H.The problem of scheduling in a static flowshop with sequence-dependent setup times of jobs (FSDS) is considered in this paper. A new heuristic to minimize the sum of weighted flowtime of jobs in a FSDS is proposed. An improvement scheme is supplemented to enhance the quality of the heuristic solution. An extensive computational performance analysis has shown that the proposed heuristic is computationally faster and more effective in yielding solutions of better quality than the existing heuristic. An interesting observation is that even though the proposed heuristic aims to minimize the sum of weighted flowtime of jobs (just like the existing heuristic), it fares much better than the existing heuristic in minimizing the maximum weighted flowtime of a job too. © 1997 Elsevier Science Ltd. - PublicationScheduling in flowshop and cellular manufacturing systems with multiple objectives-a genetic algorithmic approach(01-01-1996)
;Sridhar, Jagabandhu B.The problem of scheduling in flowshop and flowline-based cellular manufacturing systems (CMS) is considered with the objectives of minimizing makespan, total flowtime and machine idletime. We first discuss the formulation of time-tabling in a flowline-based CMS. A genetic algorithm is then presented for scheduling in a flowshop. The proposed genetic algorithm is compared with the existing multi-criterion heuristic, and results of the computational evaluation are presented. We introduce some modifications in the heuristic seed sequences, while using them to ¡nitialÍ7.e subpopulations in the algorithm for scheduling in a flowline-based CMS. The proposed algorithm is also found to perform well for scheduling in a flowline-based CMS. © 1996 Taylor & Francis Ltd.