Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a numb...Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony （DABC） algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop.展开更多
An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to...An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme,three kinds of neighborhoods are developed for generating new solutions. To well balance the exploitation and exploration,two main search procedures are designed within the evolutionary search framework of the iFOA,including the neighborhood-based search( smell-vision-based search) and the global cooperation-based search. Finally,numerical testing results are provided,and the comparisons demonstrate the effectiveness of the proposed iFOA for solving the LSFSP.展开更多
It is urgent to effectively improve the production efficiency in the running process of manufacturing systems through a new generation of information technology.According to the current growing trend of the internet o...It is urgent to effectively improve the production efficiency in the running process of manufacturing systems through a new generation of information technology.According to the current growing trend of the internet of things(IOT)in the manufacturing industry,aiming at the capacitor manufacturing plant,a multi-level architecture oriented to IOT-based manufacturing environment is established for a flexible flow-shop scheduling system.Next,according to multi-source manufacturing information driven in the manufacturing execution process,a scheduling optimization model based on the lot-streaming strategy is proposed under the framework.An improved distribution estimation algorithm is developed to obtain the optimal solution of the problem by balancing local search and global search.Finally,experiments are carried out and the results verify the feasibility and effectiveness of the proposed approach.展开更多
基金supported by National Natural Science Foundation of China (Grant Nos. 60973085, 61174187)National Hi-tech Research and Development Program of China (863 Program, Grant No. 2009AA044601)New Century Excellent Talents in University of China (Grant No. NCET-08-0232)
文摘Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony （DABC） algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop.
基金National Key Basic Research and Development Program of China(No.2013CB329503)National Natural Science Foundation of China(No.61174189)the Doctoral Program Foundation of Institutions of Higher Education of China(No.20130002110057)
文摘An improved fruit fly optimization algorithm( iFOA) is proposed for solving the lot-streaming flow-shop scheduling problem( LSFSP) with equal-size sub-lots. In the proposed iFOA,a solution is encoded as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme,three kinds of neighborhoods are developed for generating new solutions. To well balance the exploitation and exploration,two main search procedures are designed within the evolutionary search framework of the iFOA,including the neighborhood-based search( smell-vision-based search) and the global cooperation-based search. Finally,numerical testing results are provided,and the comparisons demonstrate the effectiveness of the proposed iFOA for solving the LSFSP.
基金supported by the National Natural Science Foundations of China(No. 51875171)
文摘It is urgent to effectively improve the production efficiency in the running process of manufacturing systems through a new generation of information technology.According to the current growing trend of the internet of things(IOT)in the manufacturing industry,aiming at the capacitor manufacturing plant,a multi-level architecture oriented to IOT-based manufacturing environment is established for a flexible flow-shop scheduling system.Next,according to multi-source manufacturing information driven in the manufacturing execution process,a scheduling optimization model based on the lot-streaming strategy is proposed under the framework.An improved distribution estimation algorithm is developed to obtain the optimal solution of the problem by balancing local search and global search.Finally,experiments are carried out and the results verify the feasibility and effectiveness of the proposed approach.
