`Travelled to:`

1 × China

1 × Korea

1 × Taiwan

2 × USA

`Collaborated with:`

W.H.V.Lui J.M.Nilakantan Y.T.Teo G.Kanagaraj W.C.E.Lim M.Yogeswaran M.K.Tiwari R.S.Pandian S.S.Mahapatra S.Saravanasankar S.Chandrasekaran R.K.Suresh N.Vijayakumar S.S.Sankar S.Sriram M.Gurumarimuthu

`Talks about:`

algorithm (5) problem (4) assembl (4) hybrid (3) genet (3) use (3) schedul (2) heurist (2) applic (2) optim (2)

## Person: S. G. Ponnambalam

### DBLP: Ponnambalam:S=_G=

### Contributed to:

### Wrote 8 papers:

- CASE-2014-KanagarajPL #algorithm #optimisation #process
- Application of a hybridized cuckoo search-genetic algorithm to path optimization for PCB holes drilling process (GK, SGP, WCEL), pp. 373–378.
- CASE-2012-LuiP #assembly #difference #evolution #flexibility #scheduling #using
- Scheduling Flexible Assembly Lines using variants of Differential Evolution (WHVL, SGP), pp. 594–599.
- CASE-2012-NilakantanP #assembly #performance #problem
- An efficient PSO for type II robotic assembly line balancing problem (JMN, SGP), pp. 600–605.
- CASE-2008-PonnambalamPMS #network #using
- Modified ART1 neural networks for cell formation using production data (SGP, RSP, SSM, SS), pp. 603–608.
- CASE-2008-TeoP #heuristic #hybrid #layout #problem
- A hybrid ACO/PSO heuristic to solve single row layout problem (YTT, SGP), pp. 597–602.
- CASE-2007-YogeswaranPT #algorithm #heuristic #hybrid #problem #search-based #using
- An hybrid heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS (MY, SGP, MKT), pp. 182–187.
- CASE-2006-ChandrasekaranSPV #algorithm #optimisation #permutation #problem #scheduling
- An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance (SC, RKS, SGP, NV), pp. 513–518.
- CASE-2006-PonnambalamSSG #algorithm #assembly #parallel #search-based
- PARALLEL POPULATIONS GENETIC ALGORITHM FOR MINIMIZING ASSEMBLY VARIATION IN SELECTIVE ASSEMBLY (SGP, SSS, SS, MG), pp. 496–500.