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.     

Risk of slaughterhouse workers developing work-related musculoskeletal disorders in different organizational working conditions

Job rotation is defined as workers rotating between tasks with different exposure levels and occupational demands. The aim of the present study was to analyze the risk factors for the development of upper-limb work-related musculoskeletal disorders (UL-WMSDs) in poultry slaughterhouse workers as well as compare the score of the OCRA Checklist in different organizational working conditions. In this cross-sectional study, 118 workers were involved, 68 women (32.3 ± 10.7 years) and 50 men (29.5 ± 10.5 years). Three organizational configurations (“without job rotation”, “with job rotation – tasks >1h” and “with job rotation - tasks <1h”) were evaluated using the OCRA Checklist method, totaling 36 tasks and 28 job rotation schemes composed of 2–3 tasks. The OCRA score of the right upper limbs (17.8 ± 3.2) was significantly higher (p = 0.046) relative to the left upper limbs (16.4 ± 3.6). The median score was significantly lower in the “with job rotation - tasks <1h” condition (18.6) when compared to the “job rotation – tasks >1h” (19.4) (p < 0.001) and the “without job rotation” (19.0) (p = 0.038) conditions. However, there was no significant difference between the condition “with job rotation - tasks >1h” and “without job rotation” (p = 0.155). Thus, job rotations with intervals <1h reduced the risk of developing UL-WMSDs. Job rotations with <1 h intervals in poultry slaughterhouses are recommended along with further studies to verify the effectiveness of rotations with more than two tasks, involving mild or non-repetitive tasks.     

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.     

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

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

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.     

Evolution of properties of parts during MIM and sintering of recycled oxide particles

Metal injection moulding (MIM) is an established process for high volume production of complex shaped metallic parts using commercially available feedstocks. The characteristics of parts after moulding, debinding, and sintering cannot be simply predictable from raw materials because the properties get altered with the process parameters and the corresponding levels of porosity during processing steps. In this study, physical properties, microstructure, and mechanical properties of the MIM parts have been characterised to understand the evolution of strength during various steps in MIM processing. Feedstocks with different binder loading show a considerable difference in physical as well as mechanical characteristics. During sintering of parts which have solid loading of grinding sludge, simultaneous in situ reduction and densification takes place, whereas only densification occurs in carbonyl iron parts. It is, therefore, possible to make complex shaped parts of different levels of porosity from downgraded shop floor metallic waste.     

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.     

基于改进人工蜂群算法的多目标绿色柔性作业车间调度研究

针对多目标绿色柔性作业车间调度问题（MGFJSP）的特点，提出从碳排放量、噪声和废弃物这3个指标来综合评定环境污染程度，建立了以最小化最大完成时间和环境污染程度为优化目标的MGFJSP模型，并提出了一种改进的人工蜂群算法来求解该模型。算法的具体改进包括：设计了一种三维向量的编码和对应解码方案，在跟随蜂搜索阶段引入一种有效的动态邻域搜索操作来提高算法的局部搜索能力，在侦查蜂阶段提出产生新食物源的策略用于增加种群的多样性。最后进行了实验研究与算法对比，以验证所建模型和所提算法的有效性。