Abstract
This paper addresses the scheduling problem of a class of manufacturing systems with multiple resources and blocking. A set of jobs is to be processed and each job requires a sequence of operations. Each operation may need more than one resource. Upon the completion of an operation, resources needed in the next operation of the same job cannot be released and the remaining resources cannot be released until the start of the next operation. The scheduling problem consists in sequencing the operations on the resources in order to avoid deadlocks and to minimise the makespan. We frrst model the system using Petri nets, formulate deadlock constraints in terms of the PN model, and establish feasibility conditions of a given schedule. Finally, two heuristics are proposed to obtain deadlock-free schedules
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 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.
