R. Chithra Devi^1,*, D. Jemi Florinabel², Narayanan Prasanth³

CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 1527-1540, 2022, DOI:10.32604/cmc.2022.019343

Abstract The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications. These switching fabrics are efficiently driven by the deployed scheduling algorithms. In this paper, we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures. At first, we proposed a Simple 2-Bit (S2B) scheme which uses binary ranking procedure and queue size for scheduling the packets. Here, the Virtual Output Queue (VOQ) set with maximum number of empty queues receives higher rank than other VOQ’s. Through simulation, we showed S2B has better throughput performance than Highest Ranking First… More >

Mohamed Abdel-Basset¹, Asmaa Atef¹, Mohamed Abouhawwash^2,3, Yunyoung Nam^4,*, Nabil M. AbdelAziz¹

CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 1281-1296, 2022, DOI:10.32604/cmc.2022.018947

Abstract The critical path method is one of the oldest and most important techniques used for planning and scheduling projects. The main objective of project management science is to determine the critical path through a network representation of projects. The critical path through a network can be determined by many algorithms and is useful for managing, monitoring, and controlling the time and cost of an entire project. The essential problem in this case is that activity durations are uncertain; time presents considerable uncertainty because the time of an activity is not always easily or accurately estimated. This issue increases the need… More >

Mohamed Abdel-Basset¹, Ahmed Sleem¹, Asmaa Atef¹, Yunyoung Nam^2,*, Mohamed Abouhawwash^3,4

CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 847-874, 2022, DOI:10.32604/cmc.2022.017106

Abstract Project scheduling is a key objective of many models and is the proposed method for project planning and management. Project scheduling problems depend on precedence relationships and resource constraints, in addition to some other limitations for achieving a subset of goals. Project scheduling problems are dependent on many limitations, including limitations of precedence relationships, resource constraints, and some other limitations for achieving a subset of goals. Deterministic project scheduling models consider all information about the scheduling problem such as activity durations and precedence relationships information resources available and required, which are known and stable during the implementation process. The concept… More >

Raham Hashim Yosuf¹, Rania A. Mokhtar², Rashid A. Saeed^2,*, Hesham Alhumyani², S. Abdel-Khalek³

Intelligent Automation & Soft Computing, Vol.31, No.1, pp. 581-590, 2022, DOI:10.32604/iasc.2022.019928

Abstract The grid computing is one of the strong initiatives and technologies that has been introduced in the last decade for improve the resources utilization, optimization and provide very high throughput computation for wide range of applications. To attain these goals an effective scheduling for grid systems is a vital issue to realize the intended performance. The processes scheduling could be executed in various methods and protocols that have been extensively address in the literature. This works utilized shortest process first (SPF) protocol which gives the shortest jobs the highest priorities. For longer jobs, it should have lower priorities and wait… More >

K. Gayathri Devi^*, R. S. Mishra, A. K. Madan

Intelligent Automation & Soft Computing, Vol.31, No.1, pp. 429-448, 2022, DOI:10.32604/iasc.2022.019330

Abstract An NP-hard problem like Flexible Job Shop Scheduling (FJSP) tends to be more complex and requires more computational effort to optimize the objectives with contradictory measures. This paper aims to address the FJSP problem with combined and contradictory objectives, like minimization of make-span, maximum workload, and total workload. This paper proposes ‘Hybrid Adaptive Firefly Algorithm’ (HAdFA), a new enhanced version of the classic Firefly Algorithm (FA) embedded with adaptive parameters to optimize the multi objectives concurrently. The proposed algorithm has adopted two adaptive strategies, i.e., an adaptive randomization parameter (α) and an effective heterogeneous update rule for fireflies. The adaptations… More >

Chia-Nan Wang¹, Hsien-Pin Hsu², Hsin-Pin Fu^3,*, Nguyen Ky Phuc Phan⁴, Van Thanh Nguyen⁵

Computer Systems Science and Engineering, Vol.40, No.1, pp. 17-36, 2022, DOI:10.32604/csse.2022.016992

Abstract In the competitive global marketplace, production scheduling plays a vital role in planning in manufacturing. Scheduling deals directly with the time to output products quickly and with a low production cost. This research examines case study of a Radio-Frequency Identification labeling department at Avery Dennison. The main objective of the company is to have a method that allows for the sequencing and scheduling of a set of jobs so it can be completed on or before the customer’s due date to minimize the number of late orders. This study analyzes the flexible flow shop scheduling problem with a sequence dependent… More >

Ahmed Y. Hamed^1,*, Monagi H. Alkinani²

CMC-Computers, Materials & Continua, Vol.69, No.3, pp. 3289-3301, 2021, DOI:10.32604/cmc.2021.018658

Abstract Task scheduling is the main problem in cloud computing that reduces system performance; it is an important way to arrange user needs and perform multiple goals. Cloud computing is the most popular technology nowadays and has many research potential in various areas like resource allocation, task scheduling, security, privacy, etc. To improve system performance, an efficient task-scheduling algorithm is required. Existing task-scheduling algorithms focus on task-resource requirements, CPU memory, execution time, and execution cost. In this paper, a task scheduling algorithm based on a Genetic Algorithm (GA) has been presented for assigning and executing different tasks. The proposed algorithm aims… More >

B. Gomathi¹, S. T. Suganthi^2,*, Karthikeyan Krishnasamy³, J. Bhuvana⁴

CMC-Computers, Materials & Continua, Vol.69, No.3, pp. 3693-3710, 2021, DOI:10.32604/cmc.2021.018159

Abstract Enterprises have extensively taken on cloud computing environment since it provides on-demand virtualized cloud application resources. The scheduling of the cloud tasks is a well-recognized NP-hard problem. The Task scheduling problem is convoluted while convincing different objectives, which are dispute in nature. In this paper, Multi-Objective Improved Monarch Butterfly Optimization (MOIMBO) algorithm is applied to solve multi-objective task scheduling problems in the cloud in preparation for Pareto optimal solutions. Three different dispute objectives, such as makespan, reliability, and resource utilization, are deliberated for task scheduling problems.The Epsilon-fuzzy dominance sort method is utilized in the multi-objective domain to elect the foremost… More >

Ngo Tung Son^1,2,*, Jafreezal Jaafar¹, Izzatdin Abdul Aziz¹, Bui Ngoc Anh², Hoang Duc Binh², Muhammad Umar Aftab³

CMC-Computers, Materials & Continua, Vol.69, No.3, pp. 3429-3444, 2021, DOI:10.32604/cmc.2021.017710

Abstract The scheduling process that aims to assign tasks to members is a difficult job in project management. It plays a prerequisite role in determining the project’s quality and sometimes winning the bidding process. This study aims to propose an approach based on multi-objective combinatorial optimization to do this automatically. The generated schedule directs the project to be completed with the shortest critical path, at the minimum cost, while maintaining its quality. There are several real-world business constraints related to human resources, the similarity of the tasks added to the optimization model, and the literature’s traditional rules. To support the decision-maker… More >

Jaber Almutairi¹, Mohammad Aldossary^2,*

Intelligent Automation & Soft Computing, Vol.30, No.1, pp. 129-145, 2021, DOI:10.32604/iasc.2021.018480

Abstract With the increasing number of Internet of Things (IoT) devices connected to the internet, a platform is required to support the enormous amount of data they generate. Since cloud computing is far away from the connected IoT devices, applications that require low-latency, real-time interaction and high quality of service (QoS) may suffer network delay in using the Cloud. Consequently, the concept of edge computing has appeared to complement cloud services, working as an intermediate layer with computation capabilities between the Cloud and IoT devices, to overcome these limitations. Although edge computing is a promising enabler for issues related to latency… More >