EconPapers    
Economics at your fingertips  
 

An Improved Integrated Scheduling Algorithm with Process Sequence Time-Selective Strategy

Zhen Wang, Xiaohuan Zhang, Gang Peng and Abd E.I.-Baset Hassanien

Complexity, 2021, vol. 2021, 1-10

Abstract: The integrated scheduling algorithm of process sequence time-selective strategy (ISAOPSTSS) is an advanced algorithm in the field of integrated scheduling. The proposed algorithm points out the shortcomings of the process sequence time-selective strategy. Generally, there are too many “trial scheduling†times. The authors propose that there is no need to make “trial scheduling†at every “quasi-scheduling time point.†In fact, the process scheduling scheme can be obtained by trial scheduling on some “quasi-scheduling time points.†The scheduling result is the same as that of the sequence timing strategy. The proposed algorithm reduces the runtime of scheduling algorithm and improves the performance of the algorithm without reducing the optimization effect.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/5570575.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/5570575.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5570575

DOI: 10.1155/2021/5570575

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().

 
Page updated 2025-03-19
Handle: RePEc:hin:complx:5570575