A robust modelling and optimisation framework for a batch processing flow shop production system in the presence of uncertainties

This research aims to adopt two robust optimisation approaches for a real-world flow shop manufacturing system with batch processing machines, where the processing time and size of job are non-deterministic and uncertain. Each machine can process multiple jobs simultaneously as long as the machine capacity is not exceeded. Two important decisions are required: (1) grouping jobs into batches and (2) scheduling the established batches on machines. A mathematical optimisation model is presented, and then two famous robust optimisation approaches are adopted for the purpose of converting the deterministic model to the robust one. An efficient particle swarm optimisation (PSO) algorithm is developed to solve the problem in a reasonable time. In order to verify the developed model and evaluate the performance of our proposed algorithm, a set of small to large test problems are generated, and a simulation approach and a commercial optimisation solver are used to solve these problems. Analysis of the implementation of two independent robust optimisation methods is performed by the paired t-test on all of the test problems. Furthermore, the Taguchi method, as a statistical optimisation technique, is employed to investigate the appropriate level of PSO parameters.

[1]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[2]  George Q. Huang,et al.  Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals , 2010, Int. J. Comput. Integr. Manuf..

[3]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[4]  Hadi Mokhtari,et al.  Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines , 2013, Neurocomputing.

[5]  Peter M. Verderame,et al.  Planning and Scheduling under Uncertainty: A Review Across Multiple Sectors , 2010 .

[6]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[7]  Cécile Murat,et al.  Recent advances in robust optimization: An overview , 2014, Eur. J. Oper. Res..

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  T. C. Edwin Cheng,et al.  Bicriterion scheduling with equal processing times on a batch processing machine , 2009, Comput. Oper. Res..

[10]  M. Ierapetritou,et al.  Robust short-term scheduling of multiproduct batch plants under demand uncertainty , 2001 .

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

[12]  Genichi Taguchi,et al.  Introduction to quality engineering.... , 2014 .

[13]  Purushothaman Damodaran,et al.  Mixed integer formulation to minimize makespan in a flow shop with batch processing machines , 2004, Math. Comput. Model..

[14]  Ching-Jen Huang,et al.  Tabu search heuristic for two-machine flowshop with batch processing machines , 2011, Comput. Ind. Eng..

[15]  Meral Azizoglu,et al.  Scheduling a batch processing machine with incompatible job families , 2001 .

[16]  Christodoulos A. Floudas,et al.  A new robust optimization approach for scheduling under uncertainty: II. Uncertainty with known probability distribution , 2007, Comput. Chem. Eng..

[17]  T. Saravanan,et al.  Optimal Power Flow Using Particle Swarm Optimization , 2014 .

[18]  Yvonne Schuhmacher,et al.  Taguchi Methods For Robust Design , 2016 .

[19]  Donya Rahmani,et al.  Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times , 2014 .

[20]  Ammar Oulamara,et al.  Scheduling hybrid flowshop with parallel batching machines and compatibilities , 2009, Comput. Oper. Res..

[21]  Arkadi Nemirovski,et al.  Robust Convex Optimization , 1998, Math. Oper. Res..

[22]  Jinjiang Yuan,et al.  A DP algorithm for minimizing makespan and total completion time on a series-batching machine , 2009, Inf. Process. Lett..

[23]  Marianthi G. Ierapetritou,et al.  Process scheduling under uncertainty: Review and challenges , 2008, Comput. Chem. Eng..

[24]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

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

[26]  Christodoulos A. Floudas,et al.  A new robust optimization approach for scheduling under uncertainty: : I. Bounded uncertainty , 2004, Comput. Chem. Eng..

[27]  Purushothaman Damodaran,et al.  Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms , 2006 .

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

[29]  Y. S. Tarng,et al.  Design optimization of cutting parameters for turning operations based on the Taguchi method , 1998 .

[30]  T. C. Edwin Cheng,et al.  Scheduling jobs with release dates on parallel batch processing machines , 2009, Discret. Appl. Math..

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

[32]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[33]  T. C. E. Cheng,et al.  Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan , 2010, Eur. J. Oper. Res..

[34]  Lixin Tang,et al.  A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..

[35]  U. Baumgartner,et al.  Particle swarm optimization - mass-spring system analogon , 2002 .

[36]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[37]  Arkadi Nemirovski,et al.  Robust solutions of Linear Programming problems contaminated with uncertain data , 2000, Math. Program..