Nguyen Vu Anh Duy, Nguyen Le Thai, Nguyen Huu Tho^*

Intelligent Automation & Soft Computing, Vol.39, No.1, pp. 15-31, 2024, DOI:10.32604/iasc.2024.038272

Abstract In this paper, we consider a multi-crane scheduling problem in rail stations because their operations directly influence the throughput of the rail stations. In particular, the job is not only assigned to cranes but also the job sequencing is implemented for each crane to minimize the makespan of cranes. A dual cycle of cranes is used to minimize the number of working cycles of cranes. The rail crane scheduling problems in this study are based on the movement of containers. We consider not only the gantry moves, but also the trolley moves as well as the re-handle cases are also… More >

Zhaolin Lv¹, Yuexia Zhao², Hongyue Kang^3,*, Zhenyu Gao³, Yuhang Qin⁴

CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2337-2360, 2024, DOI:10.32604/cmc.2023.045826

Abstract Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize… More >

Sihan Wang, Xinyu Li, Qihao Liu^*

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1871-1890, 2023, DOI:10.32604/cmes.2023.028339

Abstract The job shop scheduling problem (JSSP) is a classical combinatorial optimization problem that exists widely in diverse scenarios of manufacturing systems. It is a well-known NP-hard problem, when the number of jobs increases, the difficulty of solving the problem exponentially increases. Therefore, a major challenge is to increase the solving efficiency of current algorithms. Modifying the neighborhood structure of the solutions can effectively improve the local search ability and efficiency. In this paper, a genetic Tabu search algorithm with neighborhood clipping (GTS_NC) is proposed for solving JSSP. A neighborhood solution clipping method is developed and embedded into Tabu search to… More >

Lei Yin¹, Chang Sun², Ming Gao³, Yadong Fang⁴, Ming Li¹, Fengyu Zhou^1,*

Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1587-1608, 2023, DOI:10.32604/iasc.2023.039380

Abstract The solution strategy of the heuristic algorithm is pre-set and has good performance in the conventional cloud resource scheduling process. However, for complex and dynamic cloud service scheduling tasks, due to the difference in service attributes, the solution efficiency of a single strategy is low for such problems. In this paper, we presents a hyper-heuristic algorithm based on reinforcement learning (HHRL) to optimize the completion time of the task sequence. Firstly, In the reward table setting stage of HHRL, we introduce population diversity and integrate maximum time to comprehensively determine the task scheduling and the selection of low-level heuristic strategies.… More >

Lenin Babu Russeliah^1,*, R. Adaline Suji², D. Bright Anand³

Computer Systems Science and Engineering, Vol.46, No.3, pp. 3925-3938, 2023, DOI:10.32604/csse.2023.034727

Abstract Cloud computing (CC) is developing as a powerful and flexible computational structure for providing ubiquitous service to users. It receives interrelated software and hardware resources in an integrated manner distinct from the classical computational environment. The variation of software and hardware resources were combined and composed as a resource pool. The software no more resided in the single hardware environment, it can be executed on the schedule of resource pools to optimize resource consumption. Optimizing energy consumption in CC environments is the question that allows utilizing several energy conservation approaches for effective resource allocation. This study introduces a Battle Royale… More >

Poonam^*, Suman Sangwan

CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 1783-1799, 2023, DOI:10.32604/cmc.2023.031729

Abstract This paper presents a novel fuzzy firefly-based intelligent algorithm for load balancing in mobile cloud computing while reducing makespan. The proposed technique implicitly acts intelligently by using inherent traits of fuzzy and firefly. It automatically adjusts its behavior or converges depending on the information gathered during the search process and objective function. It works for 3-tier architecture, including cloudlet and public cloud. As cloudlets have limited resources, fuzzy logic is used for cloudlet selection using capacity and waiting time as input. Fuzzy provides human-like decisions without using any mathematical model. Firefly is a powerful meta-heuristic optimization technique to balance diversification… More >

B. Chellapraba^1,*, D. Manohari², K. Periyakaruppan³, M. S. Kavitha⁴

Computer Systems Science and Engineering, Vol.45, No.1, pp. 483-495, 2023, DOI:10.32604/csse.2023.029854

Abstract Owing to massive technological developments in Internet of Things (IoT) and cloud environment, cloud computing (CC) offers a highly flexible heterogeneous resource pool over the network, and clients could exploit various resources on demand. Since IoT-enabled models are restricted to resources and require crisp response, minimum latency, and maximum bandwidth, which are outside the capabilities. CC was handled as a resource-rich solution to aforementioned challenge. As high delay reduces the performance of the IoT enabled cloud platform, efficient utilization of task scheduling (TS) reduces the energy usage of the cloud infrastructure and increases the income of service provider via minimizing… More >

Mohit Agarwal^1,*, Shikha Gupta²

CMC-Computers, Materials & Continua, Vol.73, No.3, pp. 6103-6119, 2022, DOI:10.32604/cmc.2022.030778

Abstract Task scheduling in highly elastic and dynamic processing environments such as cloud computing have become the most discussed problem among researchers. Task scheduling algorithms are responsible for the allocation of the tasks among the computing resources for their execution, and an inefficient task scheduling algorithm results in under-or over-utilization of the resources, which in turn leads to degradation of the services. Therefore, in the proposed work, load balancing is considered as an important criterion for task scheduling in a cloud computing environment as it can help in reducing the overhead in the critical decision-oriented process. In this paper, we propose… More >

J. Jean Justus¹, U. Sakthi², K. Priyadarshini³, B. Thiyaneswaran⁴, Masoud Alajmi⁵, Marwa Obayya⁶, Manar Ahmed Hamza^7,*

Computer Systems Science and Engineering, Vol.44, No.1, pp. 205-219, 2023, DOI:10.32604/csse.2023.025256

Abstract The developments of multi-core systems (MCS) have considerably improved the existing technologies in the field of computer architecture. The MCS comprises several processors that are heterogeneous for resource capacities, working environments, topologies, and so on. The existing multi-core technology unlocks additional research opportunities for energy minimization by the use of effective task scheduling. At the same time, the task scheduling process is yet to be explored in the multi-core systems. This paper presents a new hybrid genetic algorithm (GA) with a krill herd (KH) based energy-efficient scheduling technique for multi-core systems (GAKH-SMCS). The goal of the GAKH-SMCS technique is to… More >

K. Naveen Durai^*, R. Subha, Anandakumar Haldorai

Intelligent Automation & Soft Computing, Vol.34, No.1, pp. 467-483, 2022, DOI:10.32604/iasc.2022.026020

Abstract In cloud computing, the processes of load balancing and task scheduling are major concerns as they are the primary mechanisms responsible for executing tasks by allocating and utilizing the resources of Virtual Machines (VMs) in a more optimal way. This problem of balancing loads and scheduling tasks in the cloud computing scenario can be categorized as an NP-hard problem. This problem of load balancing needs to be efficiently allocated tasks to VMs and sustain the trade-off among the complete set of VMs. It also needs to maintain equilibrium among VMs with the objective of maximizing throughput with a minimized time… More >