A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

This study focuses on the scheduling problem of unrelated parallel batch processing machines(BPM)with release times,a scenario derived from the moulding process in a foundry.In this process,a batch is initially formed,placed in a sandbox,and then the sandbox is positioned on a BPM formoulding.The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume.To minimize the makespan,a new cooperated imperialist competitive algorithm(CICA)is introduced.In CICA,the number of empires is not a parameter,and four empires aremaintained throughout the search process.Two types of assimilations are achieved:The strongest and weakest empires cooperate in their assimilation,while the remaining two empires,having a close normalization total cost,combine in their assimilation.A new form of imperialist competition is proposed to prevent insufficient competition,and the unique features of the problem are effectively utilized.Computational experiments are conducted across several instances,and a significant amount of experimental results show that the newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems.

ON-LINE PROBLEMS OF MINIMIZING MAKESPAN ON A SINGLE BATCH PROCESSING MACHINE WITH NONIDENTICAL JOB SIZES

The on-line problem of scheduling on a batch processing machine with nonidentical job sizes to minimize makespan is considered. The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. The paper deals with two variants： the case only with two distinct arrival times and the general case. For the first case, an on-line algorithm with competitive ratio 119/44 is given. For the latter one, a simple algorithm with competitive ratio 3 is given. For both variants the better ratios can be obtained if the problem satisfies proportional assumption.

A Multi-Objective Hybrid Algorithm for the Casting Scheduling Problem with Unrelated Batch Processing Machine

The casting production process typically involves single jobs and small batches,with multiple constraints in the molding and smelting operations.To address the discrete optimization challenge of casting production scheduling,this paper presents a multi-objective batch scheduling model for molding and smelting operations on unrelated batch processing machines with incompatible job families and non-identical job sizes.The model aims to minimise the makespan,number of batches,and average vacancy rate of sandboxes.Based on the genetic algorithm,virus optimization algorithm,and two local search strategies,a hybrid algorithm(GA-VOA-BMS)has been designed to solve the model.The GA-VOA-BMS applies a novel Batch First Fit(BFF)heuristic for incompatible job families to improve the quality of the initial population,adopting the batch moving strategy and batch merging strategy to further enhance the quality of the solution and accelerate the convergence of the algorithm.The proposed algorithm was then compared with multi-objective swarm optimization algorithms,namely NSGA-ll,SPEA-l,and PESA-ll,to evaluate its effectiveness.The results of the performance comparison indicate that the proposed algorithm outperforms the others in terms of both qualityand stability.

An LMI Method to Robust Iterative Learning Fault-tolerant Guaranteed Cost Control for Batch Processes

Based on an equivalent two-dimensional Fornasini-Marchsini model for a batch process in industry, a closed-loop robust iterative learning fault-tolerant guaranteed cost control scheme is proposed for batch processes with actuator failures. This paper introduces relevant concepts of the fault-tolerant guaranteed cost control and formulates the robust iterative learning reliable guaranteed cost controller (ILRGCC). A significant advantage is that the proposed ILRGCC design method can be used for on-line optimization against batch-to-batch process uncertainties to realize robust tracking of set-point trajectory in time and batch-to-batch sequences. For the convenience of implementation, only measured output errors of current and previous cycles are used to design a synthetic controller for iterative learning control, consisting of dynamic output feedback plus feed-forward control. The proposed controller can not only guarantee the closed-loop convergency along time and cycle sequences but also satisfy the H∞performance level and a cost function with upper bounds for all admissible uncertainties and any actuator failures. Sufficient conditions for the controller solution are derived in terms of linear matrix inequalities (LMIs), and design procedures, which formulate a convex optimization problem with LMI constraints, are presented. An example of injection molding is given to illustrate the effectiveness and advantages of the ILRGCC design approach.

Iterative Learning Model Predictive Control for a Class of Continuous/Batch Processes

An iterative learning model predictive control （ILMPC） technique is applied to a class of continuous/batch processes. Such processes are characterized by the operations of batch processes generating periodic strong disturbances to the continuous processes and traditional regulatory controllers are unable to eliminate these periodic disturbances. ILMPC integrates the feature of iterative learning control （ILC） handling repetitive signal and the flexibility of model predictive control （MPC）. By on-line monitoring the operation status of batch processes, an event-driven iterative learning algorithm for batch repetitive disturbances is initiated and the soft constraints are adjusted timely as the feasible region is away from the desired operating zone. The results of an industrial application show that the proposed ILMPC method is effective for a class of continuous/batch processes.

On-line Batch Process Monitoring with Improved Multi-way Independent Component Analysis

In the past decades, on-line monitoring of batch processes using multi-way independent component analysis （MICA） has received considerable attention in both academia and industry. This paper focuses on two troublesome issues concerning selecting dominant independent components without a standard criterion and deter- mining the control limits of monitoring statistics in the presence of non-Gaussian distribution. To optimize the number of key independent components~ we introctuce-anoveiconcept of-system-cleviation, which is ab^e＇io＇evalu[ ate the reconstructed observations with different independent components. The monitored statistics arc transformed to Gaussian distribution data by means of Box-Cox transformation, which helps readily determine the control limits. The proposed method is applied to on-line monitoring of a fed-hatch penicillin fermentation simulator, and the ex- _perimental results indicate the advantages of the improved MICA monitoring compared to the conventional methods.

FasParser:a package for manipulating sequence data

A computer software package called ＇FasParser＇ was developed for manipulating sequence data. It can be used on personal computers to perform series of analyses, including counting and viewing differences between two sequences at both DNA and codon levels, identifying overlapping regions between two alignments, sorting of sequences according to their IDs or lengths, concatenating sequences of multiple loci for a particular set of samples, translating nucleotide sequences to amino acids, and constructing alignments in several different formats, as well as some extracting and filtrating of data for a particular FASTA file. Majority of these functions can be run in a batch mode, which is very useful for analyzing large data sets. This package can be used by a broad audience, and is designed for researchers that do not have programming experience in sequence analyses. The GUI version of FasParser can be downloaded from https：//github.com/Sun-Yanbo/FasParser, free of charge

Influence of temperature on performance of anaerobic digestion of municipal solid waste

The influence of temperature on the performance of anaerobic reactors for treating the organic fraction of municipal sohd waste （OFMSW） was studied. Batch digestion of OFMSW was carded out for 32 d at different temperature （25℃, 35℃, 45℃ and 55℃） conditions for total solid concentrations （TS） 17% with the ratio of total organic carbon to nitrogen （C/N） being, 25：1 respectively, while keeping other parameters constant such as inoculum, start-up pH, reactor volume （2 L） and so on. Temperature can influence the methanogenic bacteria activity, accordingly inhibiting the OFMSW biodegradation and stabilization efficiency. Anaerobic reactors excelled at TS reduction, total volatile solid reduction, chemical oxygen demand reduction, increasing cumulative biogas production, whose rate was at temperature （35℃ and 55℃） conditions. Methane concentration in the biogas was above 65% in four reactors. In addition, the fluctuation of temperatures resulted in the biogas production variation. The data obtained indicated that temperature had a significant influence on anaerobic process.

Optimal Iterative Learning Control for Batch Processes Based on Linear Time-varying Perturbation Model

A batch-to-batch optimal iterative learning control （ILC） strategy for the tracking control of product quality in batch processes is presented. The linear time-varying perturbation （LTVP） model is built for product quality around the nominal trajectories. To address problems of model-plant mismatches, model prediction errors in the previous batch run are added to the model predictions for the current batch run. Then tracking error transition models can be built, and the ILC law with direct error feedback is explicitly obtained, A rigorous theorem is proposed, to prove the convergence of tracking error under ILC, The proposed methodology is illustrated on a typical batch reactor and the results show that the performance of trajectory tracking is gradually improved by the ILC.

Fault Diagnosis for Batch Processes by Improved Multi-model Fisher Discriminant Analysis

Since there are not enough fault data in historical data sets, it is very difficult to diagnose faults for batch processes. In addition, a complete batch trajectory can be obtained till the end of its operation. In order to overcome the need for estimated or filled up future unmeasured values in the online fault diagnosis, sufficiently utilize the finite information of faults, and enhance the diagnostic performance, an improved multi-model Fisher discriminant analysis is represented. The trait of the proposed method is that the training data sets are made of the current measured information and the past major discriminant information, and not only the current information or the whole batch data. An industrial typical multi-stage streptomycin fermentation process is used to test the performance of fault diagnosis of the proposed method.

A Genetic Algorithm-based Approach to Scheduling of Batch Production with Maximum Profit

The optimal scheduling of multi-product batch process is studied and a new mathematics model targeting the maximum profit is proposed, which can be solved by the modified genetic algorithm (MGA) with mixed coding (sequence coding and decimal coding) developed by us. In which, the partially matched cross over (PMX) and reverse mutation are used for the sequence coding, whereas the arithmetic crossover and heteropic mutation are used for the decimal coding. In addition, the relationship between production scale and production cost is analyzed and the maximum profit is always a trade-off of the production scale and production cost. Two examples are solved to demonstrate the effectiveness of the method.

Modeling and Optimization for Scheduling of Chemical Batch Processes

Chemical batch processes have become significant in chemical manufacturing. In these processes, large numbers of chemical products are produced to satisfy human demands in daily life. Recently, economy globalization has resulted, in growing worldwide competitions in tradi.tional chemical .process industry. In order to keep competitive in the global marketplace, each company must optimize its production management and set up a reactive system for market fluctuation. Scheduling is the core of production management in chemical processes. The goal of this paper is to review the recent developments in this challenging area. Classifications of batch scheduling problems and optimization methods are introduced. A comparison of six typical models is shown in a general benchmark example from the literature. Finally, challenges and applications in future research are discussed.

A Robust Statistical Batch Process Monitoring Framework and Its Application

In order to reduce the variations of the product quality in batch processes, multivariate statistical process control methods according to multi-way principal component analysis (MPCA) or multi-way projection to latent structure (MPLS) were proposed for on-line batch process monitoring. However, they are based on the decomposition of relative covariance matrix and strongly affected by outlying observations. In this paper, in view of an efficient projection pursuit algorithm, a robust statistical batch process monitoring (RSBPM) framework,which is resistant to outliers, is proposed to reduce the high demand for modeling data. The construction of robust normal operating condition model and robust control limits are discussed in detail. It is evaluated on monitoring an industrial streptomycin fermentation process and compared with the conventional MPCA. The results show that the RSBPM framework is resistant to possible outliers and the robustness is confirmed.

Phase Transition Analysis Based Quality Prediction for Multi-phase Batch Processes

Batch processes are usually involved with multiple phases in the time domain and many researches on process monitoring as well as quality prediction have been done using phase information. However, few of them consider phase transitions, though they exit widely in batch processes and have non-ignorable impacts on product qualities. In the present work, a phase-based partial least squares (PLS) method utilizing transition information is proposed to give both online and offline quality predictions. First, batch processes are divided into several phases using regression parameters other than prior process knowledge. Then both steady phases and transitions which have great influences on qualities are identified as critical-to-quality phases using statistical methods. Finally, based on the analysis of different characteristics of transitions and steady phases, an integrated algorithm is developed for quality prediction. The application to an injection molding process shows the effectiveness of the proposed algorithm in comparison with the traditional MPLS method and the phase-based PLS method.

Design and Analysis of Integrated Predictive Iterative Learning Control for Batch Process Based on Two-dimensional System Theory

Based on the two-dimensional （2D） system theory, an integrated predictive iterative learning control （2D-IPILC） strategy for batch processes is presented. First, the output response and the error transition model predictions along the batch index can be calculated analytically due to the 2D Roesser model of the batch process. Then, an integrated framework of combining iterative learning control （ILC） and model predictive control （MPC） is formed reasonably. The output of feedforward ILC is estimated on the basis of the predefined process 2D model. By min- imizing a quadratic objective function, the feedback MPC is introduced to obtain better control performance for tracking problem of batch processes. Simulations on a typical batch reactor demonstrate that the satisfactory tracking performance as well as faster convergence speed can be achieved than traditional proportion type （P- t-we） ILC despite the model error and disturbances.

Just-in-time learning based integrated MPC-ILC control for batch processes

Considering the two-dimension(2 D) characteristic and the unknown optimal trajectory problem of the batch processes, an integrated model predictive control-iterative learning control(MPC-ILC) for batch processes is proposed in this paper. Firstly, the batch-axis information and time-axis information are combined into one quadratic performance index. It implies the integration of ILC and MPC algorithm idea, which leads to superior tracking performance and better robustness against disturbance and uncertainty. To address the problem of the unknown optimal trajectory, both time-varying prediction horizon and end product quality control are employed. Moreover, an integrated 2 D just-in-time learning(JITL) model is used to improve the predictive accuracy. Furthermore, rigorous description and proof are presented to prove the convergence and tracking performance of the proposed MPC-ILC strategy. The simulation results show the effectiveness of the proposed method.

Phase Analysis and Identification Method for Multiphase Batch Processes with Partitioning Multi-way Principal Component Analysis (MPCA) Model

Multi-way principal component analysis (MPCA) is the most widely utilized multivariate statistical process control method for batch processes. Previous research on MPCA has commonly agreed that it is not a suitable method for multiphase batch process analysis. In this paper, abundant phase information is revealed by way of partitioning MPCA model, and a new phase identification method based on global dynamic information is proposed. The application to injection molding shows that it is a feasible and effective method for multiphase batch process knowledge understanding, phase division and process monitoring.

Batch process monitoring based on multilevel ICA-PCA

In this paper, we describe a new batch process monitoring method based on multilevel independent component analysis and principal component analysis (MLICA-PCA). Unlike the conventional multi-way principal component analysis (MPCA) method, MLICA-PCA provides a separated interpretation for multilevel batch process data. Batch process data are partitioned into two levels: the within-batch level and the between-batch level. In each level, the Gaussian and non-Gaussian components of process information can be separately extracted. I2, T2 and SPE statistics are individually built and monitored. The new method facilitates fault diagnosis. Since the two variation levels are decomposed, the variables responsible for faults in each level can be identified and interpreted more easily. A case study of the Dupont benchmark process showed that the proposed method was more efficient and interpretable in fault detection and diagnosis, compared to the alternative batch process monitoring method.

AutoSeqMan:batch assembly of contigs for Sanger sequences

With the wide application of DNA sequencing technology, DNA sequences are still increasingly generated through the Sanger sequencing platform. SeqMan （in the LaserGene package） is an excellent program with an easy-to-use graphical user interface （GUI） employed to assemble Sanger sequences into contigs. However, with increasing data size, larger sample sets and more sequenced loci make contig assemble complicated due to the considerable number of manual operations required to run SeqMan. Here, we present the ＇autoSeqMan＇ software program, which can automatedly assemble contigs using SeqMan scripting language. There are two main modules available, namely, ＇Classification＇ and ＇Assembly＇. Classification first undertakes preprocessing work, whereas Assembly generates a SeqMan script to consecutively assemble contigs for the classified files. Through comparison with manual operation, we showed that autoSeqMan saved substantial time in the preprocessing and assembly of Sanger sequences. We hope this tool will be useful for those with large sample sets to analyze, but with little programming experience. It is freely available at https：//github.com/ Sun-Yanbo/autoSeqMan.

Flow-Shop Scheduling with Transportation Capacity and Time Consideration

Planning and scheduling is one of the most important activity in supply chain operation management.Over the years,there have been multiple researches regarding planning and scheduling which are applied to improve a variety of supply chains.This includes two commonly used methods which are mathematical programming models and heuristics algorithms.Flowshop manufacturing systems are seen normally in industrial environments but few have considered certain constraints such as transportation capacity and transportation time within their supply chain.A two-stage flowshop of a single processing machine and a batch processing machine are considered with their capacity and transportation time between twomachines.The objectives of this research are to build a suitable mathematical model capable of minimizing the maximum completion time,to propose a heuristic optimization algorithm to solve the problem,and to develop an applicable program of the heuristics algorithm.AMixed Integer Programming(MIP)model and a heuristics optimization algorithmwas developed and tested using a randomly generated data set for feasibility.The overall results and performance of each approach was compared between the two methods that would assist the decision maker in choosing a suitable solution for their manufacturing line.