An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem

@inproceedings{Pan2010AnES,
  title={An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem},
  author={Quan-Ke Pan and Ling Wang and Liang Gao and Junqing Li},
  year={2010}
}
This paper presents an effective shuffled frogleaping algorithm (SFLA) for solving a lot-streaming flow shop scheduling problem with equal-size sublots, where a criterion is to minimize maximum completion time (i.e., makespan) under both an idling and no-idling production cases. Unlike the original SFLA, the proposed SFLA represents an individual or frog as a job permutation and utilizes a position-based crossover operator to generate new candidate solutions. An efficient initialization scheme… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS