Treffer: A bi-level nested heuristic algorithm for divisional seru order acceptance and scheduling problems.

This paper focuses on the order acceptance and scheduling problem with worker–operation assignment considering the precedence constraint in the divisional seru production system, which is a new production type derived from Japan and can achieve responsiveness, flexibility, and efficiency simultaneously. With limited production capacity and workers with different skill sets and skill levels, the problem considered in this paper includes three sub-problems: (i) assigning workers to each seru , (ii) making the order acceptance and scheduling plan, and (iii) allocating workers to operations for each order. Subsequently, a nonlinear integer programming model is established for improving the total net revenue, and a bi-level nested heuristic algorithm is designed due to its intractable computation. Computational experiments are made finally, and results show that the objective value obtained by the bi-level nested heuristic algorithm is 3% better than the bi-level genetic algorithm, and the running time is shortened by 99.23%. That is, the proposed bi-level nested heuristic algorithm can achieve better results and higher efficiency for divisional seru order acceptance and scheduling problems. • A new production system, seru , is introduced and the divisional seru order acceptance and scheduling problem is studied. • The integer programming model for the studied problem is presented, and a bi-level nested heuristic algorithm is designed. • The experimental results indicate that the proposed solution methodology is effective and robust. [ABSTRACT FROM AUTHOR]