Dynamic Job and Conveyor-Based Transport Joint Scheduling in Flexible Manufacturing Systems
Source abstract
Abstract
Efficiently managing resource utilization is critical in manufacturing systems to optimize production efficiency, especially in dynamic environments where jobs continually enter the system and machine breakdowns are potential occurrences. In fully automated environments, co-ordinating the transport system with other resources is paramount for smooth operations. Despite extensive research exploring the impact of job characteristics, such as fixed or variable task-processing times and job arrival rates, the role of the transport system has been relatively underexplored. This paper specifically addresses the utilization of a conveyor belt as the primary mode of transportation among a set of production machines. In this configuration, no input or output buffers exist at the machines, and the transport times are contingent on machine availability. In order to tackle this challenge, we introduce a randomized heuristic approach designed to swiftly identify a near-optimal joint schedule for job processing and transfer. Our solution has undergone testing on both state-of-the-art benchmarks and real-world instances, showcasing its ability to accurately predict the overall processing time of a production line. With respect to our previous work, we specifically consider the case of the arrival of a dynamic job, which requires a different design approach since there is a need to keep track of partially processed jobs, jobs that are waiting, and newly arrived jobs. We adopt a total rescheduling strategy and, in order to show its performance, we consider a clairvoyant scheduling approach, in which job arrivals are known in advance. We show that the total rescheduling strategy yields a scheduling solution that is close to optimal.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Scheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization · Flexible and Reconfigurable Manufacturing Systems
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Department of Computer Science, University of Verona, 37134 Verona, Italy
Department of Engineering for Innovation Medicine, University of Verona, 37134 Verona, Italy
Funding
Italian Ministry for University and Research (MUR) · Italian National Group for Scientific Computation (GNCS-INDAM) · European Union Next-GenerationEU
References (34)
Show source-provided references
1. Improved genetic algorithm based on multi-layer encoding approach for integrated process planning and scheduling problem10.1016/j.rcim.2023.102593 ↗
2. Grau, A., Indri, M., Bello, L.L., and Sauter, T. (November2017, January 29). Industrial robotics in factory automation: From the early stage to the Internet of Things. Proceedings of the IECON 2017—43rd Annual Conference of the IEEE Industrial Electronics Society, Beijing, China.10.1109/IECON.2017.8217070 ↗
3. A Pareto-based two-stage evolutionary algorithm for flexible job shop scheduling problem with worker cooperation flexibility10.1016/j.rcim.2023.102534 ↗
4. A research survey: Review of flexible job shop scheduling techniques10.1111/itor.12199 ↗
5. Review of job shop scheduling research and its new perspectives under Industry 4.010.1007/s10845-017-1350-2 ↗
6. Pinedo, M.L. (2012). Scheduling, Springer.10.1007/978-1-4614-2361-4 ↗
7. A rule-based approach founded on description logics for Industry 4.0 smart factories10.1109/TII.2019.2916622 ↗
8. Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm10.3934/mbe.2019065 ↗
9. A novel MILP model for job shop scheduling problem with mobile robots10.1016/j.rcim.2022.102506 ↗
10. Real-time data-driven dynamic scheduling for flexible job shop with insufficient transportation resources using hybrid deep Q network10.1016/j.rcim.2021.102283 ↗
11. Hu, Z., Petoukhov, S., Dychka, I., and He, M. (2019). Advances in Computer Science for Engineering and Education, Springer.10.1007/978-3-319-91008-6 ↗
12. Metaheuristics for the online printing shop scheduling problem10.1016/j.ejor.2020.12.021 ↗
13. Hoos, H.H., and Stützle, T. (2004). Stochastic Local Search: Foundations and Applications, Elsevier.
14. An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals10.1016/j.swevo.2019.100594 ↗
15. Greedy randomized adaptive search for dynamic flexible job-shop scheduling10.1016/j.jmsy.2020.06.005 ↗
16. Mixed Integer linear programming and constraint programming models for the online printing shop scheduling problem10.1016/j.cor.2020.105020 ↗
17. Gaiardelli, S., Carra, D., Spellini, S., and Fummi, F. (2022, January 6–9). On the Impact of Transport Times in Flexible Job Shop Scheduling Problems. Proceedings of the 2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation, Stuttgart, Germany.10.1109/ETFA52439.2022.9921441 ↗
18. (2023, June 01). Industrial Computer Engineering (ICE) Lab. Available online: https://www.icelab.di.univr.it/.
19. Survey of integrated flexible job shop scheduling problems10.1016/j.cie.2022.108786 ↗
20. An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness10.1016/j.eswa.2008.09.063 ↗
21. Novel robotic job-shop scheduling models with deadlock and robot movement considerations10.1016/j.tre.2021.102273 ↗
22. An effective multi-AGVs dispatching method applied to matrix manufacturing workshop10.1016/j.cie.2021.107791 ↗
23. An automated guided vehicle conflict-free scheduling approach considering assignment rules in a robotic mobile fulfillment system10.1016/j.cie.2022.108932 ↗
24. Iterative Widen Heuristic Beam Search Algorithm for Scheduling Problem of Flexible Assembly Systems10.1109/TII.2021.3049338 ↗
25. The sample average approximation method for stochastic discrete optimization10.1137/S1052623499363220 ↗
26. The power of two choices in randomized load balancing10.1109/71.963420 ↗
27. Yang, J., Wang, Y., and Wang, Z. (2021, January 9–12). Efficient Modeling of Random Sampling-Based LRU. Proceedings of the 50th International Conference on Parallel Processing, Lemont, IL, USA.10.1145/3472456.3472514 ↗
28. Generalized fisheye views10.1145/22339.22342 ↗
29. Pei, G., Gerla, M., and Chen, T.W. (2000, January 18–22). Fisheye state routing: A routing scheme for ad hoc wireless networks. Proceedings of the 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications, Conference Record, New Orleans, LA, USA.
30. A study of the flexible job shop scheduling problem with parallel machines and reentrant process10.1007/s00170-007-1227-1 ↗
31. (2023, June 01). FJS Instance Generator. Available online: https://github.com/willtl/online-printing-shop.
32. Scheduling of no buffer job shop cells with blocking constraints and automated guided vehicles10.1016/j.asoc.2014.08.028 ↗
33. Gaiardelli, S., Spellini, S., Panato, M., Lora, M., and Fummi, F. (2022, January 14–23). A Software Architecture to Control Service-Oriented Manufacturing Systems. Proceedings of the 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE), Antwerp, Belgium.10.23919/DATE54114.2022.9774522 ↗
34. Beregi, R., Pedone, G., Háy, B., and Váncza, J. (2021). Manufacturing Execution System Integration through the Standardization of a Common Service Model for Cyber-Physical Production Systems. Appl. Sci., 11.10.3390/app11167581 ↗