Related references
Note: Only part of the references are listed.A multi-machine scheduling solution for homogeneous processing: Asymptotic approximation and applications
Stefano Nasini et al.
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2022)
An almost exact solution to the min completion time variance in a single machine
Stefano Nasini et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
Jordi Castro et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy
Daniel Baena et al.
MANAGEMENT SCIENCE (2020)
A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
Jordi Castro et al.
MATHEMATICAL PROGRAMMING (2017)
A storm of feasibility pumps for nonconvex MINLP
Claudia D'Ambrosio et al.
MATHEMATICAL PROGRAMMING (2012)
Minimizing job completion time variance for service stability on identical parallel machines
Xueping Li et al.
COMPUTERS & INDUSTRIAL ENGINEERING (2010)
A lower bound for weighted completion time variance
Rabia Nessah et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2010)
About Lagrangian methods in integer optimization
A Frangioni
ANNALS OF OPERATIONS RESEARCH (2005)
A branch and bound algorithm to minimize completion time variance on a single processor
G Viswanathkumar et al.
COMPUTERS & OPERATIONS RESEARCH (2003)
Fast fully polynomial approximation schemes for minimizing completion time variance
W Kubiak et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2002)
Tabu search for a class of single-machine scheduling problems
U Al-Turki et al.
COMPUTERS & OPERATIONS RESEARCH (2001)