Multi-Objective Memetic Search Algorithm for Multi-Objective Permutation Flow Shop Scheduling Problem

@article{Li2016MultiObjectiveMS,
  title={Multi-Objective Memetic Search Algorithm for Multi-Objective Permutation Flow Shop Scheduling Problem},
  author={Xiangtao Li and Shijing Ma},
  journal={IEEE Access},
  year={2016},
  volume={4},
  pages={2154-2165}
}
The multiobjective permutation flowshop scheduling problem (MOPFSSP) is one of the most popular machine scheduling problems with extensive engineering relevance of manufacturing systems. There have been many attempts at solving MOPFSSP using heuristic and meta-heuristic methods, such as evolutionary algorithm. In this paper, a novel multiobjective memetic search algorithm (MMSA), is proposed to solve the MOPFSSP with makespan and total flowtime. First, a problem-specific Nawaz-Enscore-Hoam… CONTINUE READING
3 Citations
51 References
Similar Papers

References

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

A particle swarm optimization for multiobjective flowshop scheduling

  • D. Y. Sha, H. H. Lin
  • Int. J. Adv. Manuf. Technol., vol. 45, nos. 7–8…
  • 2009
Highly Influential
3 Excerpts

A Pareto block-based estimation and distribution algorithm for multi-objective permutation flow shop scheduling problem

  • A. Tiwari, P.-C. Chang, M. K. Tiwari, N. J. Kollanoor
  • Int. J. Prod. Res., vol. 53, no. 3, pp. 793–834…
  • 2015
1 Excerpt

Similar Papers

Loading similar papers…