Title: An exact solution method for seru scheduling problems considering past-sequence-dependent setup time and adjustment activities

Authors: Ru Zhang; Zhe Zhang; Xiaoling Song; Yong Yin

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

Abstract: This paper concerns production scheduling problems with past-sequence-dependent (p-s-d) setup time and adjustment activities considerations in seru production system (SPS), in which the setup time is proportionate to the sum of processing times of jobs scheduled already, and the adjustment activities are also considered due to the deteriorating positional processing time. Some common scheduling criteria are concerned for five seru scheduling problems, and an exact assignment matrix approach is formulated to prove that these seru scheduling problems can be transformed into assignment problems. The polynomial computation time is also confirmed. Computational experiments are made finally, and it is shown that the proposed approach is effective for resolving seru scheduling problems through reformulation.

Keywords: seru scheduling; setup time; adjustment activities; exact assignment matrix.

DOI: 10.1504/IJADS.2024.137008

International Journal of Applied Decision Sciences, 2024 Vol.17 No.2, pp.156 - 181

Received: 22 Aug 2022
Accepted: 15 Sep 2022
Published online: 01 Mar 2024 *

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