Business process optimization algorithms

Task improving to be DEA efficient and task combing are discussed in this paper. In benchmarking, there are usually multiple excellent practices on how to improve cost to the least? Thus, the lowest cost problem of task is proposed, and the programming model is established. In business process transfer delay usually exists between two tasks. Combing task can diminish the delay, but incur costs through loss of specialization and etc,. The benefit from task combining is closely related with the process structure. The optimal design of task combing is a mixed 0-1 programming. Based on the property that the final result is irrelevant with the order of task combing, the problem is decomposed into a series of critical task combing.