Highly efficient scheduling algorithms for identical parallel machines with sufficient conditions for optimality of the solutions

Highly efficient scheduling algorithms for identical parallel machines with sufficient conditions for optimality of the solutions

This paper aims to develop new highly efficient PSC-algorithms (algorithms that contain a polynomial-time sub-algorithm with sufficient conditions for the optimality of the solutions obtained) for several interrelated problems involving identical parallel machine scheduling. These problems share com...

Full description

Bibliographic Details
Main Authors: Sergii Telenyk, Grzegorz Nowakowski, Oleksandr Pavlov, Olena Misura, Oleg Melnikov, Olena Khalus
Format: Article
Language:English
Published: Polish Academy of Sciences 2024-01-01
Series:Bulletin of the Polish Academy of Sciences: Technical Sciences
Subjects:
scheduling
intractable problems of discrete optimisation
sufficient conditions for optimality
parallel machines
common due date
Online Access:https://journals.pan.pl/Content/130000/PDF/BPASTS_2024_72_1_3834.pdf

Internet

https://journals.pan.pl/Content/130000/PDF/BPASTS_2024_72_1_3834.pdf

Similar Items