Algorithms for Multi-Customer Scheduling with Outsourcing

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.