Rasaratnam Logendran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rasaratnam Logendran has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Yasaman Mehravaran
2 shared publications- Cumhur A. Gelogullari
American Airlines
1 shared publication D Lu
Oregon State University Corvallis OR USA
1 shared publicationM. T. Yazdani Sabouni
Oregon State University
1 shared publication- Madjid Tavana
Business Systems and Analytics Department, Distinguished Chair of Business Analytics La Salle University Philadelphia Pennsylvania USA
1 shared publication Mir Abbas Bozorgirad
1 shared publication
Latest Publications
- 13 April 2022
- Published by Springer Nature in Journal of Scheduling
- Vol. 25 (5) , 589-621
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- 13 April 2022
- Published by Springer Nature in Journal of Scheduling
- Vol. 25 (5) , 589-621
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- 7 August 2015
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 83 (5-8) , 1135-1151
A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics
- 7 August 2015
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 83 (5-8) , 1135-1151
A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics
- 1 October 2013
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (13) , 5061-5076
Non-permutation flowshop scheduling with dual resources
- 1 October 2013
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (13) , 5061-5076
Non-permutation flowshop scheduling with dual resources
- 25 June 2013
- Published by Springer Nature
- p. 1063-1076
PCB Assembly in a Multi-Machine Flowshop with Dynamic Board Release Times
- 25 June 2013
- Published by Springer Nature
- p. 1063-1076
PCB Assembly in a Multi-Machine Flowshop with Dynamic Board Release Times
- 1 April 2013
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 64 (4) , 530-546
Bi-criteria group scheduling with sequence-dependent setup time in a flow shop
A bi-criteria group scheduling problem in a flow shop with sequence-dependent setup time is investigated in this paper. Manufacturing cell and flow shop are two popular scenarios in industry. Dynamic job releases and machine availabilities are assumed. The goal is to minimize the weighted sum of total weighted completion time and total weighted tardiness, which are aimed at satisfying the producer and customer goals separately. Normalized weights are assigned to both criteria to describe the trade-off between the two objectives. Two different initial solution finding mechanisms are proposed, and a tabu-search-based two-level search algorithm is deve1loped to find optimal/near-optimal solutions for the problem. A mathematical model is also developed and implemented to evaluate the optimality of the results from search algorithms for small problem instances. To further uncover the difference in performance of initial solutions and algorithms, an experimental design is performed and results are reported.
- 1 April 2013
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 64 (4) , 530-546
Bi-criteria group scheduling with sequence-dependent setup time in a flow shop
A bi-criteria group scheduling problem in a flow shop with sequence-dependent setup time is investigated in this paper. Manufacturing cell and flow shop are two popular scenarios in industry. Dynamic job releases and machine availabilities are assumed. The goal is to minimize the weighted sum of total weighted completion time and total weighted tardiness, which are aimed at satisfying the producer and customer goals separately. Normalized weights are assigned to both criteria to describe the trade-off between the two objectives. Two different initial solution finding mechanisms are proposed, and a tabu-search-based two-level search algorithm is deve1loped to find optimal/near-optimal solutions for the problem. A mathematical model is also developed and implemented to evaluate the optimality of the results from search algorithms for small problem instances. To further uncover the difference in performance of initial solutions and algorithms, an experimental design is performed and results are reported.
- 1 August 2012
- Published by Elsevier in Expert Systems with Applications
- Vol. 39 (10) , 9021-9030
Sequence-dependent group scheduling problem on unrelated-parallel machines
- 1 August 2012
- Published by Elsevier in Expert Systems with Applications
- Vol. 39 (10) , 9021-9030
Sequence-dependent group scheduling problem on unrelated-parallel machines
- 26 February 2011
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 56 (5-8) , 699-710
Makespan minimization of a flowshop sequence-dependent group scheduling problem
- 26 February 2011
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 56 (5-8) , 699-710
Makespan minimization of a flowshop sequence-dependent group scheduling problem
- 2 February 2011
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 28 (2) , 91-101
Bicriteria supply chain scheduling on unrelated-parallel machines
This article addresses the unrelated-parallel machine scheduling problem with sequence-dependent setup times for minimizing the work-in-process inventory (WIP) while maximizing the customer service level in a supply chain. The machine availabilities and job releases are considered dynamic. In order to meet a variety of needs of the producer and customers, a mathematical model that conforms to a bicriteria objective has been developed. As the proposed research problem is shown to be NP-hard, a metasearch heuristic based upon tabu search is also developed to solve industry-size problems. Moreover, to evaluate the effectiveness of the proposed search algorithm, the search algorithmic solutions obtained for example problems are compared with that of the optimal solutions of the mathematical model obtained from CPLEX. To the best of our knowledge, this research is the first of its kind attempted for this scheduling problem in a supply chain.
- 2 February 2011
- Published by Taylor & Francis in Journal of the Chinese Institute of Industrial Engineers
- Vol. 28 (2) , 91-101
Bicriteria supply chain scheduling on unrelated-parallel machines
This article addresses the unrelated-parallel machine scheduling problem with sequence-dependent setup times for minimizing the work-in-process inventory (WIP) while maximizing the customer service level in a supply chain. The machine availabilities and job releases are considered dynamic. In order to meet a variety of needs of the producer and customers, a mathematical model that conforms to a bicriteria objective has been developed. As the proposed research problem is shown to be NP-hard, a metasearch heuristic based upon tabu search is also developed to solve industry-size problems. Moreover, to evaluate the effectiveness of the proposed search algorithm, the search algorithmic solutions obtained for example problems are compared with that of the optimal solutions of the mathematical model obtained from CPLEX. To the best of our knowledge, this research is the first of its kind attempted for this scheduling problem in a supply chain.
- 17 December 2009
- Published by Springer Nature in Journal of Scheduling
- Vol. 13 (2) , 177-202
Group-scheduling problems in electronics manufacturing
- 17 December 2009
- Published by Springer Nature in Journal of Scheduling
- Vol. 13 (2) , 177-202
Group-scheduling problems in electronics manufacturing