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
- PublicationBounding strategies for obtaining a lower bound for N-job and M-machine flowshop scheduling problem with objective of minimising the total flowtime of jobs(01-01-2021)
;Kumar, S. Saravana; Leisten, RainerIn this paper, bounding strategies for determining a lower bound on the completion time of a job sequenced in each position in the permutation sequence on each machine in permutation flowshop scheduling problem with minimisation of total flowtime of jobs as objective are discussed. Basically, the bounding strategies are machine-based bounding strategies used for determining the lower bound on total flowtime of jobs for all the small-sized and large-sized benchmark flowshop scheduling problem instances proposed by Vallada et al. (2015). The lower bound matrix can be pruned as tightening constraints into the mixed integer linear programming (MILP) model with objective of minimisation of total flowtime of jobs. Since the flowshop scheduling problem with total flowtime objective is difficult, two kinds of linear programming (LP) relaxation methods are used for determining an LP-based lower bound on total flowtime of jobs for some benchmark problem instances proposed by Vallada et al. (2015). - PublicationHeuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling(01-01-2017)
;Rajendran, Suchithra; Leisten, RainerIn this paper, we propose two new heuristic tie-breaking rules in the implementation of the well-known NEH heuristic for permutation flow-shop scheduling. While implementing this heuristic, it is known that ties do frequently occur when the initial ordering of jobs is obtained and when the choice of the best partial sequence among the sequences having the same makespan is done. In this paper, we propose two heuristic tie-breaking rules called NEHMSWG and NEHMinS-PS. We investigate their performance and that of the best-known heuristic tie-breaking rule, relative to the optimal/best-known upper bounds on the makespan, by considering benchmark permutation flow-shop scheduling problem instances. The results of performance evaluation reveal that the proposed tie-breaking rules are simple and effective, and improve the solutions with respect to many problem instances in comparison to the best known heuristic rule reported in the literature.