Abstract
A distributed model for allocating a single job to be processed through multiple machines and alternative routings so that the job flow time is experimentally shown to reach its minimum is presented. Issues are addressed pertaining to dynamic and fully distributed decision-making for determining the job flow time in a cooperative manner between system agents (i.e. machines and a job), and for selecting a good routing (i.e. a short flow time) for a job when alternative routings are available. Two cases with confirmed jobs and without confirmed jobs are examined. The proposed protocols can deal with job shop scheduling with multiple product types in a sequential manner. The model is developed on the basis of a distributed shortest path algorithm using asynchronous job-initiated protocols. These protocols are examined using object-oriented simulation models and it is shown how the agents converge to the optimal path in a finite time.
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.
