Journal of Northeastern University(Natural Science)

Journal of Northeastern University ›› 2003, Vol. 24 ›› Issue (4): 338-341.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Applying probability learning based evolutionary algorithm to parallel flow lines scheduling problem

Pang, Ha-Li (1); Wan, Shan-Shan (1)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China
  • Received:2013-06-23 Revised:2013-06-23 Online:2003-04-15 Published:2013-06-23
  • Contact: Pang, H.-L.
  • About author:-
  • Supported by:
    -

RichHTML

1

PDF (PC)

1258

Abstract: Parallel flow-lines scheduling is a new kind of scheduling. The parallel scheduling has the characters of the parallel machines and the flow shop scheduling. A general parallel flow lines problem with the objective of minimizing makespan was considered, and a mixed integer programming model is given. In view of the intractable nature of the problem, a probability learning based evolutionary algorithm was proposed to solve the problem. The algorithm was tested on some randomly generated problems.

CLC Number: