.png){kind=icon}
.png){kind=icon}
Return
A nested partitioning-based solution method for seru scheduling problem with resource allocation
.png){kind=icon}
OA
AI
DOI：10.1016/j.jmse.2023.11.003.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates the production scheduling problems of allocating resources and sequencing jobs in the seru production system (SPS). As a new-type manufacturing mode arising from Japanese production practices, seru production can achieve efficiency, flexibility, and responsiveness simultaneously. The production environment in which a set of jobs must be scheduled over a set of serus according to due date and different execution modes is considered, and a combination optimization model is provided. Motivated by the problem complexity and the characteristics of the proposed seru scheduling model, a nested partitioning method (NPM) is designed as the solution approach. Finally, computational studies are conducted, and the practicability of the proposed seru scheduling model is proven. Moreover, the efficiency of the nested partitioning solution method is demonstrated by the computational results obtained from different scenarios, and the good scalability of the proposed approach is proven via comparative analysis. (c) 2024 China Science Publishing & Media Ltd. Publishing Services by Elsevier B.V. on behalf of KeAi Communications Co. Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords:
Seru production system
Scheduling
Combination optimization model
Nested partitioning method
Resource allocation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
212
Citations:
680