Next Article in Journal
Parallel Locally Strictly Convex Surfaces in Four-Dimensional Affine Space Contained in Hyperquadrics
Next Article in Special Issue
Collaborative Production Task Decomposition and Allocation among Multiple Manufacturing Enterprises in a Big Data Environment
Previous Article in Journal
Bifuzzy-Bilevel Programming Model: Solution and Application
Previous Article in Special Issue
Path Planning of AS/RS Based on Cost Matrix and Improved Greedy Algorithm
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
Symmetry
Volume 13
Issue 9
10.3390/sym13091574
symmetry-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time

by
Deming Lei
* and
Tian Yi
School of Automation, Wuhan University of Technology, Wuhan 430000, China
*
Author to whom correspondence should be addressed.
Symmetry 2021, 13(9), 1574; https://doi.org/10.3390/sym13091574
Submission received: 27 May 2021 / Revised: 12 July 2021 / Accepted: 12 July 2021 / Published: 26 August 2021
(This article belongs to the Special Issue Meta-Heuristics for Manufacturing Systems Optimization)
Browse Figures
Versions Notes

Abstract

Unrelated parallel machine scheduling problems (UPMSP) with various processing constraints have been considered fully; however, a UPMSP with deteriorating preventive maintenance (PM) and sequence-dependent setup time (SDST) is seldom considered. In this study, a new differentiated shuffled frog-leaping algorithm (DSFLA) is presented to solve the problem with makespan minimization. The whole search procedure consists of two phases. In the second phase, quality evaluation is done on each memeplex, then the differentiated search processes are implemented between good memeplexes and other ones, and a new population shuffling is proposed. We conducted a number of experiments. The computational results show that the main strategies of DSFLA were effective and reasonable and DSFLA was very competitive at solving UPMSP with deteriorating PM and SDST.
Keywords: shuffled frog-leaping algorithm; sequence-dependent setup time; preventive maintenance; parallel machines; scheduling shuffled frog-leaping algorithm; sequence-dependent setup time; preventive maintenance; parallel machines; scheduling

Share and Cite

MDPI and ACS Style

Lei, D.; Yi, T. A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time. Symmetry 2021, 13, 1574. https://doi.org/10.3390/sym13091574

AMA Style

Lei D, Yi T. A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time. Symmetry. 2021; 13(9):1574. https://doi.org/10.3390/sym13091574

Chicago/Turabian Style

Lei, Deming, and Tian Yi. 2021. "A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time" Symmetry 13, no. 9: 1574. https://doi.org/10.3390/sym13091574

APA Style

Lei, D., & Yi, T. (2021). A Novel Shuffled Frog-Leaping Algorithm for Unrelated Parallel Machine Scheduling with Deteriorating Maintenance and Setup Time. Symmetry, 13(9), 1574. https://doi.org/10.3390/sym13091574

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop