Yizhuo Zhu¹, Shaosi He², Deming Lei^2,*

CMC-Computers, Materials & Continua, Vol.81, No.1, pp. 843-866, 2024, DOI:10.32604/cmc.2024.054473 - 15 October 2024

Abstract Unrelated parallel machine scheduling problem (UPMSP) is a typical scheduling one and UPMSP with various real-life constraints such as additional resources has been widely studied; however, UPMSP with additional resources, maintenance, and energy-related objectives is seldom investigated. The Artificial Bee Colony (ABC) algorithm has been successfully applied to various production scheduling problems and demonstrates potential search advantages in solving UPMSP with additional resources, among other factors. In this study, an energy-efficient UPMSP with additional resources and maintenance is considered. A dynamical artificial bee colony (DABC) algorithm is presented to minimize makespan and total energy consumption… More >

Deming Lei^*, Heen Li

CMC-Computers, Materials & Continua, Vol.79, No.2, pp. 1855-1874, 2024, DOI:10.32604/cmc.2024.049480 - 15 May 2024

Abstract This study focuses on the scheduling problem of unrelated parallel batch processing machines (BPM) with release times, a scenario derived from the moulding process in a foundry. In this process, a batch is initially formed, placed in a sandbox, and then the sandbox is positioned on a BPM for moulding. The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume. To minimize the makespan, a new cooperated imperialist competitive algorithm (CICA) is introduced. In CICA, the number of empires is not a parameter, and four empires are maintained More >

Lei Wang^1,2,*, Yuxin Qi^1,2

CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.1, pp. 325-339, 2023, DOI:10.32604/cmes.2022.019730 - 29 September 2022

Abstract Currently, energy conservation draws wide attention in industrial manufacturing systems. In recent years, many studies have aimed at saving energy consumption in the process of manufacturing and scheduling is regarded as an effective approach. This paper puts forwards a multi-objective stochastic parallel machine scheduling problem with the consideration of deteriorating and learning effects. In it, the real processing time of jobs is calculated by using their processing speed and normal processing time. To describe this problem in a mathematical way, a multi-objective stochastic programming model aiming at realizing makespan and energy consumption minimization is formulated. More >

P. Ramadevi^1,*, T. Jayasankar¹, V. Dinesh², M. Dhamodaran³

Computer Systems Science and Engineering, Vol.44, No.2, pp. 1373-1385, 2023, DOI:10.32604/csse.2023.026603 - 15 June 2022

Abstract Recently, with the growth of cyber physical systems (CPS), several applications have begun to deploy in the CPS for connecting the cyber space with the physical scale effectively. Besides, the cloud computing (CC) enabled CPS offers huge processing and storage resources for CPS that finds helpful for a range of application areas. At the same time, with the massive development of applications that exist in the CPS environment, the energy utilization of the cloud enabled CPS has gained significant interest. For improving the energy effectiveness of the CC platform, virtualization technologies have been employed for… More >

Mohamed Ali Rakrouki^1,2,*, Abeer Aljohani¹, Nawaf Alharbe¹, Abdelaziz Berrais², Talel Ladhari²

Intelligent Automation & Soft Computing, Vol.35, No.1, pp. 1119-1134, 2023, DOI:10.32604/iasc.2023.028604 - 06 June 2022

Abstract In this paper, we consider the problem of minimizing the total tardiness in a deterministic two-machine permutation flowshop scheduling problem subject to release dates of jobs and known unavailability periods of machines. The theoretical and practical importance of minimizing tardiness in flowshop scheduling environment has motivated us to investigate and solve this interested two-machine scheduling problem. Methods that solve this important optimality criterion in flowshop environment are mainly heuristics. In fact, despite the -hardness in the strong sense of the studied problem, to the best of our knowledge there are no approximate algorithms (constructive heuristics… More >

R. Swathy^*, B. Vinayagasundaram

Computer Systems Science and Engineering, Vol.43, No.1, pp. 159-174, 2022, DOI:10.32604/csse.2022.023706 - 23 March 2022

Abstract This paper proposes an algorithm for scheduling Virtual Machines (VM) with energy saving strategies in the physical servers of cloud data centers. Energy saving strategy along with a solution for productive resource utilization for VM deployment in cloud data centers is modeled by a combination of “Virtual Machine Scheduling using Bayes Theorem” algorithm (VMSBT) and Virtual Machine Migration (VMMIG) algorithm. It is shown that the overall data center’s consumption of energy is minimized with a combination of VMSBT algorithm and Virtual Machine Migration (VMMIG) algorithm. Virtual machine migration between the active physical servers in the… More >

Tingting Yang¹, Hailong Feng¹, Chengming Yang², Ge Guo³, Tieshan Li¹

Computer Systems Science and Engineering, Vol.33, No.2, pp. 157-164, 2018, DOI:10.32604/csse.2018.33.157

Abstract In this paper, the online and offline scheduling schemes towards maritime Cyber Physical Systems (CPSs), to transmit video packets generating from the interior of vessel. During the sailing from the origin port to destination port, the video packets could be delivered via the infostations shoreside. The video packets have their respective release times, deadlines, weights and processing time. The video packets only could be successfully transmitted before their deadlines. A mathematic job-machine problem is mapped. Facing distinguished challenges with unique characteristics imposed in maritime scenario, we focus on the heterogeneous networking and resource optimal scheduling More >