To read this content please select one of the options below:

Single machine scheduling with interval grey processing time

Naiming Xie (College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, China)
Yuquan Wang (Nanjing University of Aeronautics and Astronautics, Nanjing, China)

Grey Systems: Theory and Application

ISSN: 2043-9377

Article publication date: 12 July 2023

Issue publication date: 24 October 2023

207

Abstract

Purpose

This paper aims to investigate the grey scheduling, which is the combination of grey system theory and scheduling problems with uncertain processing time. Based on the interval grey number and its related definitions, properties, and theorems, the single machine scheduling with uncertain processing time and its general forms are studied as the research object. Then several single machine scheduling models are reconstructed, and an actual production case is developed to illustrate the rationality of the research.

Design/methodology/approach

In this paper, the authors first summarize the definitions and properties related to interval grey numbers, especially the transitivity of the partial order of interval grey numbers, and give an example to illustrate that the transitivity has a positive effect on the computational time complexity of multiple interval grey number comparisons. Second, the authors redefine the general form of the single machine scheduling problem with uncertain processing time according to the definitions and theorems of interval grey numbers. The authors then reconstruct three single machine scheduling models with uncertain processing time, give the corresponding heuristic algorithms based on the interval grey numbers and prove them. Finally, the authors develop a case study based on the engine test shop of K Company, the results show that the proposed single machine scheduling models and algorithms with uncertain processing time can provide effective guidance for actual production in an uncertain environment.

Findings

The main findings of this paper are as follows: (1) summarize the definitions and theorems related to interval grey numbers and prove the transitivity of the partial order of interval grey numbers; (2) define the general form of the single machine scheduling problem with interval grey processing time; (3) reconstruct three single machine scheduling models with uncertain processing time and give the corresponding heuristic algorithms; (4) develop a case study to illustrate the rationality of the research.

Research limitations/implications

In the further research, the authors will continue to summarize more advanced general forms of grey scheduling, improve the theory of grey scheduling and prove it, and further explore the application of grey scheduling in the real world. In general, grey scheduling needs to be further combined with grey system theory to form a complete theoretical system.

Originality/value

It is a fundamental work to define the general form of single machine scheduling with uncertain processing time used the interval grey number. However, it can be seen as an important theoretical basis for the grey scheduling, and it is also beneficial to expand the application of grey system theory in real world.

Keywords

Acknowledgements

This work was supported by National Natural Science Foundation of China under grant 72171116 and “333 talent” project in Jiangsu Province (China).

Citation

Xie, N. and Wang, Y. (2023), "Single machine scheduling with interval grey processing time", Grey Systems: Theory and Application, Vol. 13 No. 4, pp. 713-729. https://doi.org/10.1108/GS-03-2023-0030

Publisher

:

Emerald Publishing Limited

Copyright © 2023, Emerald Publishing Limited

Related articles