9 citations · 18 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2014
A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem
Bo Peng, Zhipeng Lu, T. C. E. Cheng
We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relink…
cs.DS2013★ 9 cited
Solving the minimum sum coloring problem via binary quadratic programming
Yang Wang, Jin-Kao Hao, Fred Glover +1
In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using t…