Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs

This paper considers a batch delivery scheduling problem in which n independent and simultaneously available jobs are to be processed on m unrelated or uniform parallel machines. The jobs scheduled on the same machine are delivered in batches to customers and the delivery date of a batch equals the completion time of the last job in the batch. The number of jobs in each delivery batch is constrained by the batch size, and the cost of delivering a batch depends not only on the number of jobs in the batch but also on the machine on which the batch is processed. The objective is to find jointly the optimal number of batches on each machine, the optimal assignment of jobs to the batches, and the optimal job processing sequence to minimize the sum of total flowtime, total holding time, and delivery costs. When the number of batches has a fixed upper bound, we present polynomial-time algorithms to solve the problems with unrelated and uniform parallel machines. If the bound constraint on the number of batches is relaxed, we provide polynomial-time algorithms to solve two special cases of the problem with uniform parallel machines.

[1]  T.C.E. Cheng,et al.  Batch Delivery Scheduling on a Single Machine , 1994 .

[2]  Jinjiang Yuan.  A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs , 1996 .

[3]  Jatinder N. D. Gupta,et al.  A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMES , 2000 .

[4]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[5]  Dvir Shabtay,et al.  Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs , 2010 .

[6]  Zhi-Long Chen,et al.  Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .

[7]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .

[8]  Bertrand M. T. Lin,et al.  Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties , 1997, SIAM J. Optim..

[9]  Guoqing Wang,et al.  Parallel machine scheduling with batch delivery costs , 2000 .

[10]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[11]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[12]  T.C.E. Cheng,et al.  Single-machine batch delivery scheduling with an assignable common due window , 2013 .

[13]  Ji-Bo Wang,et al.  Makespan Minimization on Three-Machine Flow shop with deteriorating jobs , 2013, Asia Pac. J. Oper. Res..

[14]  T. C. Edwin Cheng,et al.  Batch delivery scheduling with batch delivery cost on a single machine , 2007, Eur. J. Oper. Res..

[15]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[16]  T. C. Edwin Cheng,et al.  Single-machine common due window assignment and scheduling to minimize the total cost , 2013, Discret. Optim..

[17]  Min Ji,et al.  Scheduling with Position-Based deteriorating jobs and Multiple deteriorating rate-Modifying Activities , 2014, Asia Pac. J. Oper. Res..

[18]  Ke Chen,et al.  Scheduling Position-Based deteriorating jobs with Multiple rate-Modifying Activities and Past-sequence-dependent Delivery times , 2014, Asia Pac. J. Oper. Res..

[19]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[20]  T. C. Edwin Cheng,et al.  Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost , 2012, Comput. Ind. Eng..