Study On The Problems And Methods Of Order Selection In Process Production Enterprises

Along with our country economic growth gradually subsides, the enterprises competition in the market is becoming more intensified. Each customer demand for product service level is also increasing day by day. In order to achieve the balanced development of the service and performance, the production enterprises pay more and more attention to capacity planning. Especially for the flow shop enterprises, the key factors of the capacity planning is order selection. The order is the key to corporate profits, but not the more the better. If order quantity is more than business capacity, it will bring negative tiredness. Therefore, how to choose the order and what order to choose are the key issues in the enterprise management. In production, order selection and sorting influence each other. Order selection influences the outcome of sorting. In turn, order sorting affect the the pros and cons of selection. The traditional order selection problems separate production sorting and order selection. The pros and cons of selecting rely on the result of sorting. To a certain extent, it reduces the corporate earnings.This paper studies the relationship between production scheduling and order selection on the flow shop enterprises. Based on the classic order selection model of Slotnick, we put forward a nonlinear programming model with the goal of the total profit maximization, considering the order sorting and selection. The model introduces a 0-1 variable. It reveals that the order selection and scheduling problems will exist at the same time. If not to choose a certain order, the order scheduling problem will not have significance.The model is solved by using Lingo software. On the one hand, we verify the feasibility of the model. On the other hand, with the enlargement of orders scale, computation of the model will increase exponentially. The article analyzes the computation. Finally, the results show that we can get the model of the optimal solution in an acceptable period of time when the number of the orders is not more than 12. For the large-scale order selection problem, we still need to put forward a more efficient algorithm to solve the nonlinear 0-1 programming problem.