Abstract

This paper deals with the problem of scheduling dependent tasks with release time, deadline and due time on identical parallel machines. Based on decomposition-coordination methodology in large scale systems theory and Lagrangian relaxation technique, a multilayer hierarchical scheduling algorithm is presented. By making the most of structural properties of the precedence graph of partial ordering task set and introducing the concept of feasible start time interval , the proposed algorithm can be used for solving the scheduling problem under study effectively.

Full Text
Paper version not known

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

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.