Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A survey of job shop scheduling problem: The types and models
H **ong, S Shi, D Ren, J Hu - Computers & Operations Research, 2022 - Elsevier
Job shop scheduling problem (JSSP) is a thriving area of scheduling research, which has
been concerned and studied widely by scholars in engineering and academic fields. This …
been concerned and studied widely by scholars in engineering and academic fields. This …
A systematic review on fruit fly optimization algorithm and its applications
Abstract Fruit Fly Optimization Algorithm (FOA) is a metaheuristic algorithm inspired by fruit
fly foraging behaviours. A large numbers of variants of FOA have been proposed by many …
fly foraging behaviours. A large numbers of variants of FOA have been proposed by many …
Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey
Scheduling has an immense effect on various areas of human lives, be it though its
application in manufacturing and production industry, transportation, workforce allocation, or …
application in manufacturing and production industry, transportation, workforce allocation, or …
[HTML][HTML] A clustering routing algorithm based on improved ant colony optimization algorithms for underwater wireless sensor networks
X **ao, H Huang - Algorithms, 2020 - mdpi.com
Because of the complicated underwater environment, the efficiency of data transmission
from underwater sensor nodes to a sink node (SN) is faced with great challenges. Aiming at …
from underwater sensor nodes to a sink node (SN) is faced with great challenges. Aiming at …
Fixed set search applied to the clique partitioning problem
Abstract The Clique Partitioning Problem (CPP) seeks to decompose a set of vertices into
disjoint subsets (cliques) maximizing the sum of edge weights over all the cliques. The …
disjoint subsets (cliques) maximizing the sum of edge weights over all the cliques. The …
Hybrid meta-heuristics for the unrelated parallel machine scheduling problem with setup times
This study focuses on an unrelated parallel machine scheduling problem with machine and
job sequence-dependent setup times (UPMST) aiming to minimise the makespan. Recently …
job sequence-dependent setup times (UPMST) aiming to minimise the makespan. Recently …
Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times
This paper addresses the problem of minimizing the makespan on unrelated parallel
machines with sequence-dependent setup times. The term unrelated machines is used in …
machines with sequence-dependent setup times. The term unrelated machines is used in …
An efficient load balancing technique for task scheduling in heterogeneous cloud environment
Cloud computing will continue to play a critical role due to its ability to deliver various types
of on-demand information technology (IT) services according to customer needs …
of on-demand information technology (IT) services according to customer needs …
Integrated maintenance and production scheduling for unrelated parallel machines with setup times
This paper considers jointly scheduling the production and resource-constrained
maintenance activities in a manufacturing setting with unrelated parallel machines. In …
maintenance activities in a manufacturing setting with unrelated parallel machines. In …
[HTML][HTML] Exploring the evolution of machine scheduling through a computational approach
Since 2000, the field of machine scheduling—an integral part of computer science and
operations research—has seen significant advancements. This paper explores the dynamic …
operations research—has seen significant advancements. This paper explores the dynamic …