Minimize the Sum of Total Completion Time and Total Rejection Penalties on a Single Parallel Batching Machine

In this paper, we consider the problem of unbounded single machine parallel batch scheduling with rejection. Jobs can either be scheduled on an unbounded parallel batch processor or be rejected. Jobs processed in the same batch have the same starting time and completion time. For each rejected job, there is a corresponding rejection penalty. Our objective is to minimize the sum of total completion time and total rejection penalties. We present a polynomial time algorithm in time O(n3 log n) by using dynamic programming. This is the first result concerning this objective function for batch scheduling with rejection.

[1]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2]  Yuzhong Zhang,et al.  Minimizing Mean Response Time in Batch Processing System , 1999, COCOON.

[3]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[4]  T. C. Edwin Cheng,et al.  Bounded single-machine parallel-batch scheduling with release dates and rejection , 2009, Comput. Oper. Res..

[5]  Jinjiang Yuan,et al.  The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan , 2008, Theor. Comput. Sci..

[6]  Dorit S. Hochbaum,et al.  Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime , 1997, Oper. Res..

[7]  Xiaotie Deng,et al.  A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling , 2001, ISAAC.

[8]  Hong Liu,et al.  Minimizing Makespan on an Unbounded Parallel Batch Processor with Rejection and Release Times , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[9]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..

[10]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[11]  Haodi Feng,et al.  Minimizing the makespan on a single parallel batching machine , 2010, Theor. Comput. Sci..

[12]  Apm Wagelmans,et al.  Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions , 1994 .