A scenario-based robust optimization approach for batch processing scheduling

For years, there have been tremendous endeavors to reduce makespan in an attempt to decrease the production expenses. This investigation aims to develop a scenario-based robust optimization approach for a real-world flow shop with any number of batch processing machines. The study assumes there are some uncertainties associated with processing times as well as size of jobs. Each machine can process multiple jobs simultaneously as long as the machines’ capacities are not violated. In order to verify this developed model and to evaluate the performance of the proposed robust model, a number of test problems are prepared and a commercial optimization solver is adopted to solve these test problems. For the purpose of validating the results, the robust model and mean-value model are carried out by simulation, which confirmed the proposed model.

[1]  S. Fischer,et al.  Micro-stereolithography tools for small-batch manufacture of polymer micro-parts , 2012 .

[2]  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..

[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]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[5]  M. Mathirajan,et al.  Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints , 2008 .

[6]  M. I. Heywood,et al.  Application of stochastic real-valued reinforcement neural networks to batch production rescheduling , 1997 .

[7]  Purushothaman Damodaran,et al.  Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .

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

[9]  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..

[10]  Purushothaman Damodaran,et al.  Scheduling a capacitated batch-processing machine to minimize makespan , 2007 .

[11]  Mikkel T. Jensen,et al.  Generating robust and flexible job shop schedules using genetic algorithms , 2003, IEEE Trans. Evol. Comput..

[12]  Purushothaman Damodaran,et al.  A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times , 2012, Expert Syst. Appl..

[13]  Han-Lin Li,et al.  A robust optimization model for stochastic logistic problems , 2000 .

[14]  Mohamed Haouari,et al.  A bi-objective model for robust resource-constrained project scheduling , 2005 .

[15]  Fariborz Jolai,et al.  Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes , 2006 .

[16]  André Rossi.  A robustness measure of the configuration of multi-purpose machines , 2010 .

[17]  Yi-Kuei Lin,et al.  Reliability of a production system with intersectional lines , 2013 .

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

[19]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[20]  Genaro J. Gutierrez,et al.  Algorithms for robust single and multiple period layout planning for manufacturing systems , 1992 .

[21]  V. Selladurai,et al.  Earliness—tardiness scheduling on uniform parallel machines using simulated annealing and fuzzy logic approach , 2008 .

[22]  Manoj Kumar Tiwari,et al.  Integrated model for the batch sequencing problem in a multi-stage supply chain: an artificial immune system based approach , 2009 .

[23]  Lars Mönch,et al.  Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint , 2006, OR Spectr..

[24]  Felix T.S. Chan.  The effects of scheduling flexibility on the performance of a flexible manufacturing system , 2003 .

[25]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[26]  Purushothaman Damodaran,et al.  Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times , 2010 .

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

[28]  Fuh-Der Chou,et al.  SCHEDULING FOR A SINGLE SEMICONDUCTOR BATCH-PROCESSING MACHINE TO MINIMIZE TOTAL WEIGHTED TARDINESS , 2008 .

[29]  Khaled Ghédira,et al.  A priori parallel machines scheduling , 2010, Comput. Ind. Eng..

[30]  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..

[31]  Fuh-Der Chou,et al.  Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics , 2010, Expert Syst. Appl..

[32]  Fuh-Der Chou,et al.  A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion , 2007 .

[33]  Mohamed Haouari,et al.  A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling , 2008, Comput. Ind. Eng..

[34]  Zuhua Jiang,et al.  A memetic algorithm approach for batch-model assembly line balancing problem of sub-block in shipbuilding , 2014 .

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

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

[37]  Purushothaman Damodaran,et al.  Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms , 2009 .