Seru production is one of the latest manufacturing modes arising from Japanese production practice. Seru can achieve efficiency, flexibility, and responsiveness simultaneously. To accommodate the current business environment with volatile demands and fierce competitions, seru has attracted more and more attention both from researchers and practitioners. A new planning management system, just-in-time organization system (JIT-OS), is used to manage and control a seru production system. The JIT-OS contains two decisions: seru formation and seru loading. By seru formation, a seru system with one or multiple appropriate serus is configured; by seru loading, customer ordered products are allocated to serus to implement production plans. In the process of seru formation, workers have to be assigned to serus. In this paper, a seru loading problem with worker assignment is constructed as a bi-level programming model, and the worker assignment on the upper level is to minimize total idle time while the lower level is to minimize the makespan by finding out optimal product allocation. A product lot can be splitted and allocated to different serus. The problem of this paper is shown to be NP-hard. Therefore, a simulated annealing and genetic algorithm (SA-GA) is developed. The SA is for the upper level programming and the GA is for the lower level programming. The practicality and effectiveness of the model and algorithm are verified by two numerical examples, and the results show that the SA-GA algorithm has good scalability.

中文翻译：

---

基于模拟退火和遗传算法的血清生产系统中带有工人分配的双层血清负荷问题的方法

浆液生产是日本生产实践中出现的最新生产模式之一。Seru可以同时实现效率，灵活性和响应能力。为了适应瞬息万变的需求和激烈的竞争，当前的商业环境，seru吸引了越来越多的研究人员和从业人员关注。一种新的计划管理系统，即即时组织系统（JIT-OS），用于管理和控制Seru生产系统。该JIT-OS包含了两个决定：SERU形成和SERU加载。通过SERU形成，一个SERU系统与一个或多个适当serus已配置；通过Seru加载，将客户订购的产品分配到Serus实施生产计划。在过程SERU形成，工人被分配到serus。在本文中，一个SERU装载问题与工人分配构成为双层规划模型，并在上层工人分配是而较低水平是最小化通过找出最佳的产品分配完工时间总闲置时间，以尽量减少。产品批次可以拆分并分配给不同的血清。本文的问题被证明是NP难的。因此，开发了一种模拟退火遗传算法（SA-GA）。SA用于较高级别的编程，而GA用于较低级别的编程。通过两个数值例子验证了该模型和算法的实用性和有效性，结果表明SA-GA算法具有良好的可扩展性。