A review of flexible job shop scheduling problems considering transportation vehicles

The flexible job shop scheduling problem for processing machines and transportation vehicles (FJSP_PT) has garnered significant attention from academia and industry. Due to the inclusion of transportation vehicle scheduling in the scheduling problem of flexible manufacturing systems, solving FJSP_PT becomes more challenging and significantly more practically relevant compared to the flexible job shop scheduling problem. We summarize the assumptions, constraints, objective functions, and benchmarks of FJSP_PT. Then, statistical analysis is conducted on the literature up to 2023, including journals, number of articles published each year, and solution algorithms. We analyze recent literature on FJSP_PT, categorizing it based on algorithms into exact algorithms, heuristic algorithms, meta-heuristic algorithms, and swarm intelligence based algorithms. Finally, the research trends and challenges faced by FJSP_PT are summarized.