Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Leveraging Constraint Programming in a Deep Learning Approach for Dynamically Solving the Flexible Job-Shop Scheduling Problem (2403.09249v1)

Published 14 Mar 2024 in cs.AI

Abstract: Recent advancements in the flexible job-shop scheduling problem (FJSSP) are primarily based on deep reinforcement learning (DRL) due to its ability to generate high-quality, real-time solutions. However, DRL approaches often fail to fully harness the strengths of existing techniques such as exact methods or constraint programming (CP), which can excel at finding optimal or near-optimal solutions for smaller instances. This paper aims to integrate CP within a deep learning (DL) based methodology, leveraging the benefits of both. In this paper, we introduce a method that involves training a DL model using optimal solutions generated by CP, ensuring the model learns from high-quality data, thereby eliminating the need for the extensive exploration typical in DRL and enhancing overall performance. Further, we integrate CP into our DL framework to jointly construct solutions, utilizing DL for the initial complex stages and transitioning to CP for optimal resolution as the problem is simplified. Our hybrid approach has been extensively tested on three public FJSSP benchmarks, demonstrating superior performance over five state-of-the-art DRL approaches and a widely-used CP solver. Additionally, with the objective of exploring the application to other combinatorial optimization problems, promising preliminary results are presented on applying our hybrid approach to the traveling salesman problem, combining an exact method with a well-known DRL method.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Test instances for the flexible job shop scheduling problem with work centers. Arbeitspapier/Research Paper/Helmut-Schmidt-Universität, Lehrstuhl für Betriebswirtschaftslehre, insbes. Logistik-Management .
  2. Losing heads in the lottery: Pruning transformer attention in neural machine translation, in: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 2664–2674.
  3. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv:1611.09940 .
  4. Machine learning for combinatorial optimization: a methodological tour d’horizon. European Journal of Operational Research 290, 405–421.
  5. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR) 35, 268–308.
  6. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 41, 157–183.
  7. Real-time scheduling simulation optimisation of job shop in a production-logistics collaborative environment. International Journal of Production Research 61, 1373–1393.
  8. Solving the flexible job shop scheduling problem using an improved jaya algorithm. Computers & Industrial Engineering 137, 106064.
  9. ABC-CNN: An attention based convolutional neural network for visual question answering. arXiv preprint arXiv:1511.05960 .
  10. A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Computers & Industrial Engineering 149, 106778.
  11. Two-stage learning for the flexible job shop scheduling problem. arXiv preprint arXiv:2301.09703 .
  12. Distilling policy distillation, in: The 22nd International Conference on Artificial Intelligence and Statistics, PMLR. pp. 1331–1340.
  13. Google vs IBM: A constraint solving challenge on the job-shop scheduling problem. arXiv preprint arXiv:1909.08247 .
  14. Industrial size job shop scheduling tackled by present day CP solvers, in: Principles and Practice of Constraint Programming: 25th International Conference, CP 2019, Stamford, CT, USA, September 30–October 4, 2019, Proceedings 25, Springer. pp. 144–160.
  15. Solving the general multiprocessor job-shop scheduling problem. Management Report Series 182.
  16. Solving large flexible job shop scheduling instances by generating a diverse set of scheduling policies with deep reinforcement learning. arXiv preprint arXiv:2310.15706 .
  17. Fast graph representation learning with PyTorch Geometric, in: ICLR Workshop on Representation Learning on Graphs and Manifolds.
  18. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1, 117–129.
  19. Heuristic methods for solving job-shop scheduling problems, in: Proc. ECAI-2000 Workshop on New Results in Planning, Scheduling and Design (PuK2000), pp. 44–49.
  20. Gurobi Optimizer Reference Manual. URL: https://www.gurobi.com.
  21. An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University 12.
  22. Residual scheduling: A new reinforcement learning approach to solving job shop scheduling problem. IEEE Access .
  23. Production and transport scheduling in flexible job shop manufacturing systems. Journal of Global Optimization 79, 463–502.
  24. Heterogeneous graph transformer, in: Proceedings of the Web Conference 2020, pp. 2704–2710.
  25. Tabu search for the job-shop scheduling problem with multi-purpose machines. Operations-Research-Spektrum 15, 205–215.
  26. Discovering dispatching rules from data using imitation learning: A case study for the job-shop problem. Journal of Scheduling 21, 413–428.
  27. Attention, learn to solve routing problems! arXiv preprint arXiv:1803.08475 .
  28. POMO: Policy optimization with multiple optima for reinforcement learning. Advances in Neural Information Processing Systems 33, 21188–21198.
  29. IBM ILOG CP optimizer for detailed scheduling illustrated on three problems, in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 6th International Conference, CPAIOR 2009 Pittsburgh, PA, USA, May 27-31, 2009 Proceedings 6, Springer. pp. 148–162.
  30. A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Systems with Applications 205, 117796.
  31. Learning to optimize permutation flow shop scheduling via graph-based imitation learning. arXiv preprint arXiv:2210.17178 .
  32. On learning and branching: a survey. TOP 25, 207–236.
  33. Reinforcement learning for combinatorial optimization: A survey. Computers & Operations Research 134, 105400.
  34. An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning. European Journal of Operational Research 302, 874–891.
  35. Reinforcement learning for solving the vehicle routing problem. Advances in Neural Information Processing Systems 31.
  36. Applications of combinatorial optimization. volume 3. John Wiley & Sons.
  37. Scikit-learn: Machine learning in Python. Journal of Machine Learning Research 12, 2825–2830.
  38. Choco-solver: A java library for constraint programming. Journal of Open Source Software 7, 4708. URL: https://doi.org/10.21105/joss.04708, doi:doi:10.21105/joss.04708.
  39. An efficient two-stage genetic algorithm for flexible job-shop scheduling. IFAC-PapersOnLine 52, 2519–2524.
  40. An improved NEH heuristic to minimize makespan for flow shop scheduling problems. Decision Science Letters 10, 311–322.
  41. Masked label prediction: Unified message passing model for semi-supervised classification. arXiv preprint arXiv:2009.03509 .
  42. Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Transactions on Industrial Informatics 19, 1600–1610.
  43. An end-to-end reinforcement learning approach for job-shop scheduling problems based on constraint programming. arXiv preprint arXiv:2306.05747 .
  44. Attention is all you need. Advances in Neural information processing systems 30.
  45. Pointer networks. Advances in Neural Information Processing Systems 28.
  46. Flexible job shop scheduling via dual attention network based reinforcement learning. arXiv preprint arXiv:2305.05119 .
  47. Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning 8, 229–256.
  48. Review on flexible job shop scheduling. IET Collaborative Intelligent Manufacturing 1, 67–77.
  49. Solving flexible job shop scheduling problems via deep reinforcement learning. Expert Systems with Applications , 123019.
  50. Learning to dispatch for job shop scheduling via deep reinforcement learning. Advances in Neural Information Processing Systems 33, 1621–1632.
  51. DeepMAG: Deep reinforcement learning with multi-agent graphs for flexible job shop scheduling. Knowledge-Based Systems 259, 110083.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Imanol Echeverria (4 papers)
  2. Maialen Murua (4 papers)
  3. Roberto Santana (32 papers)
Citations (3)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now