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

DOI10.1016/J.EJOR.2023.06.034OpenAlexW4381486844MaRDI QIDQ6090146FDOQ6090146

Authors: Stefano Nasini, Rabia Nessah 

Publication date: 14 November 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.06.034

zbMATH Keywords

lower boundschedulingcompletion time varianceoptimal sequence characterizationtime-flexibility

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A storm of feasibility pumps for nonconvex MINLP
• Approximation algorithms for scheduling unrelated parallel machines
• A convex envelope formula for multilinear functions
• About Lagrangian methods in integer optimization
• Tabu search for a class of single-machine scheduling problems
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Approximability of flow shop scheduling
• Completion time variance minimization on a single machine is difficult
• Variance Minimization in Single Machine Sequencing Problems
• Proof of a conjecture of Schrage about the completion time variance problem
• A branch and bound algorithm to minimize completion time variance on a single processor.
• Batch scheduling and common due-date assignment on a single machine
• Minimizing the Time-in-System Variance for a Finite Jobset
• Minimising Waiting Time Variance in the Single Machine Problem
• Minimizing Variation of Flow Time in Single Machine Systems
• A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
• Fast fully polynomial approximation schemes for minimizing completion time variance
• Bounds for the position of the smallest job in completion time variance minimization
• Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
• A lower bound for weighted completion time variance
• An almost exact solution to the min completion time variance in a single machine
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks

This page was built for publication: Time-flexible min completion time variance in a single machine by quadratic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090146)