Abstract

There are two customers and two uniform machines. Each customer has a set of jobs. These jobs may be processed on a uniform machine or may be outsourced with an outsourcing cost. Every customer has an objective function for his jobs. Manufacturers want to find the best scheduling scheme for both customers. We present algorithms for these problems for the first 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 call

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.