Joint Optimization of Imperfect Preventive Maintenance and Production Scheduling for Single Machine Based on Game Theory Method

In this study,an optimization model of a single machine system integrating imperfect preventive maintenance planning and production scheduling based on game theory is proposed.The costs of the production department and the maintenance department are minimized,respectively.Two kinds of three-stage dynamic game models and a backward induction method are proposed to determine the preventive maintenance(PM)threshold.A lemma is presented to obtain the exact solution.A comprehensive numerical study is provided to illustrate the proposed maintenance model.The effectiveness is also validated by comparison with other two existed optimization models.

A multi-step approach for block-cave production scheduling optimization

Production schedules that provide optimal operating strategies while meeting practical,technical,and environmental constraints are an inseparable part of mining operations.Relying only on manual planning methods or computer software based on heuristic algorithms will lead to mine schedules that are not the optimal global solution.Mathematical mine planning models have been proved to be very effective in supporting decisions on sequencing the extraction of material in mines.The objective of this paper is to develop a practical optimization framework for caving operations’production scheduling.To overcome the size problem of mathematical programming models and to generate a robust practical near-optimal schedule,a multi-step method for long-term production scheduling of block caving is presented.A mixed-integer linear programming(MILP)formulation is used for each step.The formulations are developed,implemented,and verifed in the TOMLAB/CPLEX environment.The production scheduler aims to maximize the net present value of the mining operation while the mine planner has control over defned constraints.Application and comparison of the models for production scheduling using 298 drawpoints over 15 periods are presented.

An improved cross entropy algorithm for steelmaking-continuous casting production scheduling with complicated technological routes

In order to increase productivity and reduce energy consumption of steelmaking-continuous casting(SCC) production process, especially with complicated technological routes, the cross entropy(CE) method was adopted to optimize the SCC production scheduling(SCCPS) problem. Based on the CE method, a matrix encoding scheme was proposed and a backward decoding method was used to generate a reasonable schedule. To describe the distribution of the solution space, a probability distribution model was built and used to generate individuals. In addition, the probability updating mechanism of the probability distribution model was proposed which helps to find the optimal individual gradually. Because of the poor stability and premature convergence of the standard cross entropy(SCE) algorithm, the improved cross entropy(ICE) algorithm was proposed with the following improvements: individual generation mechanism combined with heuristic rules, retention mechanism of the optimal individual, local search mechanism and dynamic parameters of the algorithm. Simulation experiments validate that the CE method is effective in solving the SCCPS problem with complicated technological routes and the ICE algorithm proposed has superior performance to the SCE algorithm and the genetic algorithm(GA).

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.

Stochastic optimization of mine production scheduling with uncertain ore/metal/waste supply

Optimization of long-term mine production scheduling in open pit mines deals with the management of cash flows, typically in the order of hundreds of millions of dollars. Conventional mine scheduling utilizes optimization methods that are not capable of accounting for inherent technical uncertainties such as uncertainty in the expected ore/metal supply from the underground, acknowledged to be the most critical factor. To integrate ore/metal uncertainty into the optimization of mine production scheduling a stochastic integer programming(SIP) formulation is tested at a copper deposit. The stochastic solution maximizes the economic value of a project and minimizes deviations from production targets in the presence of ore/metal uncertainty. Unlike the conventional approach, the SIP model accounts and manages risk in ore supply, leading to a mine production schedule with a 29% higher net present value than the schedule obtained from the conventional, industry-standard optimization approach, thus contributing to improving the management and sustainable utilization of mineral resources.

Improvement of Lagrangian relaxation performance for open pit mines constrained long-term production scheduling problem

Constrained long-term production scheduling problem(CLTPSP) of open pit mines has been extensively studied in the past few decades due to its wide application in mining projects and the computational challenges it poses become an NP-hard problem.This problem has major practical significance because the effectiveness of the schedules obtained has strong economical impact for any mining project.Despite of the rapid theoretical and technical advances in this field,heuristics is still the only viable approach for large scale industrial applications.This work presents an approach combining genetic algorithms(GAs) and Lagrangian relaxation(LR) to optimally determine the CLTPSP of open pit mines.GAs are stochastic,parallel search algorithms based on the natural selection and the process of evolution.LR method is known for handling large-scale separable problems; however,the convergence to the optimal solution can be slow.The proposed Lagrangian relaxation and genetic algorithms(LR-GAs) combines genetic algorithms into Lagrangian relaxation method to update the Lagrangian multipliers.This approach leads to improve the performance of Lagrangian relaxation method in solving CLTPSP.Numerical results demonstrate that the LR method using GAs to improve its performance speeding up the convergence.Subsequently,highly near-optimal solution to the CLTPSP can be achieved by the LR-GAs.

Integration of real options into short-term mine planning and production scheduling

Commodity prices have fallen sharply due to the global financial crisis. This has adversely affected the viability of some mining projects, including leading to the possibility of bankruptcy for some companies. These price falls reflect uncertainties and risks associated with mining projects. In recent years, much work has been published related to the application of real options pricing theory to value life-of-mine plans in response to long term financial uncertainty and risk. However, there are uncertainties and risks associated with medium/short-term mining operations. Real options theory can also be applied to tactical decisions involving uncertainties and risks. This paper will investigate the application of real options in the mining industry and present a methodology developed at University of Queensland, Australia, for integrating real options into medium/short-term mine planning and production scheduling. A case study will demonstrate the validity and usefulness of the methodology and techniques developed.

Scheduling problem for hot-rolling seamless steel tube production

Taking the seamless tube plant of Baoshan Iron & Steel Complex in China as the background,we analyze the characters of hot rolling seamless steel tube:multi varieties,low volume,complicated production process,flexible production routes.Then integrated scheduling problem for hot rolling seamless steel tube production is studied,which covers two key points;order-grouping problem and solution method for flowshop/jobshop scheduling problem.On the basis of these two problems,integrated scheduling decision system is developed.The design idea,function flow sheet,data processing method,and functional module of visualized human-computer interactive scheduling system implemented in seamless steel tube plant of Shanghai Baoshan Iron & Steel Complex are described into detail.Compared with manual system,the performance of system shows the applicability and superiority in several criteria.

Modeling and optimization for oil well production scheduling

In this paper,an oil well production scheduling problem for the light load oil well during petroleum field exploitation was studied.The oil well production scheduling was to determine the turn on/off status and oil flow rates of the wells in a given oil reservoir,subject to a number of constraints such as minimum up/down time limits and well grouping.The problem was formulated as a mixed integer nonlinear programming model that minimized the total production operating cost and start-up cost.Due to the NP-hardness of the problem,an improved particle swarm optimization(PSO) algorithm with a new velocity updating formula was developed to solve the problem approximately.Computational experiments on randomly generated instances were carried out to evaluate the performance of the model and the algorithm's effectiveness.Compared with the commercial solver CPLEX,the improved PSO can obtain high-quality schedules within a much shorter running time for all the instances.

Production Scheduling and Distribution in Downstream Sector Using Block-Structured Linear Programming Solution Technique ： A Comparative Analysis

The aim of this paper is to compare block-structured linear programming （LP） models against other practical optimization methods for solving downstream product refinery problems using a solution method different from the existing ones （like mixed integer linear programming （MILP） method）. The work X-rays the Nigerian petroleum refining industries and their channel of distribution in the local setting and identifies the critical features of scheduling and allocation of refined crude products; either for distribution within the country or for exportation to the international market. Applying our model to the distribution model, the computational results reveal a better route with lowest transportation cost for the scheduling problem and the best optimal blend with higher revenue for the production problem.

RECONFIGURABLE PRODUCTION LINE MODELING AND SCHEDULING USING PETRI NETS AND GENETIC ALGORITHM

In response to the production capacity and functionality variations, a genetic algorithm （GA） embedded with deterministic timed Petri nets（DTPN） for reconfigurable production line（RPL） is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity.

Genetic algorithm for short-term scheduling of make-and-pack batch production process

This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time.

ANALYSIS AND IMPROVEMENT OF LEAD TIME FOR JOB SHOP UNDER MIXED PRODUCTION SYSTEM

Firstly an overview of the potential impact on work-in-process （WIP） and lead time is provided when transfer lot sizes are undifferentiated from processing lot sizes. Simple performance examples are compared to those from a shop with one-piece transfer lots. Next, a mathematical programming model for minimizing lead time in the mixed-model job shop is presented, in which one-piece transfer lots are used. Key factors affecting lead time are found by analyzing the sum of the longest setup time of individual items among the shared processes （SLST） and the longest processing time of individual items among processes （LPT）. And lead time can be minimized by cutting down the SLST and LPT. Reduction of the SLST is described as a traveling salesman problem （TSP）, and the minimum of the SLST is solved through job shop scheduling. Removing the bottleneck and leveling the production line optimize the LPT. If the number of items produced is small, the routings are relatively short, and items and facilities are changed infrequently, the optimal schedule will remain valid. Finally a brief example serves to illustrate the method.

Improving performance of open-pit mine production scheduling problem under grade uncertainty by hybrid algorithms

One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term production scheduling(LTPS)of the open-pit mines.Deterministic and uncertainty-based approaches are identified as the main strategies,which have been widely used to cope with this problem.Within the last few years,many researchers have highly considered a new computational type,which is less costly,i.e.,meta-heuristic methods,so as to solve the mine design and production scheduling problem.Although the optimality of the final solution cannot be guaranteed,they are able to produce sufficiently good solutions with relatively less computational costs.In the present paper,two hybrid models between augmented Lagrangian relaxation(ALR)and a particle swarm optimization(PSO)and ALR and bat algorithm(BA)are suggested so that the LTPS problem is solved under the condition of grade uncertainty.It is suggested to carry out the ALR method on the LTPS problem to improve its performance and accelerate the convergence.Moreover,the Lagrangian coefficients are updated by using PSO and BA.The presented models have been compared with the outcomes of the ALR-genetic algorithm,the ALR-traditional sub-gradient method,and the conventional method without using the Lagrangian approach.The results indicated that the ALR is considered a more efficient approach which can solve a large-scale problem and make a valid solution.Hence,it is more effectual than the conventional method.Furthermore,the time and cost of computation are diminished by the proposed hybrid strategies.The CPU time using the ALR-BA method is about 7.4%higher than the ALR-PSO approach.

Modeling of Agile Intelligent Manufacturing-oriented Production Scheduling System

Agile intelligent manufacturing is one of the new manufacturing paradigms that adapt to the fierce globalizing market competition and meet the survival needs of the enterprises, in which the management and control of the production system have surpassed the scope of individual enterprise and embodied some new features including complexity, dynamicity, distributivity, and compatibility. The agile intelligent manufacturing paradigm calls for a production scheduling system that can support the cooperation among various production sectors, the distribution of various resources to achieve rational organization, scheduling and management of production activities. This paper uses multi-agents technology to build an agile intelligent manufacturing-oriented production scheduling system. Using the hybrid modeling method, the resources and functions of production system are encapsulated, and the agent-based production system model is established. A production scheduling-oriented multi-agents architecture is constructed and a multi-agents reference model is given in this paper.

Improved Cross Entropy Algorithm for Steelmaking Continuous Casting Production Scheduling with Minimum Power Consumption

A matrix encoding scheme for the steelmaking continuous casting( SCC) production scheduling( SCCPS) problem and the corresponding decoding method are proposed. Based on it,a cross entropy( CE) method is adopted and an improved cross entropy( ICE) algorithm is proposed to solve the SCCPS problem to minimize total power consumption. To describe the distribution of the solution space of the CE method,a probability model is built and used to generate individuals by sampling and a probability updating mechanism is introduced to trace the promising samples. For the ICE algorithm,some samples are generated by the heuristic rules for the shortest makespan due to the relation between the makespan and the total power consumption,which can reduce the search space greatly. The optimal sample in each iteration is retained through a retention mechanism to ensure that the historical optimal sample is not lost so as to improve the efficiency and global convergence. A local search procedure is carried out on a part of better samples so as to improve the local exploitation capability of the ICE algorithm and get a better result. The parameter setting is investigated by the Taguchi method of design-of-experiment. A number of simulation experiments are implemented to validate the effectiveness of the ICE algorithm in solving the SCCPS problem and also the superiority of the ICE algorithm is verified through the comparison with the standard cross entropy( SCE) algorithm.

Evaluation of Operation Flexibility and Operation Selection in Multi-agent Based Production Scheduling

Based on the concept of operation flexibility, we study the relationship among multiple operation sequences and provide a flexibility measure for operation sequences. A criterion is proposed to prioritize each operation (rather than sequence). Under the multi-agent architecture the criterion can be used to guide the decision-making procedure during production scheduling so that there is an adequate flexibility at each decision point. Experimental results demonstrate the efficiency of the criterion when it is used as a scheduling heuristic. It can increase flexibility of manufacturing systems, and consequently improve the performance of the systems.

China Scheduled to Accredit its Own Innovative Products from 2007

China will begin accrediting its own innovative products from this year. It plans to complete the Catalog of China's Independent Innovation Products by 2007 for future reference of government procurement. The products in the catalog shall enjoy preferential policies. According to the Ministry of Science and Technology of the People's Republic of China, the accreditations shall be made based on Measures for the Administration of the Accreditation of National Independent Innovation Products (for Trial Implementation), which was jointly launched on December 31, 2006, by the Ministry of Science and Technology, the National Development and Reform Commission (NDRC), and the Ministry of Finance of the People's Republic of China.

A STEP Based Integrated System for Assembly Planning and Design

An integrated system for assembly planning and design (INSAPS) is presented in which product data can be exchanged between assembly planning and assembly design on the basis of standard for exchange of product data model (STEP). The system consists of CAD system, product modeling system, assembly planning system. The product model is organized according to the STEP, uses mostly the entities of IR (integrated resources) and partly self defined entities which is necessary for assembly planning. A simple method of assembly sequence generation is presented which is suitable for complex assembly planning. The generated assembly sequences are evaluated considering the optimization of total assembly time. The results of assembly planning are feedback to the stage of assembly design to improve design.

A maintenance driven scheduling cockpit for integrated production and maintenance operation schedule

The production and maintenance functions have objectives that are often in contrast and it is essential for management to ensure that their activities are carried out synergistically,to ensure the maximum efficiency of the production plant as well as the minimization of management costs.The current evolution of ICT technologies and maintenance strategies in the industrial field is making possible a greater integration between production and maintenance.This work addresses this challenge by combining theknowledge of the data collected from physical assets for predictive maintenance management with the possibility of dynamic simulate the future behaviour of the manufacturing system through a digital twin for optimal management of maintenance interventions.The paper,indeed,presents a supporting digital cockpit for production and maintenance integrated scheduling.Thetool proposes an innovative approach to manage health data from machines being in any production system and provides support to compare the information about their remaining useful life(RUL)with the respective production schedule.The maintenancedriven schedulingcockpit(MDSC)offers,indeed,a supporting decision tool for the maintenance strategy to be implemented that can help production and maintenance managers in the optimal scheduling of preventive maintenance interventions based on RUL estimation.The simulation is performed by varying the production schedule with the maintenance tasks involvement;opportune decisions are taken evaluating the total costs related to the simulated strategy and the impact on the production schedule.