A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines

A flowshop scheduling problem with two batch-processing machines is investigated in this paper, with the optimization goal to minimize the makespan. When the job processing times on the two machines are positively correlated, a $$4$$4-approximation algorithm for this NP-hard problem was previously proposed. We show that this algorithm has a worst-case performance guarantee of $$2$$2.

[1]  Lixin Tang,et al.  Minimizing makespan in a two-machine flowshop scheduling with batching and release time , 2009, Math. Comput. Model..

[2]  T. C. Edwin Cheng,et al.  Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan , 2011, Eur. J. Oper. Res..

[3]  Fariborz Jolai,et al.  Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach , 2006, EvoCOP.

[4]  T. C. Edwin Cheng,et al.  Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan , 2010, Comput. Ind. Eng..

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

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

[7]  Ali Husseinzadeh Kashan,et al.  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes , 2008, Comput. Oper. Res..

[8]  Xiaoli Wang,et al.  Minimizing makespan on a single batching machine with release times and non-identical job sizes , 2005, Oper. Res. Lett..

[9]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[10]  Lixin Tang,et al.  A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates , 2011, Int. J. Syst. Sci..

[11]  Jaime Cerdá,et al.  State-of-the-art review of optimization methods for short-term scheduling of batch processes , 2006, Comput. Chem. Eng..

[12]  Clarisse Dhaenens,et al.  Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure , 2002, Comput. Oper. Res..

[13]  Shanlin Yang,et al.  Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes , 2014, Int. J. Syst. Sci..

[14]  Binzhou Xia,et al.  Tighter bounds of the First Fit algorithm for the bin-packing problem , 2010, Discret. Appl. Math..

[15]  Chung-Lun Li,et al.  Scheduling with agreeable release times and due dates on a batch processing machine , 1997 .

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

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[20]  Ali Husseinzadeh Kashan,et al.  A note on minimizing makespan on a single batch processing machine with nonidentical job sizes , 2009, Theor. Comput. Sci..

[21]  Kumar Rajaram,et al.  Campaign Planning and Scheduling for Multiproduct Batch Operations with Applications to the Food-Processing Industry , 2004, Manuf. Serv. Oper. Manag..

[22]  Shanlin Yang,et al.  Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes , 2012 .