Benchmarks and results

Two branch-and-bound algorithms for the robust parallel machine scheduling problem.
Instances: click here (30 Kb).


Reference: Mohammad Ranjbar, Morteza Davari and Roel Leus. Two branch-and-bound algorithms for the robust parallel machine scheduling problem. Computers & Operations Research 39:1652 - 1660, 2012.
An exact method for scheduling of the alternative technologies in R&D projects.
Instances: click here (16 Kb).
Executable version: click here (57 Kb)(Debug mode 32bit).
Optimal solutions: click here

Reference: Mohammad Ranjbar and Morteza Davari. An exact method for scheduling of the alternative technologies in R&D projects. Computers & Operations Research 40:395 - 405, 2013.
Exact algorithms for single-machine scheduling with time windows and precedence constraints.
Instances (generated benchmarks): click here
Results (n = 30, 40, 50): click here


Reference: Morteza Davari, Erik Demeulemeester, Roel Leus and Fabrice Talla Nobibon. Exact algorithms for single-machine scheduling with time windows and precedence constraints. Journal of Scheduling 2015.