Abstract
A periodic processes scheduling problem appears for flexible manufacturing systems, computer systems, and other applications. The paper considers an approach to flow shop scheduling in terms of real-time distributed computing systems. The approach is based on the concept of solvable class of systems, for which simple optimal scheduling algorithms exist. The proposed approach belongs to the class of fast approximate algorithms; it slightly falls behind the known heuristic NEH algorithm regarding the optimality criterion, but it is much faster.
Sign-in/Register to access full text options 
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 callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
