Abstract
In this paper, a distributed multi-agent scheduling system (MASS) based on co-operative approach is proposed to solve static and dynamic job shop scheduling problems (JSSP). The proposed system is composed of two kinds of agents, Supervisor agents and Resource agents. The Supervisor agent decomposes JSSP into interrelated sub-problems and the Resource agents co-operate, through a distributed approach of local idle time minimisation, to solve this problem which is known as one of the most difficult NP-hard problems. Computational results are presented to show the efficiency of MASS in static job shop scheduling. Then, a comparison of the computational results between MASS and some common dispatching rules, on dynamic job arrivals, is studied in terms of effectiveness and stability. Finally, the developed system is validated within an illustrative example, to demonstrate the feasibility of MASS.
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 callDisclaimer: 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.
