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

DOI10.1016/J.EJOR.2023.06.034MaRDI QIDQ6090146zbMATH OpenOpenAlexFDO

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

completion time variancelower boundoptimal sequence characterizationschedulingtime-flexibility

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

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

Cited in

(2)

• Stochastic single-machine scheduling with workload-dependent maintenance activities
• The minimization of the weighted completion time variance in a single machine: a specialized cutting-plane approach

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)