Ponnambalam, S.G.
Ponnambalam, S.G.
Faculty of Manufacturing and Mechatronics Engineering Technology, Universiti Malaysia Pahang (www
Zweryfikowany adres z ump.edu.my - Strona główna
TytułCytowane przezRok
A multi-objective genetic algorithm for solving assembly line balancing problem
SG Ponnambalam, P Aravindan, GM Naidu
The International Journal of Advanced Manufacturing Technology 16 (5), 341-352, 2000
1822000
A hybrid cuckoo search and genetic algorithm for reliability–redundancy allocation problems
G Kanagaraj, SG Ponnambalam, N Jawahar
Computers & Industrial Engineering 66 (4), 1115-1124, 2013
1342013
An extensive review of research in swarm robotics
Y Mohan, SG Ponnambalam
2009 World Congress on Nature & Biologically Inspired Computing (NaBIC), 140-145, 2009
1302009
A comparative evaluation of assembly line balancing heuristics
SG Ponnambalam, P Aravindan, GM Naidu
The International Journal of Advanced Manufacturing Technology 15 (8), 577-586, 1999
1171999
A multiobjective genetic algorithm for job shop scheduling
SG Ponnambalam, V Ramkumar, N Jawahar
Production planning & control 12 (8), 764-774, 2001
1132001
A tabu search algorithm for job shop scheduling
SG Ponnambalam, P Aravindan, SV Rajesh
The International Journal of Advanced Manufacturing Technology 16 (10), 765-771, 2000
1052000
Evolutionary algorithms for scheduling m-machine flow shop with lot streaming
S Marimuthu, SG Ponnambalam, N Jawahar
Robotics and Computer-Integrated Manufacturing 24 (1), 125-139, 2008
982008
Genetic algorithms for sequencing problems in mixed model assembly lines
SG Ponnambalam, P Aravindan, MS Rao
Computers & Industrial Engineering 45 (4), 669-690, 2003
982003
A TSP-GA multi-objective algorithm for flow-shop scheduling
SG Ponnambalam, H Jagannathan, M Kataria, A Gadicherla
The International Journal of Advanced Manufacturing Technology 23 (11-12 …, 2004
932004
Threshold accepting and ant-colony optimization algorithms for scheduling m-machine flow shops with lot streaming
S Marimuthu, SG Ponnambalam, N Jawahar
Journal of materials processing technology 209 (2), 1026-1041, 2009
862009
Comparative evaluation of genetic algorithms for job-shop scheduling
SG Ponnambalam, P Aravindan, PS Rao
Production Planning & Control 12 (6), 560-574, 2001
802001
A genetic algorithm for scheduling flexible manufacturing systems
N Jawahar, P Aravindan, SG Ponnambalam
The International Journal of Advanced Manufacturing Technology 14 (8), 588-607, 1998
781998
A simulated annealing algorithm for job shop scheduling
SG Ponnambalam, N Jawahar, P Aravindan
Production Planning & Control 10 (8), 767-777, 1999
711999
Constructive and improvement flow shop scheduling heuristics: an extensive evaluation
SG Ponnambalam, P Aravindan, S Chandrasekaran
Production Planning & Control 12 (4), 335-344, 2001
702001
A GA-SA multiobjective hybrid search algorithm for integrating lot sizing and sequencing in flow-line scheduling
SG Ponnambalam, M Reddy
The International Journal of Advanced Manufacturing Technology 21 (2), 126-137, 2003
632003
Obstacle avoidance control of redundant robots using variants of particle swarm optimization
GS Chyan, SG Ponnambalam
Robotics and Computer-Integrated Manufacturing 28 (2), 147-153, 2012
572012
An investigation on minimizing cycle time and total energy consumption in robotic assembly line systems
JM Nilakantan, GQ Huang, SG Ponnambalam
Journal of Cleaner Production 90, 311-325, 2015
542015
Mobile robot path planning using ant colony optimization
YZ Cong, SG Ponnambalam
2009 IEEE/ASME International Conference on Advanced Intelligent Mechatronics …, 2009
522009
AGV schedule integrated with production in flexible manufacturing systems
N Jawahar, P Aravindan, SG Ponnambalam, RK Suresh
The International Journal of Advanced Manufacturing Technology 14 (6), 428-440, 1998
471998
An efficient hybrid evolutionary heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS
M Yogeswaran, SG Ponnambalam, MK Tiwari
International Journal of Production Research 47 (19), 5421-5448, 2009
462009
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20