The subject of Job Scheduling Optimisation (JSO) deals with the scheduling of jobs in an organization, so that the single working steps are optimally organized regarding the postulated targets. In this paper a use case is provided which deals with a sub-aspect of JSO, the Job Shop Scheduling Problem (JSSP or JSP). As many optimization problems JSSP is NP-complete, which means the complexity increases with every node in the system exponentially. The goal of the use case is to show how to create an optimized duty rooster for certain workpieces in a flexible organized machinery, combined with an Autonomous Ground Vehicle (AGV), using Constraint Programming (CP) and Quantum Computing (QC) alternatively. The results of a classical solution based on CP and on a Quantum Annealing model are presented and discussed. All presented results have been elaborated in the research project PlanQK.
Flexible Manufacturing Systems Intralogistics: Dynamic Optimization of AGVs and Tool Sharing Using Coloured-Timed Petri Nets and Actor-Critic RL with Actions Masking
South Westphalia University of Applied Sciences（西南莱茵河应用科学大学）
Investigation of the Generalisation Ability of Genetic Programming-evolved Scheduling Rules in Dynamic Flexible Job Shop Scheduling
Centre for Data Science；Artificial Intelligence \& School of Engineering；Computer Science, Victoria University of Wellington, Wellington 6140, New Zealand
DyRo-MCTS: A Robust Monte Carlo Tree Search Approach to Dynamic Job Shop Scheduling
Centre for Data Science & Artificial Intelligence（数据科学与人工智能中心）；School of Engineering & Computer Science（工程与计算机科学学院）；Victoria University of Wellington（惠灵顿维多利亚大学）
Policy-Based Reinforcement Learning with Action Masking for Dynamic Job Shop Scheduling under Uncertainty: Handling Random Arrivals and Machine Failures
South Westphalia University of Applied Sciences（西南弗劳恩霍夫应用科学大学）
Models and Strategies for Variants of the Job Shop Scheduling Problem
Cork Constraint Computation Centre（科克约束计算中心）；University College Cork（科克大学学院）；CNRS（法国国家科学研究中心）；LAAS（法国航空航天实验室）；Université de Toulouse（图卢兹大学）；UPS（图卢兹第三大学）；INSA（法国国立应用科学学院）；INP（法国国立理工学院）；ISAE（法国高等航空航天学院）；UT1（图卢兹第一大学）；UTM（图卢兹第二大学）
RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified States
School of Computing and Information Systems, Singapore Management University, Singapore（新加坡管理大学计算机与信息系）；College of Computing and Data Science, Nanyang Technological University, Singapore（南洋理工大学计算与数据科学学院）；Institute of Marine Science and Technology, Shandong University, China（山东大学海洋科学与技术研究院）
ReflecSched: Solving Dynamic Flexible Job-Shop Scheduling via LLM-Powered Hierarchical Reflection
School of Computer Science and Engineering（计算机科学与工程学院）；Beihang University（北京航空航天大学）；Qingdao Research Institute（青岛研究院）；Hangzhou Innovation Institute（杭州创新研究院）；Zhongguancun Laboratory（中关村实验室）
Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling
Faculty of Applied Sciences, Macao Polytechnic University（澳门理工学院应用科学学院）；Pazhou Lab (Huangpu), Guangzhou（广州 Pazhou 实验室（黄埔））；College of Animal Science and Technology, Zhongkai University of Agriculture and Engineering（仲恺农业工程学院动物科学与技术学院）；Macao Polytechnic University（澳门理工学院）
Learning Topological Representations with Bidirectional Graph Attention Network for Solving Job Shop Scheduling Problem
Nanyang Technological University（南洋理工大学）；Singapore Management University（新加坡管理大学）；Eindhoven University of Technology（埃因霍温理工大学）；Institute of Marine Science and Technology, Shandong University（山东大学海洋科学与技术研究院）
Instance Configuration for Sustainable Job Shop Scheduling
Universitat Politècnica de València（巴塞罗那理工大学）；valgrAI - Valencian Graduate School and Research Network of Artificial Intelligence（瓦伦西亚人工智能研究生学院和研究网络）；Research Network of Artificial Intelligence（人工智能研究网络）
Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems
Eindhoven University of Technology（埃因霍温理工大学）；Eindhoven Artificial Intelligence Systems Institute（埃因霍温人工智能系统研究所）；Delmia R&D, Dassault Systèmes（达索系统Delmia研发部）
Online Operator Design in Evolutionary Optimization for Flexible Job Shop Scheduling via Large Language Models
School of Computer Science, Guangdong University of Technology（广东工业大学计算机科学学院）；Department of Computer Science, City University of Hong Kong（香港城市大学计算机科学系）
Discrete Differential Evolution Particle Swarm Optimization Algorithm for Energy Saving Flexible Job Shop Scheduling Problem Considering Machine Multi States
Business School, Shandong Normal University（山东师范大学商学院）；School of Mathematics, Yunnan Normal University（云南师范大学数学学院）；School of Physics and Electronics, Shandong Normal University（山东师范大学物理与电子科学学院）
Learning Memory-Enhanced Improvement Heuristics for Flexible Job Shop Scheduling
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education（教育部符号计算与知识工程重点实验室）；College of Software（软件学院）；College of Computer Science and Technology（计算机科学与技术学院）；Singapore Management University（新加坡管理大学）；Nanyang Technological University（南洋理工大学）
