• SAPA

  • Referenced in 17 articles [sw20683]
  • that are sensitive to both cost and makespan (ii) techniques for adjusting the heuristic estimates...
  • NILS

  • Referenced in 7 articles [sw20669]
  • problem with the aim of minimizing the makespan. Our experiments show that the proposed approach...
  • cumulativemm

  • Referenced in 6 articles [sw15628]
  • open instances and improve the best known makespan for 271 instances from the literature...
  • gprecedencemm

  • Referenced in 6 articles [sw15629]
  • open instances and improve the best known makespan for 271 instances from the literature...
  • ERS

  • Referenced in 2 articles [sw12048]
  • measures (throughputs and growth rates, waiting times, makespans etc.) transforming systems from one representation...
  • CuSPLIB

  • Referenced in 2 articles [sw16619]
  • Possible objective functions are: minimize makespan, minimize total (weighted) tardiness, minimize total number of late...
  • PERMGEN

  • Referenced in 2 articles [sw18144]
  • values that define an algorithm providing lower makespan solutions than NEH, in a linear increase...
  • SCIPPlan

  • Referenced in 2 articles [sw30743]
  • ENHSP in terms of run time and makespan and handles general metric objectives. SCIPPlan...
  • PSPLIB-ENERGY

  • Referenced in 2 articles [sw31318]
  • energy efficiency (i.e.: minimize the combination of makespan and energy consumption) of projects...
  • DRSCRO

  • Referenced in 1 article [sw25692]
  • finding a schedule that minimizes the {it makespan} (i.e., the total execution time ... efficiency of DRSCRO in terms of {it makespan} and convergence rate...
  • DOGS-PFSP

  • Referenced in 1 article [sw42308]
  • beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching ... solutions on the VFR benchmark (makespan minimization) and the Taillard benchmark (flowtime minimization) without using...
  • Montera

  • Referenced in 0 articles [sw23730]
  • site to maximize the performance and reduce makespan. Finally, a newly developed framework called Montera...
  • Boolector

  • Referenced in 31 articles [sw00085]
  • Boolector: an efficient SMT solver for bit-vectors...
  • GAP

  • Referenced in 3189 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • LANCELOT

  • Referenced in 306 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • MapReduce

  • Referenced in 263 articles [sw00546]
  • MapReduce is a new parallel programming model initially...
  • Matlab

  • Referenced in 13544 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • PAGP

  • Referenced in 9 articles [sw00670]
  • PAGP, a partitioning algorithm for (linear) goal programming...
  • PSPLIB

  • Referenced in 269 articles [sw00740]
  • PSPLIB -- a project scheduling problem library. We present...