To solve the problems of low efficiency and insufficient dynamic response job shop scheduling in discrete manufacturing process, a multi-objective flexible model for digital twin its solution method are proposed. Firstly, with physical entity, virtual production plan is constructed, four factors taken as optimization goals. Then, hybrid particle swarm designed to increase refined ability, obtained Pareto optimal set analyzed by grey relational analysis obtain satisfactory which coincides...

IBM general business simulation environment (GBSE) is a supply chain tool developed by China Research Lab. It can capture dynamics with finest level of granularity and provides great insights to chain?s real operations. GBSE designed for tactical decision making; it proper what-if analysis risk analysis. implements multiple processes considerable details, such as order handling process, inventory control manufacturing transportation procurement planning. The created desktop software based on...

ABSTRACT Scheduling in flow shops with multiple processors (FSMP) involves the sequencing of n jobs through m stages where there can be one or more identical at each stage. The heuristic developed by Campbell et al., also known as CDS method, is important contributions to pure shop scheduling. In this paper, method was adopted for use FSMP environment. This study compares (m—1)Random scheduling order investigate effectiveness when used results indicate that superior are small numbers and...

The automated pharmacy system actualizes the automation of medicines-filling, medicines-storage and medicines-dispensing, it also solves existing problems caused by dispersedly stored manually operated such as inefficiency prescription-processing high error ratios in hospitals. Medicines are dispensed lifter system, which is a nonlinear, time-varying complex system. A fuzzy self-adaptive PID control method, synthesizes merits control, presented to study dynamic characteristics scheduling...

In the flexible manufacturing system, a reasonable production scheduling is crucial in shortening processing completion time and improving equipment utilization. Traditional manual cannot effectively solve complex workshop problems provide solution that meets requirements short period of time, which can lead to decrease efficiency. Aiming at job shop problem, genetic algorithm used find optimal this study, taking number overdue jobs, total comprehensive load rate maximum machine tool as...

To assist the decision makers, we develop a new supply chain simulation software: Easy-SC, Java-based tool that simplifies simulation. In its current state of development, Easy-SC is modeling for assessing pros and cons facility locations, resource allocations different combinations policies. It can be used in small projects such as single inventory units to large-scale world wide chains. This paper introduces by an examination software module architecture, elements, basic features processes.

The IBM supply-chain network optimization workbench (SNOW) is a software tool that can help company make strategic business decisions about the design and operation of its supply chain network. supports analysis with integrated simulation capability. Mathematical programming models are used to first identify some cost-effective scenarios from large number candidates. Optimization results then converted automatically for more detailed taking into account operational policies uncertainties....

This paper investigated a coordinated optimization problem of production and delivery operations with parallel machines multiple vehicles so that more cost-effective sustainable supply chain performance can be achieved. We propose an effective hybrid metaheuristic solution framework to deal this problem, by which the is decomposed into 3 sub-problems namely, vehicle assignment, machine scheduling traveling salesman sub-problem. established for handling in manner as simplify process reduce...

An invariant for cospectral graphs is a property shared by all graphs. In this paper, we present three new invariants graphs, characterized their arithmetic nature and apparent novelty. Specifically, let $G$ $H$ be two with adjacency matrices $A(G)$ $A(H)$, respectively. We show, among other results, that if are cospectral, then $e^{\rm T}A(G)^me\equiv e^{\rm T}A(H)^m e~({\rm mod}~4)$ any integer $m\geq 0$, where $e$ the all-one vector. As simple consequence, demonstrate under certain...

We present Rhombus, a new secure matrix-vector multiplication (MVM) protocol in the semi-honest two-party setting, which is able to be seamlessly integrated into existing privacy-preserving machine learning (PPML) frameworks and serve as basis of computation linear layers. Rhombus adopts RLWE-based homomorphic encryption (HE) with coefficient encoding, allows messages chosen from not only field Fp but also ring Z2l, where latter supports faster non-linear To achieve better efficiency, we...

A discrete event simulation approach based on heuristics is presented to emulate the production process of bell-type batch annealing in this paper. For optimizing scheduling objective minimizing resource free ratio, an improved Differential Evolution algorithm proposed, which solves a class problem, and whose crossover probability adaptively assigned order improve search ability not only local but also global. The experiments using practical data demonstrate that proposed method has great...

The makespan distributions in a flow shop with multiple processors(FSMP)are investigated this study. FSMP problem is characterized as the processing of n jobs through an m stage shop, where there exists one or more processors at each stage. Since it known that minimum computationally explosive, was necessary to investigate distribution makespans order provide guidance research. Results study may help gain better understanding problem.

ABSTRACT The makespan distributions in a flow shop with multiple processors (FSMP) are investigated this study. FSMP problem is characterized as the processing of n job through an m stage shop, where there exists one or more at each stage. Since it known that minimum computationally explosive, was necessary to investigate distribution makespans order provide guidance research. Results study may help gain better understanding problem.

Shop scheduling is an effective way for manufacturers to improve their manufacturing performances. However, due its complexity, it difficult deal with shop problems (SSP). Thus, SSP has received a lot of attention from industry and academia. Various kinds methods have been proposed solve SSP. Learning-based method just one the most representative This paper focuses on reviewing learning-based Firstly, are briefly introduced. Then, description model provided classification discussed. Next,...

Article Flugversuchsdaten-Korrektur durch Flugbahnrekonstruktion mit einem nichtlinearen Sechs-Freiheitsgrade-Modell was published on December 1, 1989 in the journal at - Automatisierungstechnik (volume 37, issue 1-12).