Abstract
This work focuses on the modeling of the features of a real-world pharmaceutical production problem, where several limited resources must be gathered and scheduled in order to mix and process active substances. The problem can be modelled as a generalization of the job-shop scheduling problem, in which each job corresponds to an order. Besides the standard precedence and capacity constraints of a classical job-shop scheduling problem, release, no-wait and time interval production constraints are added. Furthermore, the processing of each job task must be assisted by an appropriate number of operators and performed by a specific machine, out of a set of feasible machines, that is temporarily installed in a compatible clean room. An innovative generalized disjunctive graph that models all the constraints and the resource conflicts is presented.
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.
