Abstract
This paper addresses relevant issues related to the anomalous deterioration in objective function values when attempting to improve the initial parameters in one of the discrete optimization problems. The primary focus is on investigating the conditions under which it is possible to prevent the occurrence of such anomalies. Contemporary scientific works devoted to schedule optimization and task prioritization management, particularly for location-allocation problems arising in the fields of computer science, engineering, and operations research, are reviewed. A priority dynamic redistribution algorithm is proposed, which al-lows minimizing delays and ensuring efficient resource utilization during parallel task execu-tion. An example of applying the algorithm is provided, and its effectiveness in preventing anomalies.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call