A VNS-IG algorithm for dynamic seru scheduling problem with sequence-dependent setup time and resource constraints

被引：0

作者：

Xiang Y. ^{[1
]}

Zhang Z. ^{[1
]}

Gong X. ^{[1
]}

Yin Y. ^{[2
]}

机构：

[1] School of Economics and Management, Nanjing University of Science and Technology, Nanjing

[2] Graduate School of Business, Doshisha University, Karasuma-Imadegawa, Kamigyo-ku, Kyoto

来源：

International Journal of Industrial and Systems Engineering | 2024年 / 46卷 / 01期

关键词：

hybrid intelligent algorithm; resource constraint; scheduling; sequence-dependent setup time; seru production;

D O I：

10.1504/IJISE.2024.135831

中图分类号：

学科分类号：

摘要：

This paper is concerned with the unspecified dynamic scheduling problem by consideration of sequence-dependent setup time and resource constraints in the setups (UDSS-SR) in a new-type seru production system (SPS). The UDSS-SR problem is formulated as a mixed integer linear programming (MILP) model to minimise the makespan, and an iterative greedy algorithm based on variable neighbourhood search (VNS-IG) is designed subsequently to facilitate decision-making in the real environment to rationalise operations and additional resources. A set of test problems is generated, and computational experiments with different instance sizes are finally made. The results indicate that the proposed VNS-IG algorithm has good performance in solving seru scheduling problem in terms of solution quality and efficiency. © 2024 Inderscience Enterprises Ltd.

引用

页码：58 / 89

页数：31

共 62 条

[1]

Allahverdi A., Gupta J.N., Aldowaisan T., A review of scheduling research involving setup considerations, Omega, 272, pp. 219-239, (1999)

[2]

Andradottir S., Ayhan H., Down D.G., Design principles for flexible systems, Production and Operations Management, 22, 5, pp. 1144-1156, (2013)

[3]

Davis E., Jaffe J.M., Algorithms for scheduling tasks on unrelated processors, Journal of the ACM (JACM), 28, 4, pp. 721-736, (1981)

[4]

Diana R.O.M., de Franca Filho M.F., de Souza S.R., de Almeida Vitor J.F., An immune-inspired algorithm for an unrelated parallel machines' scheduling problem with sequence and machine dependent setup-times for makespan minimisation, Neurocomputing, 163, pp. 94-105, (2015)

[5]

Ebrahimi M., Ghomi S.F., Karimi B., Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates, Applied Mathematical Modelling, 38, 9-10, pp. 2490-2504, (2014)

[6]

Fanjul-Peyro L., Ruiz R., Perea F., Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times, Computers & Operations Research, 101, pp. 173-182, (2019)

[7]

Frank A., Dalenogare L., Ayala N.F., Industry 4.0 technologies: implementation patterns in manufacturing companies, International Journal of Production Economics, 210, pp. 15-26, (2019)

[8]

Gai Y., Yin Y., Tang J., Liu S., Minimizing makespan of a production batch within concurrent systems: seru production perspective, Journal of Management Science and Engineering, (2020)

[9]

Jiang Y., Zhang Z., Gong X., Yin Y., An exact solution method for solving seru scheduling problems with past-sequence-dependent setup time and learning effect, Computers & Industrial Engineering, 158, (2021)

[10]

Jiang Y., Zhang Z., Song X., Yin Y., Scheduling controllable processing time jobs in seru production system with resource allocation, Journal of the Operational Research Society, pp. 1-21, (2021)

← 1 2 3 4 5 6 7 →