Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach

This study addresses process sequencing subject to precedence constraints which arises as a sub-problem in scheduling, planning and routing problems. The process sequencing problem can be modeled as the travelling salesman problem with precedence constraints (TSPPC). In this study a new genetic algo...

Full description

Bibliographic Details
Main Author: N. M., Razali
Format: Article
Language:English
Published: Trans Tech Publications, Switzerland 2014
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/6671/
http://umpir.ump.edu.my/id/eprint/6671/
http://umpir.ump.edu.my/id/eprint/6671/
http://umpir.ump.edu.my/id/eprint/6671/1/fkp-2014-noraini-process_sequencing_model_abs_only.pdf

Similar Items