Modified Harmony Search Algorithm for Resource-Constrained Parallel Machine Scheduling Problem with Release Dates and Sequence-Dependent Setup Times

Al-Harkan, Ibrahim M.; Qamhan, Ammar A.; Badwelan, Ahmed; Al-Samhan, Ali M.; Hidri, Lotfi

doi:10.3390/pr9040654

Cited by 7 publications

(6 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors apply a population based SA, which uses VND as the LS operator. The problem of makespan minimisation subject to release times, setup times, and renewable resources is examined in [258]. The authors propose the application of a modified HS.…”

Section: B Metaheuristicsmentioning

confidence: 99%

Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey

Đurasević,

Jakobović

2021

Preprint

View full text Add to dashboard Cite

Today scheduling problems have an immense effect on various areas of human lives, be it from their application in manufacturing and production industry, transportation, or workforce allocation. The unrelated parallel machines scheduling problem (UPMSP), which is only one of the many different problem types that exist, found its application in many areas like production industries or distributed computing. Due to the complexity of the problem, heuristic and metaheuristic methods are gaining more attention for solving it. Although this problem variant did not receive much attention as other models, recent years saw the increase of research dealing with this problem. During that time, many different problem variants, solution methods, or other interesting research directions were considered. However, no study has until now tried to systematise the research in which heuristic methods are applied for the UPMSP. The goal of this study is to provide an extensive literature review on the application of heuristic and metaheuristic methods for solving the UPMSP. The research was systematised and classified into several categories to enable an easy overview of the different problem and solution variants. Additionally, current trends and possible future research directions are also shortly outlined.

show abstract

Section: B Metaheuristicsmentioning

confidence: 99%

Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey

Đurasević,

Jakobović

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Additional resources include automated guided vehicles, machine operators, tools, pallets, dies and industrial robots, and the total number of the used additional resources on each machine cannot exceed a given threshold at any time. Unrelated parallel machine scheduling problem with additional resources (UPMSPR) has become a significant area of scheduling research, and many results have been obtained [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16].…”

Section: Introductionmentioning

confidence: 99%

“…Vallada et al [8] applied an enriched scatter search and an enriched iterated greedy. The second is UPMSPR with multiple additional resources [9][10][11][12][13][14][15][16].…”

Section: Introductionmentioning

confidence: 99%

“…Al-Harkan and Qamhan [12] developed a two-stage hybrid meta-heuristic for solving UPMSPR with non-zero arbitrary release dates and sequence-dependent setup times (SDST). UPMSPR with more than two conditions and constraints have also been studied [13][14][15][16], including processing resources, setup resources and shared resources [13], setup times and additional limited resources in setup [14], SDST, precedence relation, machine eligibility and release dates [15] and release dates, SDST [16]. These problems are handled by using a threephase algorithm [13], heuristics and GRASP algorithm [14] and a modified harmony search algorithm [16].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Artificial Bee Colony with Adaptive Competition for the Unrelated Parallel Machine Scheduling Problem with Additional Resources and Maintenance

Xiong

Lei

2022

Symmetry

View full text Add to dashboard Cite

The unrelated parallel machine scheduling problem (UPMSP) is a typical production scheduling problem with certain symmetries on machines. Additional resources and preventive maintenance (PM) extensively exist on parallel machines; however, UPMSP with additional resources and PM has been scarcely investigated. Adaptive competition is also seldom implemented in the artificial bee colony algorithm for production scheduling. In this study, UPMSP with additional resources and PM is investigated, which has certain symmetries with machines. An artificial bee colony with adaptive competition (ABC-AC) is proposed to minimize the makespan. Two employed bee swarms are constructed and evaluated. In the employed bee phase, adaptive competition is used to dynamically decide two cases. The first is the shifting of search resources from the employed bee swarm with a lower evolution quality to another one, and the second is the migration of solutions from the employed bee swarm with a higher evolution quality to another one. An adaptive onlooker bee phase and a new scout phase are given. Extensive experiments are conducted on 300 instances. The computational results demonstrate that the new strategies of ABC-AC are effective, and ABC-AC provides promising results for the considered UPMSP.

show abstract

“…It is a method that mimics the way a musician improvises, improves, and finds the perfect state of harmony, also known as the objective function. In [49][50][51][52], the harmony search algorithm showed an extremely high performance for solving the problems of the search space compared to other evolutionary algorithms.…”

Section: Introductionmentioning

confidence: 99%

Multi-Objective Design of Profit Volumes and Closeness Ratings Using MBHS Optimizing Based on the PrefixSpan Mining Approach (PSMA) for Product Layout in Supermarkets

Kaewyotha

Songpan

2021

Applied Sciences

View full text Add to dashboard Cite

Product layout significantly impacts consumer demand for purchases in supermarkets. Product shelf renovation is a crucial process that can increase supermarket efficiency. The development of a sequential pattern mining algorithm for investigating the correlation patterns of product layouts, solving the numerous problems of shelf design, and the development of an algorithm that considers in-store purchase and shelf profit data with the goal of improving supermarket efficiency, and consequently profitability, were the goals of this research. The authors of this research developed two types of algorithms to enhance efficiency and reach the goals. The first was a PrefixSpan algorithm, which was used to optimize sequential pattern mining, known as the PrefixSpan mining approach. The second was a new multi-objective design that considered the objective functions of profit volumes and closeness rating using the mutation-based harmony search (MBHS) optimization algorithm, which was used to evaluate the performance of the first algorithm based on the PrefixSpan algorithm. The experimental results demonstrated that the PrefixSpan algorithm can determine correlation rules more efficiently and accurately ascertain correlation rules better than any other algorithms used in the study. Additionally, the authors found that MBHS with a new multi-objective design can effectively find the product layout in supermarket solutions. Finally, the proposed product layout algorithm was found to lead to higher profit volumes and closeness ratings than traditional shelf layouts, as well as to be more efficient than other algorithms.

show abstract

Modified Harmony Search Algorithm for Resource-Constrained Parallel Machine Scheduling Problem with Release Dates and Sequence-Dependent Setup Times

Cited by 7 publications

References 41 publications

Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey

Heuristic and Metaheuristic Methods for the Unrelated Machines Scheduling Problem: A Survey

An Artificial Bee Colony with Adaptive Competition for the Unrelated Parallel Machine Scheduling Problem with Additional Resources and Maintenance

Multi-Objective Design of Profit Volumes and Closeness Ratings Using MBHS Optimizing Based on the PrefixSpan Mining Approach (PSMA) for Product Layout in Supermarkets

Contact Info

Product

Resources

About