Lot Streaming Flow Shop with a Heterogeneous Machine

References

• Biskup, D., & Feldmann, M. (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., & Wysocki, M. (2015). Flexible job shop with continuous material flow. International Journal of Production Research, 53(4), 1273–1290. doi:10.1080/00207543.2014.955925
   Web of Science ®Google Scholar
• Cheng, M., Mukherjee, N. J., & Sarin, S. C. (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
• Ciavotta, M., Minella, G., & Ruiz, R. (2013). Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. European Journal of Operational Research, 227(2), 301–313. doi:10.1016/j.ejor.2012.12.031
   Web of Science ®Google Scholar
• Defersha, F. M., & Chen, M. (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., & Chen, M. (2012). Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem. The International Journal of Advanced Manufacturing Technology, 62(1–4), 249–265. doi:10.1007/s00170-011-3798-0
   Web of Science ®Google Scholar
• Feldmann, M., & Biskup, D. (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
• Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129. doi:10.1287/moor.1.2.117
   Google Scholar
• Gong, D., Han, Y., & Sun, J. (2018). A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems. Knowledge-Based Systems, 148, 115–130. doi:10.1016/j.knosys.2018.02.029
   Web of Science ®Google Scholar
• Han, Y., Gong, D., Jin, Y., & Pan, Q. (2017). Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns. IEEE Transactions on Cybernetics, Article in press. doi: 10.1109/TCYB.2017.2771213
   Web of Science ®Google Scholar
• Han, Y., Gong, D., Jin, Y., & Pan, Q. K. (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
• Han, Y. Y., Gong, D. W., Sun, X. Y., & Pan, Q. K. (2014). An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem. International Journal of Production Research, 52(8), 2211–2231. doi:10.1080/00207543.2013.848492
   Web of Science ®Google Scholar
• Hart, W. E., Laird, C., Watson, J. P., & Woodruff, D. L. (2012). Pyomo–Optimization modeling in python (Vol. 67). Berlin, Germany: Springer Science & Business Media.
   Google Scholar
• Hart, W. E., Watson, J. P., & Woodruff, D. L. (2011). Pyomo: Modeling and solving mathematical programs in Python. Mathematical Programming Computation, 3(3), 219–260. doi:10.1007/s12532-011-0026-8
   Google Scholar
• Koh, S. G., Koo, P. H., Kim, D. C., & Hur, W. S. (2005). Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families. International Journal of Production Economics, 98(1), 81–96. doi:10.1016/j.ijpe.2004.10.001
   Web of Science ®Google Scholar
• Kumar, S., Bagchi, T. P., & Sriskandarajah, C. (2000). Lot streaming and scheduling heuristics for m-machine no-wait flowshops. Computers & Industrial Engineering, 38(1), 149–172. doi:10.1016/S0360-8352(00)00035-8
   Web of Science ®Google Scholar
• Li, D., Li, M., Meng, X., & Tian, Y. (2015). A hyperheuristic approach for intercell scheduling with single processing machines and batch processing machines. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 45(2), 315–325. doi:10.1109/TSMC.2014.2332443
   Web of Science ®Google Scholar
• Li, D., Meng, X., Li, M., & Tian, Y. (2016). An ACO-based intercell scheduling approach for job shop cells with multiple single processing machines and one batch processing machine. Journal of Intelligent Manufacturing, 27(2), 283–296. doi:10.1007/s10845-013-0859-2
   Web of Science ®Google Scholar
• Martin, C. H. (2009). A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming. Omega, 37(1), 126–137. doi:10.1016/j.omega.2006.11.002
   Web of Science ®Google Scholar
• Mason, A. J. (2013). SolverStudio: A new tool for better optimisation and simulation modelling in Excel. INFORMS Transactions on Education, 14(1), 45–52. doi:10.1287/ited.2013.0112
   Google Scholar
• Meng, T., Pan, Q.-K., Li, J.-Q., & Sang, H.-Y. (2018). An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm and Evolutionary Computation, 38, 64–78. doi:10.1016/j.swevo.2017.06.003
   Web of Science ®Google Scholar
• Pan, Q. K., & Ruiz, R. (2012). An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega, 40(2), 166–180. doi:10.1016/j.omega.2011.05.002
   Web of Science ®Google Scholar
• Pan, Q. K., Tasgetiren, M. F., Suganthan, P. N., & Chua, T. J. (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
• Pinedo, M. (2016). Scheduling. Berlin, Germany: Springer.
   Google Scholar
• Rossit, D., Tohmé, F., Frutos, M., Bard, J., & Broz, D. (2016). A non-permutation flowshop scheduling problem with lot streaming: A mathematical model. International Journal of Industrial Engineering Computations, 7(3), 507–516. doi:10.5267/j.ijiec.2015.11.004
   Google Scholar
• Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3), 781–800. doi:10.1016/j.ejor.2004.06.038
   Web of Science ®Google Scholar
• Sarin, S. C., & Jaiprakash, P. (2007). Flow shop lot streaming. Berlin, Germany: Springer Science & Business Media.
   Google Scholar
• Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285. doi:10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Toncovich, A. A., Rossit, D. A., Frutos, M., & Rossit, D. G. (2019). Solving a multi-objective manufacturing cell scheduling problem with the consideration of warehouses using a simulated annealing based procedure. International Journal of Industrial Engineering Computations, 10(1), 1–16. doi:10.5267/j.ijiec.2018.6.001
   Google Scholar
• Trietsch, D., & Baker, K. R. (1993). Basic techniques for lot streaming. Operations Research, 41(6), 1065–1076. doi:10.1287/opre.41.6.1065
   Web of Science ®Google Scholar
• Tseng, C. T., & Liao, C. J. (2008). A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operational Research, 191(2), 360–373. doi:10.1016/j.ejor.2007.08.030
   Web of Science ®Google Scholar
• Yoon, S. H., & Ventura, J. A. (2002). An application of genetic algorithms to lot-streaming flow shop scheduling. IIE Transactions, 34(9), 779–787. doi:10.1080/07408170208928911
   Web of Science ®Google Scholar
• Zhang, B., Pan, Q.-K., Gao, L., Zhang, X.-L., Sang, H.-Y., & Li, J.-Q. (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