arXiv:2407.18111 Abstract | arXiv Analytics

arXiv:2407.18111 [math.OC]Abstract References Reviews Resources

Job Shop Scheduling with Integer Programming, Shifting Bottleneck, and Decision Diagrams: A Computational Study

Published 2024-07-25Version 1

We study heuristic algorithms for job shop scheduling problems. We compare classical approaches, such as the shifting bottleneck heuristic with novel strategies using decision diagrams. Balas' local refinement is used to improve feasible solutions. Heuristic approaches are combined with Mixed Integer Programming and Constraint Programming approaches. We discuss our results via computational experiments.

Categories: math.OC

Keywords: decision diagrams, shifting bottleneck, integer programming, computational study, study heuristic algorithms

Related articles: Most relevant | Search more

arXiv:2103.09573 [math.OC] (Published 2021-03-17)

A Computational Study of Perspective Cuts

Ksenia Bestuzheva, Ambros Gleixner, Stefan Vigerske

arXiv:2312.01404 [math.OC] (Published 2023-12-03)

Decision Diagrams in Space!

Isaac Rudich, Quentin Cappart, Manuel López-Ibáñez, Michael Römer, Louis-Martin Rousseau

arXiv:2406.12349 [math.OC] (Published 2024-06-18)

Effective Generation of Feasible Solutions for Integer Programming via Guided Diffusion

Hao Zeng, Jiaqi Wang, Avirup Das, Junying He, Kunpeng Han, Haoyuan Hu, Mingfei Sun