Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem
The job-shop scheduling is one of the most studied optimization problems from the dawn of computer era to the present day. Its combinatorial nature makes it easily expressible as a constraint satisfaction problem. In this paper, we compare the performance of two constraint solvers on the job-shop scheduling problem. The solvers in question are: OR-Tools, an open-source solver developed by Google and winner of the last MiniZinc Challenge, and CP Optimizer, a proprietary IBM constraint solver targeted at industrial scheduling problems. The comparison is based on the goodness of the solutions found and the time required to solve the problem instances. First, we target the classic benchmarks from the literature, then we carry out the comparison on a benchmark that was created with known optimal solution, with size comparable to real-world industrial problems.
Code (1)
Tasks
Job Shop SchedulingSchedulingSimilar Papers 제목 키워드 기반
Metaheuristics for the Online Printing Shop Scheduling Problem
In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Programming Models for the Online Printing Shop Scheduling Problem, Computers & Ope…
Job Shop SchedulingSchedulingJob Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods
We introduce an open-source GitHub repository containing comprehensive benchmarks for a wide range of machine scheduling problems, including Job Shop Scheduling (JSP), Flow Shop Scheduling (FSP), Flexible Job Shop Schedu…
Job Shop SchedulingSchedulingA Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems
Bio-Inspired computing is the subset of Nature-Inspired computing. Job Shop Scheduling Problem is categorized under popular scheduling problems. In this research work, Bacterial Foraging Optimization was hybridized with …
Job Shop SchedulingSchedulingA Novel Metaheuristics To Solve Mixed Shop Scheduling Problems
This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural…
SchedulingOffline reinforcement learning for job-shop scheduling problems
Recent advances in deep learning have shown significant potential for solving combinatorial optimization problems in real-time. Unlike traditional methods, deep learning can generate high-quality solutions efficiently, w…
Combinatorial OptimizationDeep LearningDeep Reinforcement LearningJob Shop Scheduling+5