Two-stage hybrid flow shop batching and lot streaming with variable sublots and sequence-dependent setups

References

• Adonyi, R., G. Biros, T. Holczinger, and F. Friedler. 2008. “Effective Scheduling of a Large-Scale Paint Production System.” Journal of Cleaner Production 16 (2): 225–232. doi: 10.1016/j.jclepro.2006.08.021
   Web of Science ®Google Scholar
• Biskup, D., and M. Feldmann. 2006. “Lot Streaming with Variable Sublots: An Integer Programming Formulation.” Journal of the Operational Research Society 57 (3): 296–303. doi: 10.1057/palgrave.jors.2602016
   Web of Science ®Google Scholar
• Bożek, A., and F. Werner. 2017. “Flexible Job Shop Scheduling with Lot Streaming and Sublot Size Optimisation.” International Journal of Production Research 56 (19): 6391–6411. doi: 10.1080/00207543.2017.1346322
   Web of Science ®Google Scholar
• Cheng, M., N. J. Mukherjee, and S. C. Sarin. 2013. “A Review of Lot Streaming.” International Journal of Production Research 51 (23-24): 7023–7046. doi: 10.1080/00207543.2013.774506
   Web of Science ®Google Scholar
• Defersha, F. M., and M. Chen. 2010. “A Hybrid Genetic Algorithm for Flowshop Lot Streaming with Setups and Variable Sublots.” International Journal of Production Research 48 (6): 1705–1726. doi: 10.1080/00207540802660544
   Web of Science ®Google Scholar
• Defersha, F. M., and M. Chen. 2012. “Jobshop Lot Streaming with Routing Flexibility, Sequence-Dependent Setups, Machine Release Dates and Lag Time.” International Journal of Production Research 50 (8): 2331–2352. doi: 10.1080/00207543.2011.574952
   Web of Science ®Google Scholar
• Erramilli, V., and S. J. Mason. 2006. “Multiple Orders Per Job Compatible Batch Scheduling.” IEEE Transactions on Electronics Packaging Manufacturing 29 (4): 285–296. doi: 10.1109/TEPM.2006.887355
   Web of Science ®Google Scholar
• Erramilli, V., and S. J. Mason. 2008. “Multiple Orders Per Job Batch Scheduling with Incompatible Jobs.” Annals of Operations Research 159 (1): 245–260. doi: 10.1007/s10479-007-0286-x
   Web of Science ®Google Scholar
• Feldmann, M., and D. Biskup. 2008. “Lot Streaming in a Multiple Product Permutation Flow Shop with Intermingling.” International Journal of Production Research 46 (1): 197–216. doi: 10.1080/00207540600930065
   Web of Science ®Google Scholar
• Han, Y., D. Gong, Y. Jin, and Q. K. Pan. 2016. “Evolutionary Multi-Objective Blocking Lot-Streaming Flow Shop Scheduling with Interval Processing Time.” Applied Soft Computing 42: 229–245. doi: 10.1016/j.asoc.2016.01.033
   Web of Science ®Google Scholar
• Hoogeveen, H., L. Van Norden, and S. van de Velde. 2006. “Lower Bounds for Minimizing Total Completion Time in a Two-Machine Flow Shop.” Journal of Scheduling 9 (6): 559–568. doi: 10.1007/s10951-006-8789-x
   Web of Science ®Google Scholar
• Kurz, M. E., and R. G. Askin. 2004. “Scheduling Flexible Flow Lines with Sequence-Dependent Setup Times.” European Journal of Operational Research 159 (1): 66–82. doi: 10.1016/S0377-2217(03)00401-6
   Web of Science ®Google Scholar
• Li, D., X. Meng, Q. Liang, and J. Zhao. 2015. “A Heuristic-Search Genetic Algorithm for Multi-Stage Hybrid Flow Shop Scheduling with Single Processing Machines and Batch Processing Machines.” Journal of Intelligent Manufacturing 26 (5): 873–890. doi: 10.1007/s10845-014-0874-y
   Web of Science ®Google Scholar
• Lin, R., and C. J. Liao. 2012. “A Case Study of Batch Scheduling for an Assembly Shop.” International Journal of Production Economics 139 (2): 473–483. doi: 10.1016/j.ijpe.2012.05.002
   Web of Science ®Google Scholar
• Logendran, R., P. deSzoeke, and F. Barnard. 2006. “Sequence-Dependent Group Scheduling Problems in Flexible Flow Shops.” International Journal of Production Economics 102 (1): 66–86. doi: 10.1016/j.ijpe.2005.02.006
   Web of Science ®Google Scholar
• Mönch, L., and S. Roob. 2017. “A Matheuristic Framework for Batch Machine Scheduling Problems with Incompatible Job Families and Regular Sum Objective.” Applied Soft Computing 68: 835–846. doi: 10.1016/j.asoc.2017.10.028
   Web of Science ®Google Scholar
• Mukherjee, N. J., S. C. Sarin, and S. Singh. 2017. “Lot Streaming in the Presence of Learning in Sublot-Attached Setup Times and Processing Times.” International Journal of Production Research 55 (6): 1623–1639. doi: 10.1080/00207543.2016.1200760
   Web of Science ®Google Scholar
• Olson, J. R., and M. J. Schniederjans. 2000. “A Heuristic Scheduling System for Ceramic Industrial Coatings.” Interfaces 30 (5): 16–22. doi: 10.1287/inte.30.5.16.11635
   Web of Science ®Google Scholar
• Pan, Q. K., M. F. Tasgetiren, P. N. Suganthan, and T. J. Chua. 2011. “A Discrete Artificial Bee Colony Algorithm for the Lot-Streaming Flow Shop Scheduling Problem.” Information sciences 181 (12): 2455–2468. doi: 10.1016/j.ins.2009.12.025
   Web of Science ®Google Scholar
• Potts, C. N., and M. Y. Kovalyov. 2000. “Scheduling with Batching: A Review.” European journal of operational research 120 (2): 228–249. doi: 10.1016/S0377-2217(99)00153-8
   Web of Science ®Google Scholar
• Pranzo, M. 2004. “Batch Scheduling in a Two-Machine Flow Shop with Limited Buffer and Sequence Independent Setup Times and Removal Times.” European Journal of Operational Research 153 (3): 581–592. doi: 10.1016/S0377-2217(03)00264-9
   Web of Science ®Google Scholar
• Rashidi, E., M. Jahandar, and M. Zandieh. 2010. “An Improved Hybrid Multi-Objective Parallel Genetic Algorithm for Hybrid Flow Shop Scheduling with Unrelated Parallel Machines.” The International Journal of Advanced Manufacturing Technology 49 (9): 1129–1139. doi: 10.1007/s00170-009-2475-z
   Web of Science ®Google Scholar
• Shahvari, O., and R. Logendran. 2018. “A Comparison of Two Stage-Based Hybrid Algorithms for a Batch Scheduling Problem in Hybrid Flow Shop with Learning Effect.” International Journal of Production Economics 195: 227–248. doi: 10.1016/j.ijpe.2017.10.015
   Web of Science ®Google Scholar
• Shi, H., and F. You. 2016. “A Computational Framework and Solution Algorithms for Two-Stage Adaptive Robust Scheduling of Batch Manufacturing Processes under Uncertainty.” AIChE Journal 62 (3): 687–703. doi: 10.1002/aic.15067
   Web of Science ®Google Scholar
• Tang, L., H. Xuan, and J. Liu. 2006. “A New Lagrangian Relaxation Algorithm for Hybrid Flowshop Scheduling to Minimize Total Weighted Completion Time.” Computers & Operations Research 33 (11): 3344–3359. doi: 10.1016/j.cor.2005.03.028
   Web of Science ®Google Scholar
• Trietsch, D., and K. R. Baker. 1993. “Basic Techniques for Lot Streaming.” Operations Research 41 (6): 1065–1076. doi: 10.1287/opre.41.6.1065
   Web of Science ®Google Scholar
• Wang, S., H. Gangammanavar, S. D. Ekşioğlu, and S. J. Mason. 2019. “Stochastic Optimization for Energy Management in Power Systems with Multiple Microgrids.” IEEE Transactions on Smart Grid 10 (1): 1068–1079. doi: 10.1109/TSG.2017.2759159
   Web of Science ®Google Scholar
• Yin, Y., T. C. E. Cheng, D. Wang, and C. C. Wu. 2016. “Improved Algorithms for Single-Machine Serial-Batch Scheduling with Rejection to Minimize Total Completion Time and Total Rejection Cost.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 46 (11): 1578–1588. doi: 10.1109/TSMC.2015.2505644
   Web of Science ®Google Scholar
• Zandieh, M., and E. Rashidi. 2009. “An Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking.” Journal of Industrial Engineering 4 (8): 51–58.
   Google Scholar
• Zhang, B., Q. K. Pan, L. Gao, X. L. Zhang, H. Y. Sang, and J. Q. Li. 2017. “An Effective Modified Migrating Birds Optimization for Hybrid Flowshop Scheduling Problem with Lot Streaming.” Applied Soft Computing 52: 14–27. doi: 10.1016/j.asoc.2016.12.021
   Web of Science ®Google Scholar