Mixed batch scheduling on identical machines

This paper studies a new mixed batch scheduling problem that arises in vacuum heat treatment. A mixed batch machine can process at most a given number of jobs simultaneously. The processing time of a batch is the weighted sum of the maximum processing time and the total processing time of jobs in the batch. The objective is to minimize the makespan. We first prove that the problem on a single machine can be solved in polynomial time, while the problem on multiple identical machines is NP -hard. Then, we develop a pseudopolynomial time exact algorithm when the number of machines is fixed. Further, we analyze the worst-case performance ratio of a full batch longest processing time algorithm and design Algorithm LPT-Greedy with improved worst-case performance.

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

[2]  Jinjiang Yuan,et al.  Unbounded parallel-batch scheduling with drop-line tasks , 2019, J. Sched..

[3]  Jibo Wang,et al.  Scheduling jobs on parallel batch processing machines , 2009, 2009 ISECS International Colloquium on Computing, Communication, Control, and Management.

[4]  Reha Uzsoy,et al.  Minimizing total completion time on batch processing machines , 1993 .

[5]  Liang Lu,et al.  Cost allocation in rescheduling with machine unavailable period , 2018, Eur. J. Oper. Res..

[6]  Lixin Tang,et al.  Scheduling a single semi-continuous batching machine , 2008 .

[7]  Cheng He,et al.  Bounded serial-batching scheduling for minimizing maximum lateness and makespan , 2015, Discret. Optim..

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

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

[10]  Reha Uzsoy,et al.  Scheduling batch processing machines with incompatible job families , 1995 .

[11]  Zhixin Liu,et al.  Rescheduling for machine disruption to minimize makespan and maximum lateness , 2014, J. Sched..

[12]  Ameur Soukhal,et al.  Two-agent scheduling with agent specific batches on an unbounded serial batching machine , 2014, Journal of Scheduling.

[13]  Yuzhong Zhang,et al.  Batch Scheduling with Deteriorating Jobs to Minimize the Total Completion Time , 2013 .

[14]  Guochuan Zhang,et al.  Minimizing makespan on a single batch processing machine with nonidentical job sizes , 2001 .

[15]  T. C. Edwin Cheng,et al.  Batch scheduling of step deteriorating jobs , 2008, J. Sched..

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

[17]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

[18]  Lixin Tang,et al.  A review of planning and scheduling systems and methods for integrated steel production , 2001, Eur. J. Oper. Res..

[19]  Xianpeng Wang,et al.  A Scatter Search Algorithm for a Multistage Production Scheduling Problem With Blocking and Semi-Continuous Batching Machine , 2011, IEEE Transactions on Control Systems Technology.

[20]  T. C. Edwin Cheng,et al.  On the complexity of bi-criteria scheduling on a single batch processing machine , 2010, J. Sched..

[21]  Dvir Shabtay,et al.  The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost , 2014, Eur. J. Oper. Res..

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

[23]  T.C.E. Cheng,et al.  Single machine batch scheduling with sequential job processing , 2001 .

[24]  T.C.E. Cheng,et al.  Single machine serial-batching scheduling problem with a common batch size to minimize total weighted completion time , 2007 .

[25]  Philippe Baptiste,et al.  Batching identical jobs , 2000, Math. Methods Oper. Res..

[26]  Yu-Zhong Zhang,et al.  Serial batch scheduling on uniform parallel machines to minimize total completion time , 2014, Inf. Process. Lett..

[27]  Qizhi Fang,et al.  A coordination mechanism for a scheduling game with parallel-batching machines , 2017, J. Comb. Optim..

[28]  Xiaotie Deng,et al.  A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling , 2002, Int. J. Found. Comput. Sci..

[29]  Najoua Dridi,et al.  A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size , 2014, J. Sched..

[30]  Yingqian Zhang,et al.  Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes , 2017, Eur. J. Oper. Res..

[31]  Chung Keung Poon,et al.  On Minimizing Total Completion Time In Batch Machine Scheduling , 2004, Int. J. Found. Comput. Sci..

[32]  Liying Kang,et al.  Batch-Processing Scheduling with Setup Times , 2004, J. Comb. Optim..

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

[34]  T.C.E. Cheng,et al.  Parallel-machine batching and scheduling to minimize total completion time , 1996 .

[35]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

[36]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

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

[38]  Susanne Albers,et al.  The Complexity of One-Machine Batching Problems , 1993, Discret. Appl. Math..

[39]  J. Leung,et al.  Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan , 2014 .

[40]  Reha Uzsoy,et al.  Minimizing total completion time on a batch processing machine with job families , 1993, Oper. Res. Lett..

[41]  Mihalis Yannakakis,et al.  Batch sizing and job sequencing on a single machine , 1991 .

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