Time-flexible min completion time variance in a single machine by quadratic programming

Article Engineering, Industrial

A multi-machine scheduling solution for homogeneous processing: Asymptotic approximation and applications

Stefano Nasini et al.

Summary: In the context of job scheduling in parallel machines, this study proposes a binary program approach for minimizing the tau-norm of completion time variances. The proposed method provides asymptotic approximations in the form of lower and upper bounds and enforces dominance properties as linear constraints. Empirical results demonstrate the efficiency and accuracy of the proposed methodology in various real-world processing service contexts.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS (2022)

Add to Collection

Article Management

An almost exact solution to the min completion time variance in a single machine

Stefano Nasini et al.

Summary: A new approach is proposed for deriving a lower bound for minimizing completion time variance in single machine scheduling problem, outperforming existing bounds and having an average difference of less than 0.01% from the optimal solution.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Add to Collection

Article Management

A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks

Jordi Castro et al.

Summary: This study improved a specialized interior-point method for solving large instances of minimum cost flows problems in bipartite networks. The specialized algorithm only required solving a system by conjugate gradients at each interior-point iteration, avoiding Cholesky factorizations. Experimental results showed that this interior-point approach significantly outperformed other methods in most linear and quadratic transportation instances.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)

Add to Collection

Article Management