Title: An order scheduling problem in seru production system considering worker assignment

Authors: Yulong Wang; Zhe Zhang; Yong Yin

Addresses: School of Economics and Management, Nanjing University of Science and Technology, Nanjing, China ' School of Economics and Management, Nanjing University of Science and Technology, Nanjing, China ' Graduate School of Business, Doshisha University, Karasuma-Imadegawa, Kamigyo-ku, Kyoto, Japan

Abstract: As one of the latest production modes, seru production, which is arising from Japanese manufacturing practice, has been attracted more and more attention due to its efficiency, flexibility, and quick response ability. In this paper, the scheduling problem with worker assignment in the seru production system is studied where a set of orders must be scheduled over the parallel serus according to the due date. This problem is constructed as a multi-objective model to minimise the total variable cost (TVC) and total idle time (TIT). Then, according to the characteristics of proposed model, the K-means clustering is used to solve the worker assignment and the artificial bee colony (ABC) algorithm is used to solve the order scheduling problem. Finally, the practicality and effectiveness of the proposed model and algorithm are demonstrated by the numerical examples, and the results show that the artificial bee colony algorithm has a good scalability.

Keywords: order scheduling problem; seru; worker assignment; artificial bee colony algorithm; K-means clustering; KMC.

DOI: 10.1504/IJISE.2021.112898

International Journal of Industrial and Systems Engineering, 2021 Vol.37 No.2, pp.149 - 167

Received: 21 Jan 2019
Accepted: 02 Jul 2019

Published online: 22 Jan 2021 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article