The coordination of two parallel machines scheduling and batch deliveries

Abstract

In this paper, we consider a two-identical-parallel-machine scheduling problem with batch delivery. Although NP-hardness of this problem has been already proved by Hall and Potts, but they did not give the pseudo-polynomial- time algorithm for the problem. We prove the problem is NP-hard in the ordinary sense by constructing a pseudo-polynomial-time algorithm for the problem. We also give a polynomial-time algorithm to solve the case when the job assignment to parallel machines is given. © 2008 Springer-Verlag Berlin Heidelberg.