A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time

58Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Distributed hybrid flow shop scheduling problem (DHFSP) has attracted some attention; however, DHFSP with uncertainty and energy-related element is seldom studied. In this paper, distributed energy-efficient hybrid flow shop scheduling problem (DEHFSP) with fuzzy processing time is considered and a cooperated shuffled frog-leaping algorithm (CSFLA) is presented to optimize fuzzy makespan, total agreement index and fuzzy total energy consumption simultaneously. Iterated greedy, variable neighborhood search and global search are designed using problem-related features; memeplex evaluation based on three quality indices is presented, an effective cooperation process between the best memeplex and the worst memeplex is developed according to evaluation results and performed by exchanging search times and search ability, and an adaptive population shuffling is adopted to improve search efficiency. Extensive experiments are conducted and the computational results validate that CSFLA has promising advantages on solving the considered DEHFSP.

Cite

CITATION STYLE

APA

Cai, J., & Lei, D. (2021). A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time. Complex and Intelligent Systems, 7(5), 2235–2253. https://doi.org/10.1007/s40747-021-00400-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free