Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes

The scheduling of (parallel) serial-batch processing machines is a task arising in many industrial sectors. In the metal-processing industry for instance, cutting operations are necessary to fabric...

[1]  Domagoj Jakobovic,et al.  A survey of dispatching rules for the dynamic unrelated machines environment , 2018, Expert Syst. Appl..

[2]  Dmitrij Šešok,et al.  Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity , 2019, J. Sched..

[3]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

[4]  Liji Shen,et al.  Solving parallel machine problems with delivery times and tardiness objectives , 2020, Ann. Oper. Res..

[5]  Maria Pia Fanti,et al.  Heuristic scheduling of jobs on a multi-product batch processing machine , 1996 .

[6]  Fariborz Jolai,et al.  Minimizing number of tardy jobs on a batch processing machine with incompatible job families , 2005, Eur. J. Oper. Res..

[7]  Celia A. Glass,et al.  Batch machine production with perishability time windows and limited batch size , 2011, Eur. J. Oper. Res..

[8]  Yi-Feng Hung,et al.  Scheduling of mask shop E-beam writers , 1998 .

[9]  Reha Uzsoy,et al.  A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families , 2007, Comput. Oper. Res..

[10]  Douglas C. Montgomery,et al.  Optimal batching in a wafer fabrication facility using a multiproduct G/G/c model with batch processing , 2002 .

[11]  Robert C. Leachman,et al.  Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints , 2010, Oper. Res..

[12]  Udo Buscher,et al.  Solving the serial batching problem in job shop manufacturing systems , 2012, Eur. J. Oper. Res..

[13]  Hao Lin,et al.  Serial-batching scheduling with two agents to minimize makespan and maximum cost , 2020, Journal of Scheduling.

[14]  Appa Iyer Sivakumar,et al.  Optimisation of flow-shop scheduling with batch processor and limited buffer , 2012 .

[15]  Q. X. Chen,et al.  Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing , 2016, Comput. Oper. Res..

[16]  Julien Gardan,et al.  Additive manufacturing technologies: state of the art and trends , 2016 .

[17]  Shi-Sheng Li,et al.  Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs , 2014, Comput. Ind. Eng..

[18]  Pyung-Hoi Koo,et al.  Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families , 2005 .

[19]  XiaoLin Li,et al.  Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families , 2019, Comput. Oper. Res..

[20]  T. C. Edwin Cheng,et al.  The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan , 2004, Oper. Res. Lett..

[21]  Leyuan Shi,et al.  Customer order scheduling on batch processing machines with incompatible job families , 2018, Int. J. Prod. Res..

[22]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[23]  Lars Mönch,et al.  Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics , 2014, Comput. Ind. Eng..

[24]  Christopher D. Geiger,et al.  Learning effective dispatching rules for batch processor scheduling , 2008 .

[25]  Kenneth R. Baker,et al.  Computational results for the flowshop tardiness problem , 2013, Comput. Ind. Eng..

[26]  Frits C. R. Spieksma,et al.  Scheduling parallel batching machines in a sequence , 2019, J. Sched..

[27]  Ching-Jong Liao,et al.  A case study of batch scheduling for an assembly shop , 2012 .

[28]  Ali Husseinzadeh Kashan,et al.  Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework , 2008, J. Oper. Res. Soc..

[29]  Stanley B. Gershwin,et al.  Heuristic control of multiple batch processors with incompatible job families and future job arrivals , 2012 .

[30]  Shanlin Yang,et al.  Algorithms for scheduling incompatible job families on single batching machine with limited capacity , 2014, Comput. Ind. Eng..

[31]  Panos M. Pardalos,et al.  Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times , 2008, Comput. Oper. Res..

[32]  Ruyan Fu,et al.  The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespan , 2008 .

[33]  Vincent A. Cicirello.  Weighted Tardiness Scheduling with Sequence-Dependent Setups: A Benchmark Problem for Soft Computing , 2009, SOCO 2009.

[34]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .

[35]  Wen Lea Pearn,et al.  The burn-in test scheduling problem with batch dependent processing time and sequence dependent setup time , 2013 .

[36]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[37]  Zhibin Jiang,et al.  Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing , 2015 .

[38]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

[39]  Scott J. Mason,et al.  Multiple orders per job batch scheduling with incompatible jobs , 2008, Ann. Oper. Res..

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

[41]  Maria Antónia Carravilla,et al.  A general heuristic for two-dimensional nesting problems with limited-size containers , 2018 .

[42]  Mary E. Kurz,et al.  A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families , 2006 .

[43]  Jatinder N. D. Gupta,et al.  Flow shop batching and scheduling with sequence-dependent setup times , 2014, J. Sched..

[44]  Joseph Y.-T. Leung,et al.  Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine , 2017, Eur. J. Oper. Res..

[45]  Zhibin Jiang,et al.  A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals , 2012, Comput. Oper. Res..

[46]  T. C. Edwin Cheng,et al.  A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan , 2019, Eur. J. Oper. Res..

[47]  Jeffrey E. Schaller,et al.  Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem , 2012, Comput. Oper. Res..

[48]  Yasothei Suppiah,et al.  A hybrid tabu search for batching and sequencing decisions in a single machine environment , 2014, Comput. Ind. Eng..

[49]  Gregory Dobson,et al.  The Batch Loading and Scheduling Problem , 2001, Oper. Res..

[50]  R. Uzsoy,et al.  Control of a batch-processing machine: A computational approach , 1998 .

[51]  Shasha Wang,et al.  Two-stage hybrid flow shop batching and lot streaming with variable sublots and sequence-dependent setups , 2019, Int. J. Prod. Res..

[52]  Zhibin Jiang,et al.  Closed loop control-based real-time dispatching heuristic on parallel batch machines with incompatible job families and dynamic arrivals , 2013 .

[53]  M. Mathirajan,et al.  Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing , 2011 .

[54]  Sharif H. Melouk,et al.  Minimizing makespan on parallel batch processing machines , 2004 .

[55]  Leyuan Shi,et al.  Minimising total weighted completion time on batch and unary machines with incompatible job families , 2019 .

[56]  Deming Lei,et al.  Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machines , 2011 .

[57]  Lars Mönch,et al.  Scheduling jobs on a single batch processing machine with incompatible job families and weighted number of tardy jobs objective , 2013, Comput. Oper. Res..

[58]  Appa Iyer Sivakumar,et al.  Optimization of due-date objectives in scheduling semiconductor batch manufacturing , 2006 .

[59]  Scott J. Mason,et al.  Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times , 2008 .

[60]  Li-Chen Fu,et al.  A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival , 2010, Comput. Oper. Res..

[61]  Petri Helo,et al.  Cloud manufacturing - Scheduling as a service for sheet metal manufacturing , 2019, Comput. Oper. Res..

[62]  Zhibin Jiang,et al.  A method combining rules with genetic algorithm for minimizing makespan on a batch processing machine with preventive maintenance , 2020, Int. J. Prod. Res..

[63]  Leyuan Shi,et al.  Flow shop scheduling with a batch processor and limited buffer , 2017, Int. J. Prod. Res..

[64]  Chen-Fu Chien,et al.  A hybrid multi-subpopulation genetic algorithm for textile batch dyeing scheduling and an empirical study , 2018, Comput. Ind. Eng..

[65]  Shuguang Li,et al.  Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities , 2017, Eur. J. Oper. Res..

[66]  Reza H. Ahmadi,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..

[67]  Reha Uzsoy,et al.  Minimizing total tardiness on a batch processing machine with incompatible job families , 1998 .

[68]  Axel Tuma,et al.  On the flexibility of a decision theory-based heuristic for single machine scheduling , 2019, Comput. Oper. Res..

[69]  Michel Gendreau,et al.  Logic-based benders decomposition for scheduling a batching machine , 2020, Comput. Oper. Res..

[70]  Lars Mönch,et al.  Machine learning techniques for scheduling jobs with incompatible families and unequal ready times on parallel batch machines , 2006, Eng. Appl. Artif. Intell..

[71]  Pyung-Hoi Koo,et al.  Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families , 2004 .

[72]  H. Neil Geismar,et al.  Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families , 2013 .

[73]  Lars Mönch,et al.  Metaheuristics for scheduling jobs with incompatible families on parallel batching machines , 2011, J. Oper. Res. Soc..