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.     

An improved feedrate scheduling method for NURBS interpolation in five-axis machining

Five-axis machining plays an important role in manufacturing by dint of its high efficiency and accuracy. While two rotation axes benefit the flexibility of machining, it also brings limitations and challenges. In order to further balance machining precision and efficiency, an improved feedrate scheduling method is presented considering geometric error and kinematic constraints for the Non Uniform Rational B-Spline (NURBS) interpolation in five-axis machining. A simplification method is proposed to calculate the geometric error which describes the deviation between the ideal tool path and the real tool path induced by the non-linear movement. A linear relation between geometric error and feedrate is built to limit the feedrate. The constraints determined by single axis kinematic performance and tangential kinematic performance are also considered. Under these constraints, a constrained feedrate profile is determined. Aiming to get more constant feedrate in the difficult-to-machine areas, this work proposes a scheduling method which combines morphological filtering and S-shape acceleration/deceleration (acc/dec) mode. Simulations and experiments are performed to compare the proposed feedrate scheduling method with two previous feedrate scheduling method and the results prove that the proposed feedrate scheduling method is reliable and effective.     

State-space ARIMA for supply-chain forecasting

ARIMA is seldom used in supply chains in practice. There are several reasons, not the least of which is the small sample size of available data, which restricts the usage of the model. Keeping in mind this restriction, we discuss in this paper a state-space ARIMA model with a single source of error and show how it can be efficiently used in the supply-chain context, especially in cases when only two seasonal cycles of data are available. We propose a new order selection algorithm for the model and compare its performance with the conventional ARIMA on real data. We show that the proposed model performs well in terms of both accuracy and computational time in comparison with other ARIMA implementations, which makes it efficient in the supply-chain context.     

A Global Maximum Error Controller Based Nonlinearity Aware TPWL Method for Reducing Nonlinear Systems

Abstract

Model order reduction is a common practice to reduce large order systems so that their simulation and control become easy. Nonlinearity aware trajectory piecewise linear is a variation of trajectory piecewise linearization technique of order reduction that is used to reduce nonlinear systems. With this scheme, the reduced approximation of the system is generated by weighted sum of the linearized and reduced sub-models obtained at certain linearization points on the system trajectory. This scheme uses dynamically inspired weight assignment that makes the approximation nonlinearity aware. Just as weight assignment, the process of linearization points selection is also important for generating faithful approximations. This article uses a global maximum error controller based linearization points selection scheme according to which a state is chosen as a linearization point if the error between a current reduced model and the full order nonlinear system reaches a maximum value. A combination that not only selects linearization points based on an error controller but also assigns dynamic inspired weights is shown in this article. The proposed scheme generates approximations with higher accuracies. This is demonstrated by applying the proposed method to some benchmark nonlinear circuits including RC ladder network and inverter chain circuit and comparing the results with the conventional schemes.     

Hybrid make-to-stock and make-to-order systems: a taxonomic review

Production planning and control (PPC) systems that employ aspects from both make-to-order (MTO) and make-to-stock (MTS) production control are known as hybrid MTS/MTO systems. While both MTO and MTS separately have been studied extensively, their combined use has received less attention. However, the literature on this topic is growing and this paper shows that the review performed in this paper is an important addition to the field. We categorise relevant literature according to a novel taxonomy and show that hybrid MTS/MTO production control can be used in different contexts. In addition, an overview of the modelling techniques and methods used in these papers is provided. Based on the reviewed literature, relevant research questions and directions for future research are identified. Finally, it is shown that hybrid MTS/MTO production control is prevalent in practice by discussing research with industrial applications. The paper contains an overview of research on hybrid MTS/MTO production control to be used as reference for researchers active in the field, and provides managerial insights and directions for future research on this topic.     

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.     

Deposition of UF5 on the surface of steel material having oxide coating in contact with gaseous UF6

When UF6 is handled in leak tight system, the amount of uranium compound formed on the surface of containers, valves, and others in UF6 handling facilities is not so significant for a short term that special attention has not been given to this problem. The present work was done to throw some more light on this problem based on the recent experiment. We discuss the possibility that the intermolecular transfer of a fluorine atom from UF6 to UF5 may participate in the formation of uranium compound. The discussion includes also the unique features contained in the experimental result, the reaction processes assumed in this problem, and the derivation of a rate equation for expressing the deposition of uranium compound. Furthermore, we propose a new method for determining nonlinear parameters included in a governing differential equation having two variables for expressing the deposition of uranium compound from experimental raw data.     

基于组合双向拍卖的云资源调度方法

针对跨数据中心的资源调度问题，提出了一种基于组合双向拍卖（PCDA）的资源调度方案。首先，将云资源拍卖分为三个部分：云用户代理报价、云资源提供商要价、拍卖代理组织拍卖；其次，在定义用户的优先级及任务紧迫度的基础上，在拍卖过程中估算每一个工作发生的服务等级协议（SLA）违规并以此计算云提供商的收益，同时每轮竞拍允许成交多项交易；最终达到根据用户等级合理分配云资源调度的效果。仿真实验结果表明该算法保证了竞拍成功率，与传统一次拍卖成交一项的组合双向拍卖方案相比，PCDA在竞拍时间段产生的能耗降低了35.00%，拍卖云提供商的利润提高了约38.84%。     

Design and performance study of phase‐locked loop using fractional‐order loop filter

The present work reports the realization of an analog fractional‐order phase‐locked loop (FPLL) using a fractional capacitor. The expressions for bandwidth, capture range, and lock range of the FPLL have been derived analytically and then compared with the experimental observations using LM565 IC. It has been observed that bandwidth and capture range can be extended by using FPLL. It has also been found that FPLL can provide faster response and lower phase error at the time of switching compared to its integer‐order counterpart. Copyright © 2014 John Wiley & Sons, Ltd.     

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.