Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility
Abstract
This work investigates an unrelated parallel machine scheduling problem in the shared manufacturing environment. Based on practical production complexity, five job and machine-related factors, including job splitting, setup time, learning effect, processing cost and machine eligibility constraint, are integrated into the considered problem. Parallel machines with uniform speed but non-identical processing capabilities are shared on a sharing service platform, and jobs with different types can only be processed by the machines with matching eligibilities. The platform pays an amount of processing cost for using any machine to process the jobs. To balance the processing cost paid and the satisfaction of customers, we aim to minimize the weighted sum of total processing cost and total completion time of jobs in the considered problem. We establish a mixed integer linear programming model, and provide a lower bound by relaxing the machine eligibility constraint. The CPLEX solver is employed to generate optimal solutions for small-scale instances. For large-scale instances, we propose an efficient heuristic algorithm. Experimental results demonstrate that for various instance settings, the proposed algorithm can always produce near optimal solutions. We further present several managerial insights for the shared manufacturing platform.
