A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations

References

• Abu-Marrul, V., R. Martinelli, S. Hamacher, and I. Gribkovskaia. 2021. “Matheuristics for a Parallel Machine Scheduling Problem with Non-anticipatory Family Setup Times: Application in the Offshore Oil and Gas Industry.” Computers & Operations Research 128: 105162.
   Web of Science ®Google Scholar
• Amjad, M. K., S. I. Butt, R. Kousar, R. Ahmad, M. H. Agha, Z. Faping, N. Anjum, and U. Asgher. 2018. “Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems.” Mathematical Problems in Engineering 2018: 1–32.
   Web of Science ®Google Scholar
• Bortolini, M., E. Ferrari, F. G. Galizia, and A. Regattieri. 2021. “An Optimisation Model for the Dynamic Management of Cellular Reconfigurable Manufacturing Systems Under Auxiliary Module Availability Constraints.” Journal of Manufacturing Systems 58: 442–451.
   Web of Science ®Google Scholar
• Bortolini, M., F. G. Galizia, and C. Mora. 2018. “Reconfigurable Manufacturing Systems: Literature Review and Research Trend.” Journal of Manufacturing Systems 49: 93–106.
   Web of Science ®Google Scholar
• Boschetti, M. A., V. Maniezzo, M. Roffilli, and A. Bolufé Röhler. 2009. “Matheuristics: Optimization, Simulation and Control.” In International Workshop on Hybrid Metaheuristics, pp. 171–177. Springer.
   Google Scholar
• Bożek, A., and F. Werner. 2018. “Flexible Job Shop Scheduling with Lot Streaming and Sublot Size Optimisation.” International Journal of Production Research 56 (19): 6391–6411.
   Web of Science ®Google Scholar
• Brandimarte, P. 1993. “Routing and Scheduling in a Flexible Job Shop by Tabu Search.” Annals of Operations Research 41 (3): 157–183.
   Google Scholar
• Brucker, P., and R. Schlie. 1990. “Job-shop Scheduling with Multi-purpose Machines.” Computing 45 (4): 369–375.
   Web of Science ®Google Scholar
• Bülbül, K. 2011. “A Hybrid Shifting Bottleneck-tabu Search Heuristic for the Job Shop Total Weighted Tardiness Problem.” Computers & Operations Research 38 (6): 967–983.
   Web of Science ®Google Scholar
• Carvalho, D. M., and M. C. Nascimento. 2022. “Hybrid Matheuristics to Solve the Integrated Lot Sizing and Scheduling Problem on Parallel Machines with Sequence-dependent and Non-triangular Setup.” European Journal of Operational Research 296 (1): 158–173.
   Web of Science ®Google Scholar
• Chang, J. H., and H. N. Chiu. 2005. “A Comprehensive Review of Lot Streaming.” International Journal of Production Research 43 (8): 1515–1536.
   Web of Science ®Google Scholar
• Chaudhry, I. A., and A. A. Khan. 2016. “A Research Survey: Review of Flexible Job Shop Scheduling Techniques.” International Transactions in Operational Research 23 (3): 551–591.
   Web of Science ®Google Scholar
• Chen, J., and G. Steiner. 1997. “Approximation Methods for Discrete Lot Streaming in Flow Shops.” Operations Research Letters 21 (3): 139–145.
   Web of Science ®Google Scholar
• Cheng, M., N. Mukherjee, and S. Sarin. 2013. “A Review of Lot Streaming.” International Journal of Production Research 51 (23–24): 7023–7046.
   Web of Science ®Google Scholar
• Defersha, F. M., and S. B. Movahed. 2018. “Linear Programming Assisted (not Embedded) Genetic Algorithm for Flexible Jobshop Scheduling with Lot Streaming.” Computers & Industrial Engineering117: 319–335.
   Web of Science ®Google Scholar
• Demir, Y., and S. Kürşat İşleyen. 2013. “Evaluation of Mathematical Models for Flexible Job-shop Scheduling Problems.” Applied Mathematical Modelling 37 (3): 977–988.
   Web of Science ®Google Scholar
• Fan, J., Y. Li, J. Xie, C. Zhang, W. Shen, and L. Gao. 2021. “A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-shop Scheduling Problem.” IEEE Transactions on Cybernetics 1–13. doi:10.1109/TCYB.2021.3120875.
   Web of Science ®Google Scholar
• Fan, J., W. Shen, L. Gao, C. Zhang, and Z. Zhang. 2021. “A Hybrid Jaya Algorithm for Solving Flexible Job Shop Scheduling Problem Considering Multiple Critical Paths.” Journal of Manufacturing Systems60: 298–311.
   Web of Science ®Google Scholar
• Fan, J., C. Zhang, Q. Liu, W. Shen, and L. Gao. 2022. “An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem Considering Reconfigurable Machine Tools with Limited Auxiliary Modules.” Journal of Manufacturing Systems 62: 650–667.
   Web of Science ®Google Scholar
• Fanjul-Peyro, L., F. Perea, and R. Ruiz. 2017. “Models and Matheuristics for the Unrelated Parallel Machine Scheduling Problem with Additional Resources.” European Journal of Operational Research260 (2): 482–493.
   Web of Science ®Google Scholar
• Fattahi, P., M. Saidi Mehrabad, and F. Jolai. 2007. “Mathematical Modeling and Heuristic Approaches to Flexible Job Shop Scheduling Problems.” Journal of Intelligent Manufacturing 18 (3): 331–342.
   Web of Science ®Google Scholar
• Gadalla, M., and D. Xue. 2017. “Recent Advances in Research on Reconfigurable Machine Tools: a Literature Review.” International Journal of Production Research 55 (5): 1440–1454.
   Web of Science ®Google Scholar
• Gao, K., Z. Cao, L. Zhang, Z. Chen, Y. Han, and Q. Pan. 2019. “A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems.” IEEE/CAA Journal of Automatica Sinica 6 (4): 904–916.
   Google Scholar
• Ghirardi, M., and A. Amerio. 2019. “Matheuristics for the Lot Sizing Problem with Back-ordering, Setup Carry-overs, and Non-identical Machines.” Computers & Industrial Engineering 127: 822–831.
   Web of Science ®Google Scholar
• Gholami, O., and Y. N. Sotskov. 2014. “Solving Parallel Machines Job-shop Scheduling Problems by An Adaptive Algorithm.” International Journal of Production Research 52 (13): 3888–3904.
   Web of Science ®Google Scholar
• Hong, J., K. Moon, K. Lee, K. Lee, and M. L. Pinedo. 2022. “An Iterated Greedy Matheuristic for Scheduling in Steelmaking-continuous Casting Process.” International Journal of Production Research60 (2): 623–643.
   Web of Science ®Google Scholar
• Karimi-Nasab, M., and S. Seyedhoseini. 2013. “Multi-level Lot Sizing and Job Shop Scheduling with Compressible Process Times: A Cutting Plane Approach.” European Journal of Operational Research231 (3): 598–616.
   Web of Science ®Google Scholar
• Koren, Y., and M. Shpitalni. 2010. “Design of Reconfigurable Manufacturing Systems.” Journal of Manufacturing Systems 29 (4): 130–141.
   Web of Science ®Google Scholar
• Lalitha, J. L., N. Mohan, and V. M. Pillai. 2017. “Lot Streaming in [n−1](1)+n(m) Hybrid Flow Shop.” Journal of Manufacturing Systems 44: 12–21.
   Web of Science ®Google Scholar
• Li, Y., J.-F. Côté, L. C. Coelho, and P. Wu. 2021. “Novel Efficient Formulation and Matheuristic for Large-sized Unrelated Parallel Machine Scheduling with Release Dates.” International Journal of Production Research 0 (0): 1–20.
   Web of Science ®Google Scholar
• Li, X., and L. Gao. 2016. “An Effective Hybrid Genetic Algorithm and Tabu Search for Flexible Job Shop Scheduling Problem.” International Journal of Production Economics 174: 93–110.
   Web of Science ®Google Scholar
• Lin, S.-W., and K.-C. Ying. 2016. “Optimization of Makespan for No-wait Flowshop Scheduling Problems Using Efficient Matheuristics.” Omega 64: 115–125.
   Web of Science ®Google Scholar
• Liu, Q., X. Li, and L. Gao. 2021a. “Mathematical Modeling and a Hybrid Evolutionary Algorithm for Process Planning.” Journal of Intelligent Manufacturing 32 (3): 781–797.
   Web of Science ®Google Scholar
• Liu, Q., X. Li, and L. Gao. 2021b. “A Novel Milp Model Based on the Topology of a Network Graph for Process Planning in An Intelligent Manufacturing System.” Engineering 7 (6): 807–817.
   Web of Science ®Google Scholar
• Mahmoodjanloo, M., R. Tavakkoli-Moghaddam, A. Baboli, and A. Bozorgi-Amiri. 2020. “Flexible Job Shop Scheduling Problem with Reconfigurable Machine Tools: An Improved Differential Evolution Algorithm.” Applied Soft Computing 94: 106416.
   Web of Science ®Google Scholar
• Mehrabi, M. G., A. G. Ulsoy, Y. Koren, and P. Heytler. 2002. “Trends and Perspectives in Flexible and Reconfigurable Manufacturing Systems.” Journal of Intelligent Manufacturing 13 (2): 135–146.
   Web of Science ®Google Scholar
• Novas, J. M. 2019. “Production Scheduling and Lot Streaming At Flexible Job-shops Environments Using Constraint Programming.” Computers & Industrial Engineering 136: 252–264.
   Web of Science ®Google Scholar
• Raidl, G. R., and J. Puchinger. 2008. “Combining (integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization.” Hybrid Metaheuristics 31–62.
   Google Scholar
• Reiter, S. 1966. “A System for Managing Job-shop Production.” The Journal of Business 39 (3): 371–393.
   Web of Science ®Google Scholar
• Rohaninejad, M., A. Kheirkhah, and P. Fattahi. 2015. “Simultaneous Lot-sizing and Scheduling in Flexible Job Shop Problems.” The International Journal of Advanced Manufacturing Technology 78 (1): 1–18.
   Web of Science ®Google Scholar
• Sotskov, Y. N., and O. Gholami. 2017. “Mixed Graph Model and Algorithms for Parallel-machine Job-shop Scheduling Problems.” International Journal of Production Research 55 (6): 1549–1564.
   Web of Science ®Google Scholar
• Ta, Q. C., J.-C. Billaut, and J.-L. Bouquard. 2018. “Matheuristic Algorithms for Minimizing Total Tardiness in the M-machine Flow-shop Scheduling Problem.” Journal of Intelligent Manufacturing 29 (3): 617–628.
   Web of Science ®Google Scholar
• Wolsey, L. A. 2020. Integer Programming. Hoboken, NJ: John Wiley & Sons.
   Google Scholar
• Wu, R., Y. Li, S. Guo, and W. Xu. 2018. “Solving the Dual-resource Constrained Flexible Job Shop Scheduling Problem with Learning Effect by a Hybrid Genetic Algorithm.” Advances in Mechanical Engineering 10 (10): 1687814018804096.
   Web of Science ®Google Scholar
• Xie, J., L. Gao, K. Peng, X. Li, and H. Li. 2019. “Review on Flexible Job Shop Scheduling.” IET Collaborative Intelligent Manufacturing 1 (3): 67–77.
   Google Scholar
• Yelles-Chaouche, A. R., E. Gurevsky, N. Brahimi, and A. Dolgui. 2021. “Reconfigurable Manufacturing Systems From An Optimisation Perspective: a Focused Review of Literature.” International Journal of Production Research 59 (21): 6400–6418.
   Web of Science ®Google Scholar
• Zhang, C., P. Li, Z. Guan, and Y. Rao. 2007. “A Tabu Search Algorithm with a New Neighborhood Structure for the Job Shop Scheduling Problem.” Computers & Operations Research 34 (11): 3229–3242.
   Web of Science ®Google Scholar
• Zhang, B., Q.-K. Pan, L.-L. Meng, X.-L. Zhang, Y.-P. Ren, J.-Q. Li, and X.-C. Jiang. 2021. “A Collaborative Variable Neighborhood Descent Algorithm for the Hybrid Flowshop Scheduling Problem with Consistent Sublots.” Applied Soft Computing 106: 107305.
   Web of Science ®Google Scholar