Research

Jump to: Review

21 pages, 363 KiB

Open AccessArticle

Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects

by Zong-Jun Wei, Li-Yan Wang, Lei Zhang, Ji-Bo Wang and Ershen Wang

Mathematics 2023, 11(16), 3536; https://doi.org/10.3390/math11163536 - 16 Aug 2023

Cited by 2 | Viewed by 636

In this paper, the single-machine scheduling problems under the common and slack due date assignments are studied, where the actual processing time of the job needs to consider some factors, such as convex resource allocation, maintenance activity, and learning effects. The goal of [...] Read more.

In this paper, the single-machine scheduling problems under the common and slack due date assignments are studied, where the actual processing time of the job needs to consider some factors, such as convex resource allocation, maintenance activity, and learning effects. The goal of this study is to find the optimal sequence, maintenance activity location, resource allocation and common due date (flow allowance). The objective function is (1) to minimize the sum of scheduling cost (including the weighted sum of earliness, tardiness and common due date (flow allowance), where the weights are position-dependent weights) and resource consumption cost, and (2) to minimize the scheduling cost under the resource consumption cost which is bounded. We prove that these problems can be solved in polynomial time. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

20 pages, 320 KiB

Open AccessArticle

Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect

by Yi-Chun Wang and Ji-Bo Wang

Mathematics 2023, 11(14), 3179; https://doi.org/10.3390/math11143179 - 20 Jul 2023

Cited by 3 | Viewed by 604

Abstract

In classical schedule problems, the actual processing time of a job is a fixed constant, but in the actual production process, the processing time of a job is affected by a variety of factors, two of which are the learning effect and resource [...] Read more.

In classical schedule problems, the actual processing time of a job is a fixed constant, but in the actual production process, the processing time of a job is affected by a variety of factors, two of which are the learning effect and resource allocation. In this paper, single-machine scheduling problems with resource allocation and a time-dependent learning effect are investigated. The actual processing time of a job depends on the sum of normal processing times of previous jobs and the allocation of non-renewable resources. With the convex resource consumption function, the goal is to determine the optimal schedule and optimal resource allocation. Three problems arising from two criteria (i.e., the total resource consumption cost and the scheduling cost) are studied. For some special cases of the problems, we prove that they can be solved in polynomial time. More generally, we propose some accurate and intelligent algorithms to solve these problems. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

► Show Figures

Figure 1

12 pages, 291 KiB

Open AccessArticle

Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs

by Li-Han Zhang, Dan-Yang Lv and Ji-Bo Wang

Mathematics 2023, 11(12), 2737; https://doi.org/10.3390/math11122737 - 16 Jun 2023

Cited by 3 | Viewed by 614

Abstract

In enterprise management, there are often multiple agents competing for the same products to reduce production cost. On this basis, this paper investigates a two-agent slack due-date single-machine scheduling problem with deteriorating jobs, where the processing time of a job is extended as [...] Read more.

In enterprise management, there are often multiple agents competing for the same products to reduce production cost. On this basis, this paper investigates a two-agent slack due-date single-machine scheduling problem with deteriorating jobs, where the processing time of a job is extended as a function of position-dependent workload, resource allocation and a common deterioration rate. The goal is to find the optimal sequence and resource allocation that minimizes the maximal value of earliness, tardiness, and decision variables of one agent subject to an upper bound on cost value of the second agent. Through theoretical analysis, a polynomial time algorithm with

O (N^{3})

time is proposed for the problem, where N is the maximum number of jobs between the two agents. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

15 pages, 1475 KiB

Open AccessArticle

Language Recovery in Discrete-Event Systems against Sensor Deception Attacks

by Abdeldjalil Labed, Ikram Saadaoui, Hanyu E, Mohammed A. El-Meligy, Zhiwu Li and Mohamed Sharaf

Mathematics 2023, 11(10), 2313; https://doi.org/10.3390/math11102313 - 16 May 2023

Cited by 2 | Viewed by 960

Abstract

Cyber-physical systems are characterized by the intrinsic combination of software and physical components that usually include (wired and wireless) communication devices, sensors, actuators, and control processing units. Some wireless devices communicate over insecure channels, rendering cyber-physical systems at risk of malicious attacks that [...] Read more.

Cyber-physical systems are characterized by the intrinsic combination of software and physical components that usually include (wired and wireless) communication devices, sensors, actuators, and control processing units. Some wireless devices communicate over insecure channels, rendering cyber-physical systems at risk of malicious attacks that might lead to catastrophic damage. This paper touches upon the problem of sensor deception attacks in supervisory control of discrete-event systems, where an attacker can insert, delete, or replace sensor readings to mislead the supervisor and induce system damage. We model potential attacks using nondeterministic finite-state transducers and then introduce a new defence strategy that utilizes insertion functions. Insertion functions are a type of monitoring interface that alters the system’s behaviour by adding extra observable events. Finally, we construct a nondeterministic finite-state transducer called a supervisor filter that recovers the original language generated by the plant by handling the altered language. The insertion function and the supervisor filter cooperate to control the system and confuse the intruder without confusing the supervisor. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

► Show Figures

Figure 1

18 pages, 1676 KiB

Open AccessArticle

A Hybrid Algorithm Based on Social Engineering and Artificial Neural Network for Fault Warning Detection in Hydraulic Turbines

by Yun Tan, Changshu Zhan, Youchun Pi, Chunhui Zhang, Jinghui Song, Yan Chen and Amir-Mohammad Golmohammadi

Mathematics 2023, 11(10), 2274; https://doi.org/10.3390/math11102274 - 12 May 2023

Cited by 3 | Viewed by 1008

Abstract

Hydraulic turbines constitute an essential component within the hydroelectric power generation industry, contributing to renewable energy production with minimal environmental pollution. Maintaining stable turbine operation presents a considerable challenge, which necessitates effective fault diagnosis and warning systems. Timely and efficient fault w arnings [...] Read more.

Hydraulic turbines constitute an essential component within the hydroelectric power generation industry, contributing to renewable energy production with minimal environmental pollution. Maintaining stable turbine operation presents a considerable challenge, which necessitates effective fault diagnosis and warning systems. Timely and efficient fault w arnings are particularly vital, as they enable personnel to address emerging issues promptly. Although backpropagation (BP) networks are frequently employed in fault warning systems, they exhibit several limitations, such as susceptibility to local optima. To mitigate this issue, this paper introduces an improved social engineering optimizer (ISEO) method aimed at optimizing BP networks for developing a hydraulic turbine warning system. Experimental results reveal that the ISEO-BP-based approach offers a highly effective fault warning system, as evidenced by superior performance metrics when compared to alternative methods. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

► Show Figures

Figure 1

19 pages, 4271 KiB

Open AccessArticle

Synergistic Mechanism of Designing Information Granules with the Use of the Principle of Justifiable Granularity

by Dan Wang, Yukang Liu and Zhenhua Yu

Mathematics 2023, 11(7), 1750; https://doi.org/10.3390/math11071750 - 06 Apr 2023

Viewed by 996

Abstract

The construction of information granules is a significant and interesting topic of Granular Computing (GrC) in which information granules play a vital role in representing and describing data, and it has become one of the most effective frameworks for solving complex problems. In [...] Read more.

The construction of information granules is a significant and interesting topic of Granular Computing (GrC) in which information granules play a vital role in representing and describing data, and it has become one of the most effective frameworks for solving complex problems. In this study, we are interested in the collaborative impacts of several different characteristics on constructing information granules, and a novel synergistic mechanism of the principle of justifiable granularity is utilized in developing information granules. The synergistic mechanism is finalized with a two-phase process—to start with, the principle of justifiable granularity and Fuzzy C-Means Clustering method are combined to develop a collection of information granules. First, the available experimental data is transformed (normalized) into fuzzy sets following the standard Fuzzy C-Means Clustering method. Then, information granules are developed based on the elements located in different clusters with the use of the principle of justifiable granularity. In the sequel, the positions of information granules are updated by considering the collaborative impacts of the other information granules with the parameters of specifying the level of influence. Experimental studies are conducted to illustrate the nature and feasibility of the proposed framework based on the synthetic data as well as a series of publicly available datasets coming from KEEL machine learning repositories. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

► Show Figures

Figure 1

27 pages, 3347 KiB

Open AccessArticle

Fixed-Switching-Frequency Modulated Model Predictive Control for Islanded AC Microgrid Applications

by Ariel Villalón, Carlos Muñoz, Javier Muñoz and Marco Rivera

Mathematics 2023, 11(3), 672; https://doi.org/10.3390/math11030672 - 28 Jan 2023

Cited by 3 | Viewed by 1718

Abstract

In this paper, a fixed-switching-frequency modulated model predictive control (M

^{2}

PC) is established for a two-level three-phase voltage source inverter (VSI) working in an islanded AC microgrid. These small-scale power systems are composed by two or more VSIs which interface DGs, controlling [...] Read more.

In this paper, a fixed-switching-frequency modulated model predictive control (M

^{2}

PC) is established for a two-level three-phase voltage source inverter (VSI) working in an islanded AC microgrid. These small-scale power systems are composed by two or more VSIs which interface DGs, controlling the voltage amplitude and frequency in the system, and simultaneously sharing the load active and reactive power. Generally, these operational characteristics are achieved using hierarchical linear control loops, but with challenging limitations such as slow transient reaction to disturbances and high proneness to be affected by parameter modifications. Model predictive control may solve these issues. Nevertheless, the most used and developed predictive control scheme, the finite-set model predictive control (FS-MPC), presents the drawback of having the harmonic spectrum spread over all the frequencies. This brings issues with coupling between the different hierarchical control levels of the whole microgrid system, and eventually, when designing the filters for main-grid connection. This paper aims to solve these issues by developing the fixed-switching-frequency M

^{2}

PC working with higher-level control loops for operation in an islanded AC microgrid. These advantages are proved in an AC microgrid configuration where methodology for paralleling multiple M

^{2}

PC-regulated VSIs is described, with rapid transient response, inherent stability, and fully decentralised operation of individual VSIs, achieving proper load power sharing, eliminating circular currents, and proper waveforms for output currents and capacitor voltages. All these achievements have been confirmed via simulation and experimental verification. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

► Show Figures

Figure 1

25 pages, 2505 KiB

Open AccessArticle

Poliseek: A Fast XACML Policy Evaluation Engine Using Dimensionality Reduction and Characterized Search

by Fan Deng, Zhenhua Yu, Xinrui Zhan, Chongyu Wang, Xiaolin Zhang, Yangyang Zhang and Zilu Qin

Mathematics 2022, 10(23), 4530; https://doi.org/10.3390/math10234530 - 30 Nov 2022

Viewed by 1136

Abstract

Due to evaluation performance limits and compatibility problems with PDP (Policy Decision Point) in practical information systems, some established schemes have limits in handling massive complex requests. To address the existing challenges of fast rule match on interval values, we propose a novel [...] Read more.

Due to evaluation performance limits and compatibility problems with PDP (Policy Decision Point) in practical information systems, some established schemes have limits in handling massive complex requests. To address the existing challenges of fast rule match on interval values, we propose a novel policy evaluation engine, namely Poliseek with three desired modules. A preprocessing module of Poliseek is equipped with a static encoding strategy and converts the XACML rules and requests into four-dimensional numeric vectors in an attribute space. Owing to a novel optimization object of minimizing interval collisions, a dimensionality reducer and diffuser module can generate candidate values related to each rule vector in the identification space. These values and requests are handled by a fast policy evaluation module using well-constructed hash buckets and a characterized search algorithm. The experimental results show that if the number of requests reaches 10,000, Poliseek can find the target rule approximately 1090, 15, and 15 times faster than the Sun PDP, XEngine, and SBA-XACML, respectively. Poliseek also offers a fast evaluation progress of handling 10,000 complex policy rules with interval attribute values in 275.9 ms, which shows its strong robustness and practicality. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

► Show Figures

Figure 1

Review

Jump to: Research

28 pages, 1844 KiB

Open AccessReview

The Unfolding: Origins, Techniques, and Applications within Discrete Event Systems

by Younes Rouabah and Zhiwu Li

Mathematics 2023, 11(1), 47; https://doi.org/10.3390/math11010047 - 23 Dec 2022

Cited by 1 | Viewed by 1684

Abstract

This article aims to provide a perspective on the foundations and developments of the net unfolding techniques and their applications to discrete event systems. The numerous methods applied to concurrency presented in the literature can be roughly divided into two classes: those that [...] Read more.

This article aims to provide a perspective on the foundations and developments of the net unfolding techniques and their applications to discrete event systems. The numerous methods applied to concurrency presented in the literature can be roughly divided into two classes: those that assume concurrency can be represented by means of a non-deterministic form, and those that represent concurrency by means of causal relations. This study serves as an ideal starting point for researchers interested in true concurrency semantics by offering a concise literature review of one of the major streams of research towards concurrency and interleaving problems. In order to cope with the state-explosion problem, the unfolding approach is used. Based on the findings of concurrency theory, interleaving semantics are replaced with a unique partially ordered occurrence net. In this paper, we aim to provide a comprehensive review on the history of net unfoldings, the methods that are based on these unfoldings, and how they are used in discrete event systems for automatic verification and compact representations purposes. Full article

(This article belongs to the Special Issue Systems Engineering, Control, and Automation)

► Show Figures

Figure 1

Journal Menu

Journal Browser

Systems Engineering, Control, and Automation

Share This Special Issue

Special Issue Editors

Special Issue Information

Keywords

Published Papers (9 papers)

Research

Review

Further Information

Guidelines

MDPI Initiatives

Follow MDPI