An improved genetic algorithm for task scheduling in the cloud environments using the priority queues: formal verification, simulation, and statistical testing
Cloud computing is a new platform to manage and provide services on the internet. Lately,
researchers have paid attention a lot to this new subject. One of the reasons to have high …
researchers have paid attention a lot to this new subject. One of the reasons to have high …
Dynamic energy-efficient scheduling of multi-variety and small batch flexible job-shop: A case study for the aerospace industry
Z Tian, X Jiang, W Liu, Z Li - Computers & Industrial Engineering, 2023 - Elsevier
In the context of the global implementation of carbon peaking and carbon neutrality, energy-
aware production scheduling has attracted world-wide attention. The optimal scheduling …
aware production scheduling has attracted world-wide attention. The optimal scheduling …
Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems
X Li, Z Peng, B Du, J Guo, W Xu, K Zhuang - Computers & Industrial …, 2017 - Elsevier
This study mainly focuses on flexible job shop scheduling problems (FJSSPs) in a modern
manufacturing enterprise that presents a number of different emergencies, such as new jobs …
manufacturing enterprise that presents a number of different emergencies, such as new jobs …
Graph-based modeling in shop scheduling problems: Review and extensions
Graphs are powerful tools to model manufacturing systems and scheduling problems. The
complexity of these systems and their scheduling problems has been substantially …
complexity of these systems and their scheduling problems has been substantially …
An efficient Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with total flowtime minimization
I Ribas, R Companys, X Tort-Martorell - Expert Systems with Applications, 2015 - Elsevier
This paper presents a high performing Discrete Artificial Bee Colony algorithm for the
blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we …
blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we …
Solving the flexible job shop scheduling problem with makespan optimization by using a hybrid Taguchi-genetic algorithm
Enterprises exist in a competitive manufacturing environment. To reduce production costs
and effectively use production capacity to improve competitiveness, a hybrid production …
and effectively use production capacity to improve competitiveness, a hybrid production …
Priority-based task scheduling in the cloud systems using a memetic algorithm
B Keshanchi, NJ Navimipour - Journal of Circuits, Systems and …, 2016 - World Scientific
Task scheduling is one of the major issues to achieve high performance in distributed
systems such as Grid, Peer-to-Peer and cloud environment. Generally, there are two phases …
systems such as Grid, Peer-to-Peer and cloud environment. Generally, there are two phases …
A Hybrid Discrete Bat Algorithm with Krill Herd-based advanced planning and scheduling tool for the capital goods industry
S Chansombat, P Musikapun… - … Journal of Production …, 2019 - Taylor & Francis
Capital goods companies produce high value products such as power plant or ships, which
have deep and complex product structures, with components having long process routings …
have deep and complex product structures, with components having long process routings …
A novel constraint programming decomposition approach for the total flow time fixed group shop scheduling problem
This work addresses a particular case of the group shop scheduling problem (GSSP) which
will be denoted as the fixed group shop scheduling problem (FGSSP). In a FGSSP, job …
will be denoted as the fixed group shop scheduling problem (FGSSP). In a FGSSP, job …
A discrete artificial bee colony algorithm for single machine scheduling problems
A Yurtkuran, E Emel - International Journal of Production Research, 2016 - Taylor & Francis
This paper presents a discrete artificial bee colony algorithm for a single machine earliness–
tardiness scheduling problem. The objective of single machine earliness–tardiness …
tardiness scheduling problem. The objective of single machine earliness–tardiness …