Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
An improved artificial bee colony algorithm with Q-learning for solving permutation flow-shop scheduling problems
H Li, K Gao, PY Duan, JQ Li… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
A permutation flow-shop scheduling problem (PFSP) has been studied for a long time due to
its significance in real-life applications. This work proposes an improved artificial bee colony …
its significance in real-life applications. This work proposes an improved artificial bee colony …
A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem
This article is a comprehensive review of Branch-and-Bound algorithms for solving flowshop
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …
scheduling problems, from the early works of Ignall and Schrage (1965) and Brown and …
[KÖNYV][B] Scheduling
ML Pinedo - 2012 - Springer
Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
Adaptive genetic algorithm for two-stage hybrid flow-shop scheduling with sequence-independent setup time and no-interruption requirement
It is a trend for a production system to produce multiple product types with small batches.
Thus, there are frequent switches between batches. Due to the different product types in …
Thus, there are frequent switches between batches. Due to the different product types in …
An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
V T'kindt, N Monmarché, F Tercinet, D Laügt - European Journal of …, 2002 - Elsevier
Consider the 2-machine flowshop scheduling problem with the objective of minimizing both
the total completion time and the makespan criteria. The latter is assumed to be optimized …
the total completion time and the makespan criteria. The latter is assumed to be optimized …
An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure
The permutation flow shop problem (PFSSP) is an NP-hard problem of wide engineering
and theoretical background. In this paper, a differential evolution (DE) based memetic …
and theoretical background. In this paper, a differential evolution (DE) based memetic …
A hybrid cuckoo search via Lévy flights for the permutation flow shop scheduling problem
The permutation flow shop problem (PFSSP) is an NP-hard problem of wide engineering
and theoretical background. In this paper, a cuckoo search (CS)-based memetic algorithm …
and theoretical background. In this paper, a cuckoo search (CS)-based memetic algorithm …
A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems
Cuckoo search (CS) is a recently developed meta-heuristic algorithm, which has shown
good performance on many continuous optimization problems. In this paper, we present a …
good performance on many continuous optimization problems. In this paper, we present a …
Minimizing total completion time in a two-machine flowshop with a learning effect
WC Lee, CC Wu - International Journal of Production Economics, 2004 - Elsevier
In many situations, a worker's ability improves as a result of repeating the same or similar
tasks; this phenomenon is known as the “learning effect”. In this paper, the learning effect is …
tasks; this phenomenon is known as the “learning effect”. In this paper, the learning effect is …
Minimizing flowtime in a flowshop scheduling problem with a biased random-key genetic algorithm
In this paper, we advance the state of the art for solving the Permutation Flowshop
Scheduling Problem with total flowtime minimization. For this purpose, we propose a Biased …
Scheduling Problem with total flowtime minimization. For this purpose, we propose a Biased …