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 h...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 discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Se...A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.展开更多
This paper considers an ant colony optimization algorithm based on AND/OR graph for integrated process planning and scheduling(IPPS). Generally, the process planning and scheduling are studied separately. Due to the c...This paper considers an ant colony optimization algorithm based on AND/OR graph for integrated process planning and scheduling(IPPS). Generally, the process planning and scheduling are studied separately. Due to the complexity of manufacturing system, IPPS combining both process planning and scheduling can depict the real situation of a manufacturing system. The IPPS is represented on AND/OR graph consisting of nodes, and undirected and directed arcs. The nodes denote operations of jobs, and undirected/directed arcs denote possible visiting path among the nodes. Ant colony goes through the necessary nodes on the graph from the starting node to the end node to obtain the optimal solution with the objective of minimizing makespan. In order to avoid local convergence and low convergence, some improved strategy is incorporated in the standard ant colony optimization algorithm. Extensive computational experiments are carried out to study the influence of various parameters on the system performance.展开更多
To make full use of the gas resource, stabilize the pipe network pressure, and obtain higher economic benefits in the iron and steel industry, the surplus gas prediction and scheduling models were proposed. Before app...To make full use of the gas resource, stabilize the pipe network pressure, and obtain higher economic benefits in the iron and steel industry, the surplus gas prediction and scheduling models were proposed. Before applying the forecasting techniques, a support vector classifier was first used to classify the data, and then the filtering was used to create separate trend and volatility sequences. After forecasting, the Markov chain transition probability matrix was introduced to adjust the residual. Simulation results using surplus gas data from an iron and steel enterprise demonstrate that the constructed SVC-HP-ENN-LSSVM-MC prediction model prediction is accurate, and that the classification accuracy is high under different conditions. Based on this, the scheduling model was constructed for surplus gas operating, and it has been used to investigate the comprehensive measures for managing the operational probabilistic risk and optimize the economic benefit at various working conditions and implementations. It has extended the concepts of traditional surplus gas dispatching systems, and provides a method for enterprises to determine optimal schedules.展开更多
A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively...A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.展开更多
This paper considers two parallel machine scheduling problems, where the objectives of both problems are to minimize the makespan, and the jobs arrive over time, on two uniform machines with speeds 1 and s （s 〉 1）,...This paper considers two parallel machine scheduling problems, where the objectives of both problems are to minimize the makespan, and the jobs arrive over time, on two uniform machines with speeds 1 and s （s 〉 1）, and on m identical machines, respectively. For the first problem, the authors show that the on-line LPT algorithm has a competitive ratio of （1 ＋ √5）/2 ≈ 1.6180 and the bound is tight. Furthermore, the authors prove that the on-line LPT algorithm has the best possible competitive ratio if s ≥ 1.8020. For the second problem, the authors present a lower bound of （15 - √17）/8 ≈ 1.3596 on the competitive ratio of any deterministic on-line algorithm. This improves a previous result of 1.3473.展开更多
基金Supported by the National Natural Science Foundation of China （20536020, 20876056）.
文摘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.
基金Supported by the National Natural Science Foundation of China (61174040, 61104178)the Fundamental Research Funds for the Central Universities
文摘A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
基金Supported by the Fundamental Research Funds for the Central Universities(13MS100)the Hebei Province Research Foundation of Natural Science(E2011502024)the National Natural Science Foundation of China(51177046)
文摘This paper considers an ant colony optimization algorithm based on AND/OR graph for integrated process planning and scheduling(IPPS). Generally, the process planning and scheduling are studied separately. Due to the complexity of manufacturing system, IPPS combining both process planning and scheduling can depict the real situation of a manufacturing system. The IPPS is represented on AND/OR graph consisting of nodes, and undirected and directed arcs. The nodes denote operations of jobs, and undirected/directed arcs denote possible visiting path among the nodes. Ant colony goes through the necessary nodes on the graph from the starting node to the end node to obtain the optimal solution with the objective of minimizing makespan. In order to avoid local convergence and low convergence, some improved strategy is incorporated in the standard ant colony optimization algorithm. Extensive computational experiments are carried out to study the influence of various parameters on the system performance.
基金Project(51204082)supported by the National Natural Science Foundation of ChinaProject(KKSY201458118)supported by the Talent Cultivation Project of Kuning University of Science and Technology,China
文摘To make full use of the gas resource, stabilize the pipe network pressure, and obtain higher economic benefits in the iron and steel industry, the surplus gas prediction and scheduling models were proposed. Before applying the forecasting techniques, a support vector classifier was first used to classify the data, and then the filtering was used to create separate trend and volatility sequences. After forecasting, the Markov chain transition probability matrix was introduced to adjust the residual. Simulation results using surplus gas data from an iron and steel enterprise demonstrate that the constructed SVC-HP-ENN-LSSVM-MC prediction model prediction is accurate, and that the classification accuracy is high under different conditions. Based on this, the scheduling model was constructed for surplus gas operating, and it has been used to investigate the comprehensive measures for managing the operational probabilistic risk and optimize the economic benefit at various working conditions and implementations. It has extended the concepts of traditional surplus gas dispatching systems, and provides a method for enterprises to determine optimal schedules.
基金Supported by the NSF of Henan Province(082300410070)
文摘A batch is a subset of jobs which must be processed jointly in either serial or parallel form. For the single machine, batching, total completion time scheduling problems, the algorithmic aspects have been extensively studied in the literature. This paper presents the optimal hatching structures of the problems on the batching ways： all jobs in exactly N（arbitrary fix batch number and 1 〈 N 〈 n） batches.
基金supported by the Special Funds of the National Natural Science Foundation of China under Grant No.61340045the Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No.20123705110003Innovation Project of Shangdong Graduate Education under Grant No.SDYC13036
文摘This paper considers two parallel machine scheduling problems, where the objectives of both problems are to minimize the makespan, and the jobs arrive over time, on two uniform machines with speeds 1 and s （s 〉 1）, and on m identical machines, respectively. For the first problem, the authors show that the on-line LPT algorithm has a competitive ratio of （1 ＋ √5）/2 ≈ 1.6180 and the bound is tight. Furthermore, the authors prove that the on-line LPT algorithm has the best possible competitive ratio if s ≥ 1.8020. For the second problem, the authors present a lower bound of （15 - √17）/8 ≈ 1.3596 on the competitive ratio of any deterministic on-line algorithm. This improves a previous result of 1.3473.
