Job Shop Scheduling
Overview
Job shop scheduling studies how to order operations across machines while respecting job precedence and resource constraints; flexible variants also choose among eligible machines. Methods include dispatching rules, constraint programming and search heuristics, as well as deep reinforcement learning with graph neural networks or Transformers. Recent work also addresses dynamic arrivals, buffers, transport and time lags, using benchmarks and production data to test performance under realistic conditions. A central challenge is balancing solution quality and real-time efficiency with reliable generalization across instance sizes and changing conditions, while exact solvers remain strong references where their cost is practical.
Latest papers
23 papers0 papers in the last four weeks, down 100% on the four weeks before. 0.0% of all new papers.