JOB ASSIGNMENT ALGORITHMS ON UNIFORM PARALLEL MACHINES

Abstract

Uniform parallel machine scheduling problems with a makespan measure cannot generally be solved within polynomial time complexity. This paper considers special problems with a single type of job on the uniform parallel machines, where each machine is available at a given ready time. Also the machine can be restricted on the number of jobs to be processed. The objective is to develop job assignment or batching algorithms which minimize makespan. When all the machines are available at time zero and have no restriction on the number of assignable jobs, a lower bound and optimal solution properties are derived. Based upon these properties, a polynomial algorithm is suggested to find the optimal job assignment on each machine. Three generalized problems are considered under the following situations: (1) some machines have capacity restrictions on the production batch, (2) each machine has its ready time, and (3) the jobs require series-parallel operations. The generalized problems arc also characterized and polynomial algorithms are developed for the same aim of optimal job assignment, except for the case of series-parallel operations. A heuristic algorithm is suggested with numerical tests for the series-parallel operations problem