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...
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/1/fkp-2014-noraini-process_sequencing_model_abs_only.pdf |
Similar Items
-
A deadline-based algorithm for dynamic task scheduling with precedence constraints
by: Chuprat, Suriayati, et al.
Published: (2007) -
Managing software projects with team software process (TSP)
by: Hamid, S. S., et al.
Published: (2013) -
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
by: Bibi Aamirah Shafaa Emambocus, et al.
Published: (2021) -
Reactive max-min ant system with recursive local search and its application to TSP and QAP
by: Sagban, Rafid, et al.
Published: (2016) -
TCG algorithm approach for UML sequence diagram
by: Bahrin, N. K., et al.
Published: (2016)