Abstract
In many operations time factor is a main constraint. Being able to optimally execute them while minimizing the amount of resources used remain a challenge in many business areas. In this paper we propose a model to optimally schedule processing a set of tasks which are part of network of operations on processors that are all capable of handling these tasks. The objective is to process these tasks and operations within a cut-off time while satisfying all the precedence constraints using the minimum number of resources, i.e. processors.
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 callMore From: Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems
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.
