For decades, some small factory scheduling problems with just 20 jobs stayed unsolved until now.

Factories often use flexible machines that must swap tools between jobs. Choosing the best order for these jobs to minimize tool switches is called the Job Sequencing and Tool Switching Problem. This puzzle is notoriously hard. In fact, test problems with only 20 jobs, created decades ago, have stayed unsolved. To solve it, researchers created an exact method called the Combinatorial Branch-and-BoundBranch-and-BoundA search method that explores possibilities step by step and cuts off paths that can't be better than what you've already found. algorithm. It works by testing possibilities systematically, using two combined search strategies. The first strategy uses a new splitting plan to shrink the search space, backed by new calculation shortcuts to rule out bad paths. The second builds on earlier work by adding two shortcut rules and another calculation shortcut. A fast initial finder gives the system an early strong target to beat. This combined approach proved the best solutions for several long-unsolved benchmark problems with significantly less effort.

Why it matters

Factory managers in flexible manufacturing can now find optimal schedules that were previously impossible to prove, reducing machine downtime and operational costs. This directly impacts production efficiency and resource planning in industries using varied tools.

Questions answered