Learning to Solve Job Shop Scheduling under Uncertainty (2404.01308v1)
Abstract: Job-Shop Scheduling Problem (JSSP) is a combinatorial optimization problem where tasks need to be scheduled on machines in order to minimize criteria such as makespan or delay. To address more realistic scenarios, we associate a probability distribution with the duration of each task. Our objective is to generate a robust schedule, i.e. that minimizes the average makespan. This paper introduces a new approach that leverages Deep Reinforcement Learning (DRL) techniques to search for robust solutions, emphasizing JSSPs with uncertain durations. Key contributions of this research include: (1) advancements in DRL applications to JSSPs, enhancing generalization and scalability, (2) a novel method for addressing JSSPs with uncertain durations. The Wheatley approach, which integrates Graph Neural Networks (GNNs) and DRL, is made publicly available for further research and applications.
- J. Beck and Nic Wilson. Proactive algorithms for scheduling with probabilistic durations. In IJCAI International Joint Conference on Artificial Intelligence, pages 1201–1206, 01 2005.
- A survey on metaheuristics for stochastic combinatorial optimization. Natural Computing, 8:239–287, 2009.
- A hybrid genetic algorithm for stochastic job-shop scheduling problems. RAIRO: Operations Research (2804-7303), 57(4), 2023.
- How attentive are graph attention networks? CoRR, abs/2105.14491, 2021.
- Giacomo Da Col and Erich C. Teppan. Industrial-size job shop scheduling with constraint programming. Operations Research Perspectives, 9:100249, 2022.
- Research on adaptive job shop scheduling problems based on dueling double dqn. IEEE Access, 8:186474–186495, 2020.
- A closer look at invalid action masking in policy gradient algorithms. The International FLAIRS Conference Proceedings, 35, may 2022.
- On the study of curriculum learning for inferring dispatching policies on the job shop scheduling. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 5350–5358. ijcai.org, 2023.
- Matrix encoding networks for neural combinatorial optimization. In 35th Conference on Neural Information Processing Systems (NEURIPS), 2021.
- Ibm ilog cp optimizer for scheduling: 20+ years of scheduling with constraints at ibm/ilog. Constraints, 23:210–250, 2018.
- Actor-critic deep reinforcement learning for solving job shop scheduling problems. IEEE Access, 8:71752–71762, 2020.
- Dynamic job-shop scheduling problems using graph neural network and deep reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2023.
- LocalSolver. Stochastic job shop shceduling problems, 2023.
- Multi-agent-based proactive–reactive scheduling for a job shop. The International Journal of Advanced Manufacturing Technology, 59:311–324, 2012.
- An effective approach for job-shop scheduling with uncertain processing requirements. IEEE Transactions on Robotics and Automation, 15(2):328–339, 1999.
- Learning to schedule job-shop problems: representation and policy learning using graph neural network and reinforcement learning. International Journal of Production Research, 59(11):3360–3377, jan 2021.
- A. S. Raheja and V. Subramaniam. Reactive recovery of job shop schedules – a review. The International Journal of Advanced Manufacturing Technology, 19:756–763, 2002.
- Les problemes d’ordonnancement avec contraintes disjonctives. Note ds, 9, 1964.
- Proximal policy optimization algorithms, 2017.
- A comparison of priority rules for the job shop scheduling problem under different flow time-and tardiness-related objective functions. International Journal of Production Research, 50(15):4255–4270, 2012.
- J. Shen and Y.Zhu. Chance-constrained model for uncertain job shop scheduling problem. Soft Computing, 20:2383–2391, 2016.
- Flexible job-shop scheduling via graph neural network and deep reinforcement learning. IEEE Transactions on Industrial Informatics, 19(2):1600–1610, 2023.
- Eric Taillard. Benchmarks for basic scheduling problems. european journal of operational research, 64(2):278–285, 1993.
- Deep graph library: Towards efficient and scalable deep learning on graphs. CoRR, abs/1909.01315, 2019.
- A survey of job shop scheduling problem: The types and models. Computers & Operations Research, 142:105731, 2022.
- A survey of job shop scheduling problem: The types and models. Computers & Operations Research, 142, 2022.
- Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism, 2022.
- Learning to dispatch for job shop scheduling via deep reinforcement learning. In H. Larochelle, M. Ranzato, R. Hadsell, M. F. Balcan, and H. Lin, editors, Advances in Neural Information Processing Systems, volume 33, pages 1621–1632. Curran Associates, Inc., 2020.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.