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 an...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.展开更多
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 co...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.展开更多
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 ...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.展开更多
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...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.展开更多
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 operati...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.展开更多
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,flex...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.展开更多
With the application of various information technologies in smart manufacturing,new intelligent production mode puts forward higher demands for real-time and robustness of production scheduling.For the production sche...With the application of various information technologies in smart manufacturing,new intelligent production mode puts forward higher demands for real-time and robustness of production scheduling.For the production scheduling problem in large-scale manufacturing environment,digital twin(DT)places high demand on data processing capability of the terminals.It requires both global prediction and real-time response abilities.In order to solve the above problem,a DT-based edge-cloud collaborative intelligent production scheduling(DTECCS)system was proposed,and the scheduling model and method were introduced.DT-based edge-cloud collaboration(ECC)can predict the production capacity of each workshop,reassemble customer orders,optimize the allocation of global manufacturing resources in the cloud,and carry out distributed scheduling on the edge-side to improve scheduling and tasks processing efficiency.In the production process,the DTECCS system adjusts scheduling strategies in real-time,responding to changes in production conditions and order fluctuations.Finally,simulation results show the effectiveness of DTECCS system.展开更多
An increasing number of novel and highly specialized computer-aided decision-making technologies for short-term production scheduling in oil refineries has emerged and evolved over the past two decades, thereby encour...An increasing number of novel and highly specialized computer-aided decision-making technologies for short-term production scheduling in oil refineries has emerged and evolved over the past two decades, thereby encouraging refiners to permanently rethink the way the refining business is operated and managed. In this report,we discuss the key lessons learned from one of the pioneering, yet daring, enterprise-wide programs entirely implemented in an energy company devoted to developing and implementing an advanced refinery production scheduling(RPS) technology, i.e., the RPS system of Petrobras. Apart from mathematical and information technology issues, the long-term sustainability of a successful RPS project is, we argue, the outcome of a virtuous cycle grounded on permanent actions devoted to improving technical education inside the organization,reinspecting organizational cultures and operational paradigms, and developing working processes.展开更多
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 s...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.展开更多
Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-de...Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due time.It is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production systems.Two objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the problem.To obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy algorithm.The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers.Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.展开更多
The garment industry in Vietnam is one of the country’s strongest industries in the world.However,the production process still encounters problems regarding scheduling that does not equate to an optimal process.The p...The garment industry in Vietnam is one of the country’s strongest industries in the world.However,the production process still encounters problems regarding scheduling that does not equate to an optimal process.The paper introduces a production scheduling solution that resolves the potential delays and lateness that hinders the production process using integer programming and order allocation with a make-to-order manufacturing viewpoint.A number of constraints were considered in the model and is applied to a real case study of a factory in order to viewhowthe tardiness and latenesswould be affected which resulted in optimizing the scheduling time better.Specifically,the constraints considered were order assignments,production time,and tardiness with an objective function which is to minimize the total cost of delay.The results of the study precisely the overall cost of delay of the orders given to the plant and successfully propose a suitable production schedule that utilizes the most of the plant given.The study has shown promising results that would assist plant and production managers in determining an algorithm that they can apply for their production process.展开更多
A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' pa...A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' parameters are available from the geological database of the mine. The objective is to minimize the deviation of the average ore grade of blasted blocks from the standard ore grade required by the mill. Transportation ability constraint. production quantity demand constraint. minimum safety bench constraint. block size constraint and block, bench precedence constraints are considered in forming the programming model. This model has more practical objective function and reasonable constraints compared with the existing model for this kind of problems.展开更多
Production scheduling involves all activities of building production schedules,including coordinating and assigning activities to each person,group of people,or machine and arranging work orders in each workplace.Prod...Production scheduling involves all activities of building production schedules,including coordinating and assigning activities to each person,group of people,or machine and arranging work orders in each workplace.Production scheduling must solve all problems such as minimizing customer wait time,storage costs,and production time;and effectively using the enterprise’s human resources.This paper studies the application of flexible job shop modelling on scheduling a woven labelling process.The labelling process includes several steps which are handled in different work-stations.Each workstation is also comprised of several identical parallel machines.In this study,job splitting is allowed so that the power of work stations can be utilized better.The final objective is to minimize the total completion time of all jobs.The results show a significant improvement since the new planning may save more than 60%of lead time compared to the current schedule.The contribution of this research is to propose a flexible job shop model for scheduling a woven labelling process.The proposed approach can also be applied to support complex production scheduling processes under fuzzy environments in different industries.A practical case study demonstrates the effectiveness of the proposed model.展开更多
In this paper,a steelmaking and continuous-casting production scheduling model is established according to the practical background of the Shou Gang-Qian Gang steel enterprise and then an algorithm is designed to solv...In this paper,a steelmaking and continuous-casting production scheduling model is established according to the practical background of the Shou Gang-Qian Gang steel enterprise and then an algorithm is designed to solve it.A steelmaking and continuous casting production scheduling system is developed based on the optimization model and algorithm.This system combines the optimization model,algorithm and human experience together.By using the human-machine interaction functions,the operator can modify this scheduling with his experience in the form of GANTT graph to get a schedule with high quality.展开更多
In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We no...In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained.展开更多
The traditional production planning and scheduling problems consider performance indicators like time, cost and quality as optimization objectives in manufacturing processes. However, environmentally-friendly factors ...The traditional production planning and scheduling problems consider performance indicators like time, cost and quality as optimization objectives in manufacturing processes. However, environmentally-friendly factors like energy consumption of production have not been completely taken into consideration. Against this background, this paper addresses an approach to modify a given schedule generated by a production plarming and scheduling system in a job shop floor, where machine tools can work at different cutting speeds. It can adjust the cutting speeds of the operations while keeping the original assignment and processing sequence of operations of each job fixed in order to obtain energy savings. First, the proposed approach, based on a mixed integer programming mathematical model, changes the total idle time of the given schedule to minimize energy consumption in the job shop floor while accepting the optimal solution of the scheduling objective, makespan. Then, a genetic-simulated annealing algorithm is used to explore the optimal solution due to the fact that the problem is strongly NP-hard. Finally, the effectiveness of the approach is performed small- and large-size instances, respectively. The experimental results show that the approach can save 5%-10% of the average energy consumption while accepting the optimal solution of the makespan in small-size instances. In addition, the average maximum energy saving ratio can reach to 13%. And it can save approximately 1%-4% of the average energy consumption and approximately 2.4% of the average maximum energy while accepting the near-optimal solution of the makespan in large-size instances. The proposed research provides an interesting point to explore an energy-aware schedule optimization for a traditional production planning and scheduling problem.展开更多
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 thos...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.展开更多
Against the realistic background of excess production capacity, product structure imbalance, and high material and energy consumption in steel enterprises, the implementation of operation optimization for the steel ma...Against the realistic background of excess production capacity, product structure imbalance, and high material and energy consumption in steel enterprises, the implementation of operation optimization for the steel manufacturing process is essential to reduce the production cost, increase the production or energy efficiency, and improve production management. In this study, the operation optimization problem of the steel manufacturing process, which needed to go through a complex production organization from customers' orders to workshop production, was analyzed. The existing research on the operation optimization techniques, including process simulation, production planning, production scheduling, interface scheduling, and scheduling of auxiliary equipment, was reviewed. The literature review reveals that, although considerable research has been conducted to optimize the operation of steel production, these techniques are usually independent and unsystematic.Therefore, the future work related to operation optimization of the steel manufacturing process based on the integration of multi technologies and the intersection of multi disciplines were summarized.展开更多
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 o...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.展开更多
A cooperative game theoretical approach is taken to production and transportation coordinated scheduling problems of two-machine flow-shop(TFS-PTCS problems)with an interstage transporter.The authors assume that there...A cooperative game theoretical approach is taken to production and transportation coordinated scheduling problems of two-machine flow-shop(TFS-PTCS problems)with an interstage transporter.The authors assume that there is an initial scheduling order for processing jobs on the machines.The cooperative sequencing game models associated with TFS-PTCS problems are established with jobs as players and the maximal cost savings of a coalition as its value.The properties of cooperative games under two different types of admissible rearrangements are analysed.For TFS-PTCS problems with identical processing time,it is proved that,the corresponding games areσ_(0)-component additive and convex under one admissible rearrangement.The Shapley value gives a core allocation,and is provided in a computable form.Under the other admissible rearrangement,the games neither need to beσ_(0)-component additive nor convex,and an allocation rule of modified Shapley value is designed.The properties of the cooperative games are analysed by a counterexample for general problems.展开更多
基金Sponsored by the National Natural Science Foundation of China(Grant Nos.72061022 and 72171037).
文摘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.
文摘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.
基金supported by Fundamental Research Funds for the Central Universities (No. N090403005)
文摘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.
基金Key Project of Shandong Provincial Natural Science Foundation,China(No.ZR2010FZ001)National High-Tech Research and Development Program of China(863 Program)(No.2007AA04Z157)
文摘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.
基金This work was supported by the National Natural Science Foundation of China(Grant No.59990470) the Outstanding Youth Foundation of China(Grant No.59725514)
文摘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.
文摘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.
基金supported by the 2020 Industrial Internet Innovation Development Project of Ministry of Industry and Information Technology of P.R.Chinathe State Grid Liaoning Electric Power Supply Co.,Ltd.,Comprehensive Security Defense Platform Project for Industrial/Enterprise Networks。
文摘With the application of various information technologies in smart manufacturing,new intelligent production mode puts forward higher demands for real-time and robustness of production scheduling.For the production scheduling problem in large-scale manufacturing environment,digital twin(DT)places high demand on data processing capability of the terminals.It requires both global prediction and real-time response abilities.In order to solve the above problem,a DT-based edge-cloud collaborative intelligent production scheduling(DTECCS)system was proposed,and the scheduling model and method were introduced.DT-based edge-cloud collaboration(ECC)can predict the production capacity of each workshop,reassemble customer orders,optimize the allocation of global manufacturing resources in the cloud,and carry out distributed scheduling on the edge-side to improve scheduling and tasks processing efficiency.In the production process,the DTECCS system adjusts scheduling strategies in real-time,responding to changes in production conditions and order fluctuations.Finally,simulation results show the effectiveness of DTECCS system.
文摘An increasing number of novel and highly specialized computer-aided decision-making technologies for short-term production scheduling in oil refineries has emerged and evolved over the past two decades, thereby encouraging refiners to permanently rethink the way the refining business is operated and managed. In this report,we discuss the key lessons learned from one of the pioneering, yet daring, enterprise-wide programs entirely implemented in an energy company devoted to developing and implementing an advanced refinery production scheduling(RPS) technology, i.e., the RPS system of Petrobras. Apart from mathematical and information technology issues, the long-term sustainability of a successful RPS project is, we argue, the outcome of a virtuous cycle grounded on permanent actions devoted to improving technical education inside the organization,reinspecting organizational cultures and operational paradigms, and developing working processes.
基金This project is supported by Key Science-Technology Project of Shanghai City Tenth Five-Year-Plan, China (No.031111002)Specialized Research Fund for the Doctoral Program of Higher Education, China (No.20040247033)Municipal Key Basic Research Program of Shanghai, China (No.05JC14060)
文摘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.
基金This work was supported by the China Scholarship Council Scholarship,the National Key Research and Development Program of China(2017YFB0306400)the National Natural Science Foundation of China(62073069)the Deanship of Scientific Research(DSR)at King Abdulaziz University(RG-48-135-40).
文摘Group scheduling problems have attracted much attention owing to their many practical applications.This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time,release time,and due time.It is originated from an important industrial process,i.e.,wire rod and bar rolling process in steel production systems.Two objective functions,i.e.,the number of late jobs and total setup time,are minimized.A mixed integer linear program is established to describe the problem.To obtain its Pareto solutions,we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods,i.e.,an insertion-based local search and an iterated greedy algorithm.The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers.Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.
文摘The garment industry in Vietnam is one of the country’s strongest industries in the world.However,the production process still encounters problems regarding scheduling that does not equate to an optimal process.The paper introduces a production scheduling solution that resolves the potential delays and lateness that hinders the production process using integer programming and order allocation with a make-to-order manufacturing viewpoint.A number of constraints were considered in the model and is applied to a real case study of a factory in order to viewhowthe tardiness and latenesswould be affected which resulted in optimizing the scheduling time better.Specifically,the constraints considered were order assignments,production time,and tardiness with an objective function which is to minimize the total cost of delay.The results of the study precisely the overall cost of delay of the orders given to the plant and successfully propose a suitable production schedule that utilizes the most of the plant given.The study has shown promising results that would assist plant and production managers in determining an algorithm that they can apply for their production process.
文摘A quadratic programming model is established to choose the blocks to be blasted in a given period. The length of this period depends on the production planning requirements. During the given period, the blocks' parameters are available from the geological database of the mine. The objective is to minimize the deviation of the average ore grade of blasted blocks from the standard ore grade required by the mill. Transportation ability constraint. production quantity demand constraint. minimum safety bench constraint. block size constraint and block, bench precedence constraints are considered in forming the programming model. This model has more practical objective function and reasonable constraints compared with the existing model for this kind of problems.
基金This research was partly supported by the National Kaohsiung University of Science and Technology,and MOST 109-2622-E-992-026 from the Ministry of Sciences and Technology in Taiwan。
文摘Production scheduling involves all activities of building production schedules,including coordinating and assigning activities to each person,group of people,or machine and arranging work orders in each workplace.Production scheduling must solve all problems such as minimizing customer wait time,storage costs,and production time;and effectively using the enterprise’s human resources.This paper studies the application of flexible job shop modelling on scheduling a woven labelling process.The labelling process includes several steps which are handled in different work-stations.Each workstation is also comprised of several identical parallel machines.In this study,job splitting is allowed so that the power of work stations can be utilized better.The final objective is to minimize the total completion time of all jobs.The results show a significant improvement since the new planning may save more than 60%of lead time compared to the current schedule.The contribution of this research is to propose a flexible job shop model for scheduling a woven labelling process.The proposed approach can also be applied to support complex production scheduling processes under fuzzy environments in different industries.A practical case study demonstrates the effectiveness of the proposed model.
文摘In this paper,a steelmaking and continuous-casting production scheduling model is established according to the practical background of the Shou Gang-Qian Gang steel enterprise and then an algorithm is designed to solve it.A steelmaking and continuous casting production scheduling system is developed based on the optimization model and algorithm.This system combines the optimization model,algorithm and human experience together.By using the human-machine interaction functions,the operator can modify this scheduling with his experience in the form of GANTT graph to get a schedule with high quality.
文摘In this study, we consider the problem of scheduling a set of jobs with sequence-dependent setup times on a set of parallel production cells. The objective of this study is to minimize the total completion time. We note that total customer demands for each type should be satisfied, and total required production time in each cell cannot exceed the capacity of the cell. This problem is formulated as an integer programming model and an interface is designed to provide integrity between data and software. Mathematical model is tested by both randomly generated data set and real-world data set from a factory that produce automotive components. As a result of this study, the solution which gives the best alternative production schedule is obtained.
基金Supported by a Marie Curie International Research Staff Exchange Scheme Fellowship within the 7th European Community Framework Program(Grant No.294931)National Science Foundation of China(Grant No.51175262)+1 种基金Jiangsu Provincial Science Foundation for Excellent Youths of China(Grant No.BK2012032)Jiangsu Provincial Industry-Academy-Research Grant of China(Grant No.BY201220116)
文摘The traditional production planning and scheduling problems consider performance indicators like time, cost and quality as optimization objectives in manufacturing processes. However, environmentally-friendly factors like energy consumption of production have not been completely taken into consideration. Against this background, this paper addresses an approach to modify a given schedule generated by a production plarming and scheduling system in a job shop floor, where machine tools can work at different cutting speeds. It can adjust the cutting speeds of the operations while keeping the original assignment and processing sequence of operations of each job fixed in order to obtain energy savings. First, the proposed approach, based on a mixed integer programming mathematical model, changes the total idle time of the given schedule to minimize energy consumption in the job shop floor while accepting the optimal solution of the scheduling objective, makespan. Then, a genetic-simulated annealing algorithm is used to explore the optimal solution due to the fact that the problem is strongly NP-hard. Finally, the effectiveness of the approach is performed small- and large-size instances, respectively. The experimental results show that the approach can save 5%-10% of the average energy consumption while accepting the optimal solution of the makespan in small-size instances. In addition, the average maximum energy saving ratio can reach to 13%. And it can save approximately 1%-4% of the average energy consumption and approximately 2.4% of the average maximum energy while accepting the near-optimal solution of the makespan in large-size instances. The proposed research provides an interesting point to explore an energy-aware schedule optimization for a traditional production planning and scheduling problem.
基金This project is supported by National Natural Science Foundation of China (No.70372062, No.70572044)Program for New Century Excellent Talents in University of China (No.NCET-04-0240).
文摘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.
基金financially supported by the National Natural Science Foundation of China (No.51734004)the National Key Research and Development Program of China (No.2017YFB0304005)the National Natural Science Foundation of China (No.51474044)。
文摘Against the realistic background of excess production capacity, product structure imbalance, and high material and energy consumption in steel enterprises, the implementation of operation optimization for the steel manufacturing process is essential to reduce the production cost, increase the production or energy efficiency, and improve production management. In this study, the operation optimization problem of the steel manufacturing process, which needed to go through a complex production organization from customers' orders to workshop production, was analyzed. The existing research on the operation optimization techniques, including process simulation, production planning, production scheduling, interface scheduling, and scheduling of auxiliary equipment, was reviewed. The literature review reveals that, although considerable research has been conducted to optimize the operation of steel production, these techniques are usually independent and unsystematic.Therefore, the future work related to operation optimization of the steel manufacturing process based on the integration of multi technologies and the intersection of multi disciplines were summarized.
文摘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.
基金supported in part by the Liaoning Province Xingliao Talents Plan Project under Grant No.XLYC2006017in part by the Scientific Research Funds Project of Educational Department of Liaoning Province under Grant Nos.LG202025 and LJKZ0260。
文摘A cooperative game theoretical approach is taken to production and transportation coordinated scheduling problems of two-machine flow-shop(TFS-PTCS problems)with an interstage transporter.The authors assume that there is an initial scheduling order for processing jobs on the machines.The cooperative sequencing game models associated with TFS-PTCS problems are established with jobs as players and the maximal cost savings of a coalition as its value.The properties of cooperative games under two different types of admissible rearrangements are analysed.For TFS-PTCS problems with identical processing time,it is proved that,the corresponding games areσ_(0)-component additive and convex under one admissible rearrangement.The Shapley value gives a core allocation,and is provided in a computable form.Under the other admissible rearrangement,the games neither need to beσ_(0)-component additive nor convex,and an allocation rule of modified Shapley value is designed.The properties of the cooperative games are analysed by a counterexample for general problems.