Study On A Hybrid Flow-Shop Scheduling Problem About Company A

With the development of liquid daily necessities market,the liquid daily necessities manufacturer are also increasingly competitive,in order to compete the market and increase competitiveness,some larger-scale manufacturers enhance production efficiency in various ways,one of which optimizing the production scheduling system is also an important part,because of the effective production scheduling program that can reduce production costs and improve production efficiency.At present,the production process of liquid daily necessities includes mainly two stages of mixing and filling.However,there are generally multiple parallel boilers and filling lines in large-scale production plant(which may not be related to parallel machines),the problem belongs to two-stage hybrid flow shop scheduling problem(HFSP)in production scheduling,also belongs to NP-hard problem.In this paper,the problem was analyzed in detail which liquid daily necessities scheduling actual process about company A.Due to the processing time of company A is inconsistent in various stages,the same machine has different processing times for different tasks,the problem belongs to two-stage hybrid flow shop scheduling problem with unrelated parallel machines.First of all,the paper discusses the background of the research questions and comes up with the purpose and significance of the thesis research.Secondly,combing the related theory of flow shop scheduling.Then,on the basis of some basic assumptions(there is no restriction on the buffer zone and the product production priority is not considered),a mathematical model of mixed integer programming model for two-phase hybrid flow shop scheduling problem is established,solving the model mainly,which is mainly using artificial bee colony algorithm(ABC),since the artificial bee colony algorithm is proposed to solve the continuous problem,the scheduling problem studied in this paper is the discrete problem,we propose a discrete artificial bee colony algorithm(DABC).The artificial bee colony algorithm mainly includes two parts: food source and bee colony.The food source is divided into the initial food source and the best food source;hive divided into employed bees,onlooker bees,scout bees.In algorithm design,we mainly consider how to generate the initial population and how to search the neighborhood.The distribution of tasks and assigned task sort on the machine are considered in the generation of the initial population.We use random rules and global time minimization rules about the distribution of tasks.And we use a random rule and the minimum number of switching rules about the task of sorting,these rules are considered from the actual production.About the neighborhood search method,we mainly use of the same machine production tasks and different machine production tasks exchange position.This paper summarizes the concrete method of DABC algorithm to solve the actual production problem of A company,and further analyzes the performance of DABC algorithm.Finally,the DABC algorithm is used to solve the problem according to the production data of A company,and the validity of the result is compared and analyzed.