Minimizing makespan in a two-stage flow shop with parallel batch-processing machines and re-entrant jobs

References

• Amin-Naseri, M. R., and M. A. Beheshti-Nia. 2009. “Hybrid Flow Shop Scheduling with Parallel Batching.” International Journal of Production Economics 117 (1): 185–196. doi: 10.1016/j.ijpe.2008.10.009
   Web of Science ®Google Scholar
• Bellanger, A., and A. Oulamara. 2009. “Scheduling Hybrid Flowshop with Parallel Batching Machines and Compatibilities.” Computers & Operations Research 36 (6): 1982–1992. doi: 10.1016/j.cor.2008.06.011
   Web of Science ®Google Scholar
• Choi, S.-W., and Y.-D. Kim. 2007. “Minimizing Makespan on a Two-Machine Re-entrant Flowshop.” Journal of the Operational Research Society 58 (7): 972–981. doi: 10.1057/palgrave.jors.2602220
   Web of Science ®Google Scholar
• Coffman Jr, E. G., M. R. Garey, and D. S. Johnson. 1996. Approximation Algorithms for NP-Hard Problems: Approximation Algorithms for Bin Packing: A Survey. Boston: PWS Publishing Co..
   Google Scholar
• Damodaran, P., A. G. Rao, and S. Mestry. 2013. “Particle Swarm Optimization for Scheduling Batch Processing Machines in a Permutation Flowshop.” The International Journal of Advanced Manufacturing Technology 64 (5–8): 989–1000. doi: 10.1007/s00170-012-4037-z
   Web of Science ®Google Scholar
• Gómez-Gasquet, P., C. Andrés, and F. C. Lario. 2012. “An Agent-Based Genetic Algorithm for Hybrid Flowshops with Sequence Dependent Setup Times to Minimise Makespan.” Expert Systems with Applications 39 (9): 8095–8107. doi: 10.1016/j.eswa.2012.01.158
   Web of Science ®Google Scholar
• Hekmatfar, M., S. F. Ghomi, and B. Karimi. 2011. “Two Stage Reentrant Hybrid Flow Shop with Setup Times and the Criterion of Minimizing Makespan.” Applied Soft Computing 11 (8): 4530–4539. doi: 10.1016/j.asoc.2011.08.013
   Web of Science ®Google Scholar
• Jia, W., Z. Jiang, and Y. Li. 2015. “Combined Scheduling Algorithm for Re-entrant Batch-Processing Machines in Semiconductor Wafer Manufacturing.” International Journal of Production Research 53 (6): 1866–1879. doi: 10.1080/00207543.2014.965355
   Web of Science ®Google Scholar
• Kim, S., Y. Park, and C.-H. Jun. 2006. “Performance Evaluation of Re-entrant Manufacturing System with Production Loss Using Mean Value Analysis.” Computers & Operations Research 33 (5): 1308–1325. doi: 10.1016/j.cor.2004.09.014
   Web of Science ®Google Scholar
• Liao, L.-M., and C.-J. Huang. 2011. “Tabu Search Heuristic for Two-Machine Flowshop with Batch Processing Machines.” Computers & Industrial Engineering 60 (3): 426–432. doi: 10.1016/j.cie.2010.03.004
   Web of Science ®Google Scholar
• Liao, C.-J., and L.-M. Liao. 2008. “Improved MILP Models for Two-Machine Flowshop with Batch Processing Machines.” Mathematical and Computer Modelling 48 (7): 1254–1264. doi: 10.1016/j.mcm.2008.01.001
   Web of Science ®Google Scholar
• Liu, J. J., Q. X. Chen, N. Mao, and X. D. Chen. 2013. “Bi-objective Dynamic Control of Batch Processor with Non-identical Jobs in Mould Manufacturing.” International Journal of Production Research 51 (6): 1820–1835. doi: 10.1080/00207543.2012.715768
   Web of Science ®Google Scholar
• Manjeshwar, P. K., P. Damodaran, and K. Srihari. 2011. “Genetic Algorithms for Minimizing Makespan in a Flow Shop with Two Capacitated Batch Processing Machines.” The International Journal of Advanced Manufacturing Technology 55 (9–12): 1171–1182. doi: 10.1007/s00170-010-3150-0
   Web of Science ®Google Scholar
• Marichelvam, M. K. 2012. “An Improved Hybrid Cuckoo Search (IHCS) Metaheuristics Algorithm for Permutation Flow Shop Scheduling Problems.” International Journal of Bio-Inspired Computation 4 (4): 200–205. doi: 10.1504/IJBIC.2012.048061
   Web of Science ®Google Scholar
• Murray, S., J. Geraghty, P. Young, and S. Sievwright. 2008. “Time-Limited Next Arrival Heuristic for Batch Processing and Setup Reduction in a Re-entrant Environment.” Proceedings of the 2008 Winter Simulation Conference, Miami, Florida, USA. December 2109–2117.
   Google Scholar
• Naderi, B., M. Khalili, and A. A. Khamseh. 2014. “Mathematical Models and a Hunting Search Algorithm for the No-Wait Flowshop Scheduling with Parallel Machines.” International Journal of Production Research 52 (9): 2667–2681. doi: 10.1080/00207543.2013.871389
   Web of Science ®Google Scholar
• Noroozi, A., H. Mokhtari, and I. N. K. Abadi. 2012. “A Genetic Programming Guided Search Designed for Production Scheduling when Batch Processing Machines are Available.” Advanced Science Letters 18 (1): 85–91. doi: 10.1166/asl.2012.3268
   Google Scholar
• Ozturk, O., M.-L. Espinouse, M. D. Mascolo, and A. Gouin. 2012. “Makespan Minimisation on Parallel Batch Processing Machines with Non-identical Job Sizes and Release Dates.” International Journal of Production Research 50 (20): 6022–6035. doi: 10.1080/00207543.2011.641358
   Web of Science ®Google Scholar
• Park, Y., S. Kim, and C.-H. Jun. 2002. “Mean Value Analysis of Re-entrant Line with Batch Machines and Multi-class Jobs.” Computers & Operations Research 29 (8): 1009–1024. doi: 10.1016/S0305-0548(00)00099-X
   Web of Science ®Google Scholar
• Rossi, A., A. Puppato, and M. Lanzetta. 2013. “Heuristics for Scheduling a Two-Stage Hybrid Flow Shop with Parallel Batching Machines: Application at a Hospital Sterilisation Plant.” International Journal of Production Research 51 (8): 2363–2376. doi: 10.1080/00207543.2012.737942
   Web of Science ®Google Scholar
• Sun, J. U. 2009. “A Genetic Algorithm for a Re-entrant Job-Shop Scheduling Problem with Sequence-Dependent Setup Times.” Engineering Optimization 41 (6): 505–520. doi: 10.1080/03052150802613335
   Web of Science ®Google Scholar
• Tang, L., and P. Liu. 2009. “Minimizing Makespan in a Two-Machine Flowshop Scheduling with Batching and Release Time.” Mathematical and Computer Modelling 49 (5): 1071–1077. doi: 10.1016/j.mcm.2008.09.012
   Google Scholar
• Wang, I.-L., T. Yang, and Y.-B. Chang. 2012. “Scheduling Two-Stage Hybrid Flow Shops with Parallel Batch, Release Time, and Machine Eligibility Constraints.” Journal of Intelligent Manufacturing 23 (6): 2271–2280. doi: 10.1007/s10845-011-0571-z
   Web of Science ®Google Scholar
• Yang, D.-L., W.-H. Kuo, and M.-S. Chern. 2008. “Multi-family Scheduling in a Two-Machine Reentrant Flow Shop with Setups.” European Journal of Operational Research 187 (3): 1160–1170. doi: 10.1016/j.ejor.2006.06.065
   Web of Science ®Google Scholar