Journal of Intelligent Manufacturing

, Volume 22, Issue 3, pp 379–388 | Cite as

Genetic algorithm approach for precedence-constrained sequencing problems

  • YoungSu Yun
  • Chiung Moon


In this paper we propose a genetic algorithm (GA) approach based on a topological sort (TS)-based representation procedure for effectively solving precedence-constrained sequencing problems (PCSPs). The TS-based representation procedure used in the proposed GA approach can generate feasible sequences in PCSPs. By applying the proposed GA approach, the sequence determination problems with precedence constraints can be easily solved. Experimental results show that the proposed GA approach is a good alternative in locating optimal sequence for various types of PCSPs.


Genetic algorithm Precedence-constrained sequencing problems Mixed integer programming Topological sort 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Baker K. (1974) Introduction to sequencing and scheduling. Wiley, LondonGoogle Scholar
  2. Chen, C. (1990). AND/OR precedence constraint traveling salesman problem and its application to assembly schedule generation. Proceedings of 1990 IEEE International Conference on Systems, Man and Cybernetics (pp. 560–562).Google Scholar
  3. Duman E., Or I. (2004) Precedence constrained TSP arising printed circuit board assembly. International Journal of Production Research 42(1): 67–78CrossRefGoogle Scholar
  4. Gen M., Cheng R. (1997) Genetic algorithms and engineering design. Wiley, LondonGoogle Scholar
  5. Gen M., Cheng R. (2000) Genetic algorithms and engineering optimization. Wiley, LondonGoogle Scholar
  6. Gen M., Altiparmak F., Lin L. (2006) A genetic algorithm for two-stage transportation problem using priority-based encoding. OR Spectrum 28: 337–354CrossRefGoogle Scholar
  7. He W., Kusiak A (1992) Scheduling manufacturing systems. Computers in Industry 20: 163–175CrossRefGoogle Scholar
  8. Lambert A. J. D. (2006) Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs. Omega 34: 538–549CrossRefGoogle Scholar
  9. Moon C., Kim J., Choi G., Seo Y. (2002) An efficient genetic algorithm for the traveling salesman problem with precedence constraints. European Journal of Operational Research 140(3): 606–617CrossRefGoogle Scholar
  10. Moon C., Seo Y. (2005) Advanced planning for minimizing makespan with load balancing in multi-plants chain. International Journal of Production Research 43(20): 4381–4396CrossRefGoogle Scholar
  11. Pinedo M., Chao X. (1999) Operations scheduling. McGraw-Hill, New YorkGoogle Scholar
  12. Renaud J., Boctor F. F., Ouenniche J. (2000) A heuristic for the pickup and delivery traveling salesman problem. Computers & Operations Research 27: 905–916CrossRefGoogle Scholar
  13. Savelsbergh M., Sol M. (1995) The general pickup and delivery problem. Transportation Science 29: 17–29CrossRefGoogle Scholar
  14. Su Q. (2007) Applying case-based reasoning in assembly sequence planning. International Journal of Production Research 45(1): 29–47CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Division of Business AdministrationChosun UniversityDong-guRepublic of Korea
  2. 2.Gueulri Institute of Technology, 410, Business Incubator CenterHanyang UniversityAnsanKorea

Personalised recommendations