Flexible job-shop scheduling method based on interval grey processing time

Xú, Wénxìng; Wu, Wentong; Wang, Yao; He, Yunliang; Lei, Zhimei

doi:10.1007/s10489-022-04213-9

Cited by 3 publications

(1 citation statement)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Currently, the research for FJSP is mainly in considering novel conditions such as uncertainties and green low-carbon requirements and constructing novel solution algorithms such as multiobjective intelligent optimization and deep learning. For example, Xu et al [21] proposed a load-balancing-based step-size adaptive discrete particle swarm algorithm (LS-DPSO) to solve the G-FSP model. Wang et al [22] considered the maximum completion time, total delay time, and total energy consumption of the job and used the hybrid adaptive differential evolution algorithm (HADE) to solve it.…”

Section: Introductionmentioning

confidence: 99%

Modeling and IAHA Solution for Task Scheduling Problem of Processing Crowdsourcing in the Context of Social Manufacturing

Zhu

Liu

2023

Systems

View full text Add to dashboard Cite

The paper addresses the discrete characteristics of the processing crowdsourcing task scheduling problem in the context of social manufacturing, divides it into two subproblems of social manufacturing unit selecting and subtask sorting, establishes its mixed-integer programming with the objective of minimizing the maximum completion time, and proposes an improved artificial hummingbird algorithm (IAHA) for solving it. The IAHA uses initialization rules of global selection, local selection, and random selection to improve the quality of the initial population, the Levy flight to improve guided foraging and territorial foraging, the simplex search strategy to improve migration foraging to enhance the merit-seeking ability, and the greedy decoding method to improve the quality of the solution and reduce solution time. For the IAHA, orthogonal tests are designed to obtain the optimal combination of parameters, and comparative tests are made with variants of the AHA and other algorithms on the benchmark case and a simulated crowdsourcing case. The experimental results show that the IAHA can obtain superior solutions in many cases with economy and effectiveness.

show abstract

Section: Introductionmentioning

confidence: 99%

Modeling and IAHA Solution for Task Scheduling Problem of Processing Crowdsourcing in the Context of Social Manufacturing

Zhu

Liu

2023

Systems

View full text Add to dashboard Cite

show abstract

Two-level balancing multi-objective algorithm for trapezoidal type-2 fuzzy flexible job shop problems

Li,

Gao

et al. 2024

Information Sciences

View full text Add to dashboard Cite

Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times

Allahverdi¹

2023

RAIRO-Oper. Res.

View full text Add to dashboard Cite

The two-machine flowshop scheduling problem with the performance measure of total tardiness is addressed. This performance measure is essential since meeting deadlines is a crucial part of scheduling and a major concern for some manufacturing systems. The processing times on both machines are uncertain variables and within some lower and upper bounds. This is due to uncertainty being an integral part of some manufacturing settings, making it impossible to predict processing times in advance. To the best of the author’s knowledge, this problem is addressed for the first time in this paper. A dominance relation is established and nineteen algorithms, which incorporate the established dominance relation, are presented. These algorithms are extensively evaluated through randomly generated data for different numbers of jobs and four different distributions, representing both symmetric and non-symmetric distributions. Computational experiments show that the presented algorithms perform extremely well when compared with a random solution. In particular, the best of the considered 19 algorithms reduces the error of the random solution by 99.99% and the error of the worst algorithm (among the 19 algorithms) by 99.96%. The results are confirmed by a test of hypothesis and this algorithm is recommended.

show abstract

Flexible job-shop scheduling method based on interval grey processing time

Cited by 3 publications

References 40 publications

Modeling and IAHA Solution for Task Scheduling Problem of Processing Crowdsourcing in the Context of Social Manufacturing

Modeling and IAHA Solution for Task Scheduling Problem of Processing Crowdsourcing in the Context of Social Manufacturing

Two-level balancing multi-objective algorithm for trapezoidal type-2 fuzzy flexible job shop problems

Minimizing total tardiness in a two-machine flowshop with uncertain and bounded processing times

Contact Info

Product

Resources

About