Rasaratnam Logendran
Oregon State University
80 Papers
1K Citations
Rasaratnam Logendran is an academic researcher from Oregon State University. The author has contributed to research in topics: Tabu search & Job shop scheduling. The author has an hindex of 27, co-authored 78 publications. Previous affiliations of Rasaratnam Logendran include Southern Illinois University Edwardsville.
Chat about Author
Papers
Sequence-dependent group scheduling problems in flexible flow shops
TL;DR: Group scheduling within the context of sequence dependent setup times in flexible flow shops is considered, and the search algorithm that uses short term memory is recommended for problems of all sizes and levels of flexibility.
102
Total flow time minimization in a flowshop sequence-dependent group scheduling problem
TL;DR: The LB method presented in this paper can be generalized to solve the FSDGS problem with other objective functions and compared with the performance of metaheuristic algorithms to evaluate the quality of the solutions.
98
Group scheduling in flexible flow shops
TL;DR: The results show that for small and medium size problems whether or not a computationally more demanding algorithm is employed to solve the level 1 or level 2 problem does not have any bearing on the makespan, but the situation changes dramatically when large size problems are attempted, as a single-setup algorithm which combines the use of single- and multiple-pass heuristic for the level 2 and level 1 problems outperforms another single- setup algorithm with the order of use reversed at all levels of flexibility.
96
Tabu search-based heuristics for cellular manufacturing systems in the presence of alternative process plans
TL;DR: In this paper, the cell formation problem of determining the assignment of parts and machines to each manufacturing cell can be viewed as being divided into two phases, where the first phase deals with the number of machines of each type and a unique process plan for each part.
96
An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes
TL;DR: This paper addresses a sequence- and machine-dependent batch scheduling problem on a set of unrelated-parallel machines where the objective is to minimize a linear combination of total weighted completion time and total weighted tardiness.
90