Genetic algorithm approach for precedence-constrained sequencing problems

@article{Yun2011GeneticAA,
  title={Genetic algorithm approach for precedence-constrained sequencing problems},
  author={YoungSu Yun and Chiung Moon},
  journal={J. Intelligent Manufacturing},
  year={2011},
  volume={22},
  pages={379-388}
}
In this paper we propose a genetic algorithm (GA) approach based on a topological sort (TS)-based representation procedure for effectively solving precedenceconstrained 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… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Applying case-based reasoning in assembly sequence planning

  • Q. Su
  • International Journal of Production Research,
  • 2007
Highly Influential
5 Excerpts

Introduction to sequencing and scheduling

  • K. Baker
  • 1974
Highly Influential
6 Excerpts

A genetic algorithm for twostage transportation problem using priority-based encoding

  • M. Gen, F. Altiparmak, L. Lin
  • OR Spectrum,
  • 2006
1 Excerpt

Exact methods in optimum disassembly sequence search for problems subject to sequence dependent

  • A.J.D. Lambert
  • costs. Omega,
  • 2006
1 Excerpt

Exact methods in optimum disassembly sequence search for problems subject to sequence dependent costs

  • C. Moon, J. Kim, G. Choi, Y. Seo
  • Omega
  • 2006

Advanced planning for minimizing makespan with load balancing in multi - plants chain

  • M. Pinedo, X. Chao
  • Interna - tional Journal of Production Research
  • 2005

Advanced planning for minimizing makespan with load balancing in multi-plants

  • C. Moon, Y. Seo
  • chain. International Journal of Production…
  • 2005
2 Excerpts

Similar Papers

Loading similar papers…