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

References

• Abido, M. A. 2002. “Optimal Power Flow Using Particle Swarm Optimization.” International Journal of Electrical Power & Energy Systems 24: 563–571. doi:10.1016/S0142-0615(01)00067-9.
   Web of Science ®Google Scholar
• Azizoglu, M., and S. Webster. 2001. “Scheduling a Batch Processing Machine with Incompatible Job Families.” Computers & Industrial Engineering 39: 325–335. doi:10.1016/S0360-8352(01)00009-2.
   Web of Science ®Google Scholar
• Bellanger, A., and A. Oulamara. 2009. “Scheduling Hybrid Flow Shop with Parallel Batching Machines and Compatibilities.” Computers & Operations Research 36: 1982–1992. doi:10.1016/j.cor.2008.06.011.
   Web of Science ®Google Scholar
• Ben-Tal, A., and A. Nemirovski. 1998. “Robust Convex Optimization.” Mathematics of Operations Research 23 (4): 769–805. doi:10.1287/moor.23.4.769.
   Web of Science ®Google Scholar
• Ben-Tal, A., and A. Nemirovski. 2000. “Robust Solutions of Linear Programming Problems Contaminated with Uncertain Data.” Mathematical Programming 88 (3): 411–424. doi:10.1007/PL00011380.
   Web of Science ®Google Scholar
• Bertsimas, D., and M. Sim. 2003. “Robust Discrete Optimization and Network Flows.” Mathematical Programming Series 98: 49–71. doi:10.1007/s10107-003-0396-4.
   Web of Science ®Google Scholar
• Bertsimas, D., and M. Sim. 2004. “The Price of Robustness.” Operations Research 52: 35–53. doi:10.1287/opre.1030.0065.
   Web of Science ®Google Scholar
• Brandstatter, B., and U. Baumgartner. 2002. “Particle Swarm Optimization Mass-Spring System Analogon.” IEEE Transactions on Magnetics 38: 997–1000. doi:10.1109/20.996256.
   Web of Science ®Google Scholar
• Chen, H. P., B. Du, and G. Q. Huang. 2010. “Metaheuristics to Minimise Makespan on Parallel Batch Processing Machines with Dynamic Job Arrivals.” International Journal of Computer Integrated Manufacturing 23: 942–956. doi:10.1080/0951192X.2010.495137.
   Web of Science ®Google Scholar
• Damodaran, P., P. K. Manjeshwar, and K. Srihari. 2006. “Minimizing Makespan on a Batch Processing Machine with Non-Identical Job Sizes Using Genetic Algorithms.” International Journal of Production Economics 103: 882–891. doi:10.1016/j.ijpe.2006.02.010.
   Web of Science ®Google Scholar
• Damodaran, P., and K. Srihari. 2004. “Mixed Integer Formulation to Minimize Makespan in a Flow Shop with Batch Processing Machines.” Mathematical and Computer Modelling 40: 1465–1472. doi:10.1016/j.mcm.2005.01.005.
   Web of Science ®Google Scholar
• Dréo, A., J. Pétrowski, P. Siarry, and E. Taillard. 2003. Metaheuristics for Hard Optimization. Translated by Amitava Chatterjee. Paris: Originally published in French by Eyrolles
   Google Scholar
• Gabrel, V., C. Murat, and A. Thiele. 2014. “Recent Advances in Robust Optimization: An Overview.” European Journal of Operational Research 235 (3): 471–483. doi:10.1016/j.ejor.2013.09.036.
   Web of Science ®Google Scholar
• Garey, M. R., and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York, NY: W.H. Freeman and Company.
   Google Scholar
• Gong, H., L. Tang, and C. W. Duin. 2010. “A Two-Stage Flow Shop Scheduling Problem on A Batching Machine and A Discrete Machine with Blocking and Shared Setup Times.” Computers & Operations Research 37 (5): 960–969. doi:10.1016/j.cor.2009.08.001.
   Web of Science ®Google Scholar
• He, C., Y. Lin, and J. Yuan. 2009. “A DP Algorithm for Minimizing Makespan and Total Completion Time on A Series-Batching Machine.” Information Processing Letters 109: 603–607. doi:10.1016/j.ipl.2009.02.007.
   Web of Science ®Google Scholar
• Ikura, Y., and M. Gimple. 1986. “Efficient Scheduling Algorithms for a Single Batch Processing Machine.” Operations Research Letters 5 (2): 61–65. doi:10.1016/0167-6377(86)90104-5.
   Web of Science ®Google Scholar
• Janak, S. L., X. Lin, and C. A. Floudas. 2007. “A New Robust Optimization Approach for Scheduling under Uncertainty: II. Uncertainty with Known Probability Distribution.” Computers & Chemical Engineering 31 (3): 171–195. doi:10.1016/j.compchemeng.2006.05.035.
   Web of Science ®Google Scholar
• Ji, M., and T. C. E. Cheng. 2010. “Batch Scheduling of Simple Linear Deteriorating Jobs on a Single Machine to Minimize Makespan.” European Journal of Operational Research 202 (1): 90–98. doi:10.1016/j.ejor.2009.05.021.
   Web of Science ®Google Scholar
• Kennedy, J., and R. C. Eberhart. 1995. “Particle Swarm Optimization.” Proceedings of ICNN’95 – International Conference on Neural Networks 4: 1942–1948. doi:10.1109/ICNN.1995.488968.
   Google Scholar
• Lei, D., and X. Guo. 2011. “Variable Neighbourhood Search for Minimising Tardiness Objectives on Flow Shop with Batch Processing Machines.” International Journal of Production Research 49: 519–529. doi:10.1080/00207540903536130.
   Web of Science ®Google Scholar
• Li, Z., and M. Ierapetritou. 2008. “Process Scheduling under Uncertainty: Review and Challenges.” Computers & Chemical Engineering 32 (4–5): 715–727. doi:10.1016/j.compchemeng.2007.03.001.
   Web of Science ®Google Scholar
• Liao, L., and C. Huang. 2011. “Tabu Search Heuristic for Two-Machine Flowshop with Batch Processing Machines.” Computers & Industrial Engineering 60: 426–432. doi:10.1016/j.cie.2010.03.004.
   Web of Science ®Google Scholar
• Lin, X., S. L. Janak, and C. A. Floudas. 2004. “A New Robust Optimization Approach for Scheduling under Uncertainty: Bounded Uncertainty.” Computers & Chemical Engineering 28 (6–7): 1069–1085. doi:10.1016/j.compchemeng.2003.09.020.
   Web of Science ®Google Scholar
• Liu, L. L., C. T. Ng, and T. C. E. Cheng. 2009a. “Bicriterion Scheduling with Equal Processing Times on a Batch Processing Machine.” Computers & Operations Research 36: 110–118. doi:10.1016/j.cor.2007.07.007.
   Web of Science ®Google Scholar
• Liu, L. L., C. T. Ng, and T. C. E. Cheng. 2009b. “Scheduling Jobs with Release Dates on Parallel Batch Processing Machines.” Discrete Applied Mathematics 157: 1825–1830. doi:10.1016/j.dam.2008.12.012.
   Web of Science ®Google Scholar
• Noroozi, A., H. Mokhtari, and I. N. Nakhai Kamal Abadi. 2013. “Research on Computational Intelligence Algorithms with Adaptive Learning Approach for Scheduling Problems with Batch Processing Machines.” Neurocomputing 101: 190–203. doi:10.1016/j.neucom.2012.08.011.
   Web of Science ®Google Scholar
• Rahmani, D., and M. Heydari. 2014. “Robust and Stable Flow Shop Scheduling with Unexpected Arrivals of New Jobs and Uncertain Processing Times.” Journal of Manufacturing Systems 33 (1): 84–92. doi:10.1016/j.jmsy.2013.03.004.
   Web of Science ®Google Scholar
• Salman, A., I. Ahmad, and S. Al-Madani. 2002. “Particle Swarm Optimization for Task Assignment Problem.” Microprocessors and Microsystems 26: 363–371. doi:10.1016/S0141-9331(02)00053-4.
   Web of Science ®Google Scholar
• Taguchi, G. 1990. Introduction to Quality Engineering. New York, NY: Mc Graw-Hill.
   Google Scholar
• Taguchi, G., and S. Konishi. 1987. Taguchi Methods, Orthogonal Arrays and Linear Graphs, Tools for Quality American Supplier Institute. 8–35. Dearborn, MI: American Supplier Institute.
   Google Scholar
• Tang, L., and P. Liu. 2009. “Minimizing Makespan in a Two-Machine Flow Shop Scheduling with Batching and Release Time.” Mathematical and Computer Modelling 49: 1071–1077. doi:10.1016/j.mcm.2008.09.012.
   Web of Science ®Google Scholar
• Tasgetiren, M. F., Y.-C. Liang, M. Sevkli, and G. Gencyilmaz. 2007. “A Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in the Permutation Flow Shop Sequencing Problem.” European Journal of Operational Research 177: 1930–1947. doi:10.1016/j.ejor.2005.12.024.
   Web of Science ®Google Scholar
• Verderame, P. M., J. A. Elia, J. Li, and C. A. Floudas. 2010. “Planning and Scheduling under Uncertainty: A Review across Multiple Sectors.” Industrial & Engineering Chemistry Research 49 (9): 3993–4017. doi:10.1021/ie902009k.
   Web of Science ®Google Scholar
• Vin, J. P., and M. G. Ierapetritou. 2001. “Robust Short-Term Scheduling of Multiproduct Batch Plants under Demand Uncertainty.” Industrial & Engineering Chemistry Research 40 (21): 4543–4554. doi:10.1021/ie0007724.
   Web of Science ®Google Scholar
• Wu, Y., and A. Wu. 2000. Taguchi Methods for Robust Design. The Park Avenue, NY: The American Society of Mechanical Engineers.
   Google Scholar
• Yang, W. H., and Y. S. Tarng. 1998. “Design Optimization of Cutting Parameters for Turning Operations Based on the Taguchi Method.” Journal of Materials Processing Technology 84: 122–129. doi:10.1016/S0924-0136(98)00079-X.
   Web of Science ®Google Scholar