Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review

Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed.     

Lagrangian relaxation hybrid with evolutionary algorithm for short-term generation scheduling

Short-term generation scheduling is an important function in daily operational planning of power systems. It is defined as optimal scheduling of power generators over a scheduling period while respecting various generator constraints and system constraints. Objective of the problem includes costs associated with energy production, start-up cost and shut-down cost along with profits. The resulting problem is a large scale nonlinear mixed-integer optimization problem for which there is no exact solution technique available. The solution to the problem can be obtained only by complete enumeration, often at the cost of a prohibitively computation time requirement for realistic power systems. This paper presents a hybrid algorithm which combines Lagrangian Relaxation (LR) together with Evolutionary Algorithm (EA) to solve the problem in cooperative and competitive energy environments. Simulation studies were carried out on different systems containing various numbers of units. The outcomes from different algorithms are compared with that from the proposed hybrid algorithm and the advantages of the proposed algorithm are briefly discussed.     

On global Hessenberg based methods for solving Sylvester matrix equations

In the first part of this paper, we investigate the use of Hessenberg-based methods for solving the Sylvester matrix equation $AX+XB=C$. To achieve this goal, the Sylvester form of the global generalized Hessenberg process is presented. Using this process, different methods based on a Petrov–Galerkin or on a minimal norm condition are derived. In the second part, we focus on the SGl-CMRH method which is based on the Sylvester form of the Hessenberg process with pivoting strategy combined with a minimal norm condition. In order to accelerate the SGl-CMRH method, a preconditioned framework of this method is also considered. It includes both fixed and flexible variants of the SGl-CMRH method. Moreover, the connection between the flexible preconditioned SGl-CMRH method and the fixed one is studied and some upper bounds for the residual norm are obtained. In particular, application of the obtained theoretical results is investigated for the special case of solving linear systems of equations with several right-hand sides. Finally, some numerical experiments are given in order to evaluate the effectiveness of the proposed methods.     

Transport Map sampling with PGD model reduction for fast dynamical Bayesian data assimilation

The motivation of this work is to address real-time sequential inference of parameters with a full Bayesian formulation. First, the proper generalized decomposition (PGD) is used to reduce the computational evaluation of the posterior density in the online phase. Second, Transport Map sampling is used to build a deterministic coupling between a reference measure and the posterior measure. The determination of the transport maps involves the solution of a minimization problem. As the PGD model is quasi-analytical and under a variable separation form, the use of gradient and Hessian information speeds up the minimization algorithm. Eventually, uncertainty quantification on outputs of interest of the model can be easily performed due to the global feature of the PGD solution over all coordinate domains. Numerical examples highlight the performance of the method.     

Supply chain planning and scheduling integration using Lagrangian decomposition in a knowledge management environment

The integration of planning and scheduling decisions in rigorous mathematical models usually results in large scale problems. In order to tackle the problem complexity, decomposition techniques based on duality and information flows between a master and a set of subproblems are widely applied. In this sense, ontologies improve information sharing and communication in enterprises and can even represent holistic mathematical models facilitating the use of analytic tools and providing higher flexibility for model building. In this work, we exploit this ontologies’ capability to address the optimal integration of planning and scheduling using a Lagrangian decomposition approach. Scheduling/planning sub-problems are created for each facility/supply chain entity and their dual solution information is shared by means of the ontological framework. Two case studies based on a STN representation of supply chain planning and scheduling models are presented to emphasize the advantages and limitations of the proposed approach.     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.     

Research on the identification performance of UHF RFID system considering the correlation of cascaded channel

The identification rate of UHF RFID system was restricted by multipath propagation effects.The system identification performance was studied considering the correlation coefficient between forward and reverse channels.Based on the generalized Rician fading channel model,the analytical expression of identification rate was derived under independent,full correlation and correlation cases.Compared with the existing analysis,the proposed uniform calculation formula of identification rate was for any correlation coefficient and kinds of channel conditions.The numerical computation and Monte-carlo simulations show that the influences of different correlation coefficients,channel conditions,sensitivity and distance on the identification rate.     

Demand response for home energy management system

The optimization of energy consumption, with consequent cost reduction, is one of the main challenges for the present and future smart grid. Demand response (DR) program is expected to be vital in home energy management system (HEMS) which aims to schedule the operation of appliances to save energy costs by considering customer convenience as well as characteristics of electric appliances. The DR program is a challenging optimization problem especially when the formulations are non-convex or NP-hard problems. In order to solve this challenging optimization problem efficiently, an effective heuristic approach is proposed to achieve a near optimal solution with low computational costs. Different from previously proposed methods in literatures which are not suitable to be run in embedded devices such as a smart meter. The proposed algorithm can be implemented in an embedded device which has severe limitations on memory size and computational power, and can get an optimal value in real-time. Numerical studies were carried out with the data simulating practical scenarios are provided to demonstrate the effectiveness of the proposed method.     

Waves in generalized thermo-viscoelastic infinite continuum with cylindrical cavity due to three-phase-lag time-nonlocal heat transfer

Abstract

Generalized thermoelastic interactions due to three-phase-lag time-nonlocal heat transfer in a Kelvin-Voigt type infinitely extended visco-thermoelastic continuum with cylindrical cavity has been investigated. The two-temperature generalized thermoelasticity theory has also been taken into account. The problem has been solved in the domain of Laplace on the assumption that the surface of the cavity is free from traction and is subjected to a smooth and time-dependent-heating effect. Laplace inversion of the transformed solutions has been carried out numerically. The obtained numerical data for different considerations are plotted in graphs to study the effects of time-nonlocal parameter, two-temperature parameter and visco-thermoelastic relaxation parameter on different thermoelastic quantities of physical interest.     

Optimal scheduling of single stage batch plants with direct heat integration

This paper addresses the multi-objective optimization problem arising in the operation of heat integrated batch plants, where makespan and utility consumption are the two conflicting objectives. A new continuous-time MILP formulation with general precedence variables is proposed to simultaneously handle decisions related to timing, product sequencing, heat exchanger matches (selected from a two-stage superstructure) and their heat loads. It features a complex set of timing constraints to synchronize heating and cooling tasks, derived from Generalized Disjunctive Programming. Through the solution of an industrial case study from a vegetable oil refinery, we show that major savings in utilities can be achieved while generating the set of Pareto optimal solutions through the ɛ-constraint method.