A multi-objective multi-micro-swarm leadership hierarchy-based optimizer for uncertain flexible job shop scheduling problem with job precedence constraints

Zhu, Zhenwei; Zhou, Xionghui

doi:10.1016/j.eswa.2021.115214

Cited by 17 publications

(6 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Li et al [9] mixed the genetic algorithm and taboo search algorithm to resolve the FJSSP problem. Zhenwei et al [10] studied the uncertain FJSSP with job priority requirements. Changxing et al [11] constructed an FJSSP model with maximum completion time and machine load as optimization objectives, and a mixed elite retention mechanism and summation search algorithm.…”

Section: Introductionmentioning

confidence: 99%

Application of Improved Sparrow Search Algorithm to Flexible Job Shop Scheduling Problem

Long-Yan Xu

2024

jes

View full text Add to dashboard Cite

When the reality of energy saving and reduction of enterprises’ emissions are a concern, research on the investigation of establishing mathematical models to optimize the production time has been studied. In this article, an enhanced sparrow optimization method is proposed. First, two-layer coding is employed for workpieces and machines according to the model requirements. Secondly, the three-dimensional chaotic mapping scheme is presented to improve the population heterogeneity of the algorithm, and the adaptive inertia weight balance algorithm is implemented to offset the speed of the convergence and its probability. Finally, the Cauchy mutation scheme is adopted to help the algorithm jump out of the local optimum. Simulated data is run to check the superiority of the proposed method. So, through the simulations and comparisons of 10 kinds of test datasets, the outcomes suggest that the solution quality of the enhanced sparrow optimization method has been effectively advanced, and its good global optimization ability is shown, which can provide scheduling strategies for workshop productions. One of the successes of the ISSA algorithm is its superior search accuracy.

show abstract

Section: Introductionmentioning

confidence: 99%

Application of Improved Sparrow Search Algorithm to Flexible Job Shop Scheduling Problem

Long-Yan Xu

2024

jes

View full text Add to dashboard Cite

show abstract

“…Chen et al used the interval grey number to represent the processing time of jobs (Xie and Chen, 2018) and constructed grey programming models to solve the scheduling problem of flexible job shop (Chen et al, 2022) and flexible flow shop (Wang and Xie, 2021) in an uncertain environment. Zhu and Zhou concentrated on the flexible job shop scheduling problem with job precedence constraints and interval grey processing time (G-FJSP-JPC) under the objective of minimizing the interval grey makespan (Zhu and Zhou, 2020); meanwhile, they devised specific operators for dealing with interval grey time numbers to acquire precise grey schedules and proposed a novel multi-micro-swarm leadership hierarchy-based optimization algorithm (M2SLHO) tackle G-FJSP-JPC (Zhu and Zhou, 2021).…”

Section: Introductionmentioning

confidence: 99%

Single machine scheduling with interval grey processing time

Xie

Wang

2023

View full text Add to dashboard Cite

PurposeThis paper aims to investigate the grey scheduling, which is the combination of grey system theory and scheduling problems with uncertain processing time. Based on the interval grey number and its related definitions, properties, and theorems, the single machine scheduling with uncertain processing time and its general forms are studied as the research object. Then several single machine scheduling models are reconstructed, and an actual production case is developed to illustrate the rationality of the research.Design/methodology/approachIn this paper, the authors first summarize the definitions and properties related to interval grey numbers, especially the transitivity of the partial order of interval grey numbers, and give an example to illustrate that the transitivity has a positive effect on the computational time complexity of multiple interval grey number comparisons. Second, the authors redefine the general form of the single machine scheduling problem with uncertain processing time according to the definitions and theorems of interval grey numbers. The authors then reconstruct three single machine scheduling models with uncertain processing time, give the corresponding heuristic algorithms based on the interval grey numbers and prove them. Finally, the authors develop a case study based on the engine test shop of K Company, the results show that the proposed single machine scheduling models and algorithms with uncertain processing time can provide effective guidance for actual production in an uncertain environment.FindingsThe main findings of this paper are as follows: (1) summarize the definitions and theorems related to interval grey numbers and prove the transitivity of the partial order of interval grey numbers; (2) define the general form of the single machine scheduling problem with interval grey processing time; (3) reconstruct three single machine scheduling models with uncertain processing time and give the corresponding heuristic algorithms; (4) develop a case study to illustrate the rationality of the research.Research limitations/implicationsIn the further research, the authors will continue to summarize more advanced general forms of grey scheduling, improve the theory of grey scheduling and prove it, and further explore the application of grey scheduling in the real world. In general, grey scheduling needs to be further combined with grey system theory to form a complete theoretical system.Originality/valueIt is a fundamental work to define the general form of single machine scheduling with uncertain processing time used the interval grey number. However, it can be seen as an important theoretical basis for the grey scheduling, and it is also beneficial to expand the application of grey system theory in real world.

show abstract

“…To deal with the uncertain processing time, interval grey number processing time is an emerging method (Li and Li, 2023; Liz, 2022)which has attracted the attention of some scholars in recent years due to its simple form and special significance (Wang and Xie, 2021; Zhu and Zhou, 2020, 2021). Based on the Grey System Theory (Deng, 1982), the uncertain processing time is expressed as interval grey numbers.…”

Section: Introductionmentioning

confidence: 99%

Assembly line balancing and capacity evaluation based on interval grey processing time

Dang,

Xie

2023

View full text Add to dashboard Cite

PurposeAssembly line is a common production form and has been effectively used in many industries, but the imprecise processing time of each process makes production line balancing and capacity forecasting the most troublesome problems for production managers. In this paper, uncertain man-hours are represented as interval grey numbers, and the optimization problem of production line balance in the case of interval grey man-hours is studied to better evaluate the production line capacity.Design/methodology/approachFirst, this paper constructs the basic model of assembly line balance optimization for the single-product scenario, and on this basis constructs an assembly line balance optimization model under the multi-product scenario with the objective function of maximizing the weighted greyscale production line balance rate, second, this paper designs a simulated annealing algorithm to solve problem. A neighborhood search strategy is proposed, based on assembly line balance optimization, an assembly line capacity evaluation method with interval grey man-hour characteristics is designed.FindingsThis paper provides a production line balance optimization scheme with uncertain processing time for multi-product scenarios and designs a capacity evaluation method to provide managers with scientific management strategies so that decision-makers can scientifically solve the problems that the company's design production line is quite different from the actual production situation.Originality/valueThere are few literary studies on combining interval grey number with assembly line balance optimization. Therefore, this paper makes an important contribution in this regard.

show abstract

A multi-objective multi-micro-swarm leadership hierarchy-based optimizer for uncertain flexible job shop scheduling problem with job precedence constraints

Cited by 17 publications

References 47 publications

Application of Improved Sparrow Search Algorithm to Flexible Job Shop Scheduling Problem

Application of Improved Sparrow Search Algorithm to Flexible Job Shop Scheduling Problem

Single machine scheduling with interval grey processing time

Assembly line balancing and capacity evaluation based on interval grey processing time

Contact Info

Product

Resources

About