On the Minimization of Completion Time Variance with a Bicriteria Extension

DOI10.1287/opre.40.6.1148zbMath0770.90032OpenAlexW2071288310MaRDI QIDQ4032593

Prabuddha De, Charles E. Wells, Jay B. Ghosh

Publication date: 1 April 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.40.6.1148

zbMATH Keywords

single-machine schedulingminimization of completion time variancepseudopolynomial in complexity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (52)

Simultaneous minimization of total completion time and total deviation of job completion times ⋮ On \(q\)-steepest descent method for unconstrained multiobjective optimization problems ⋮ Machine scheduling with earliness, tardiness and non-execution penalties ⋮ A quadratic integer programming method for minimizing the mean squared deviation of completion times ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Inexact projected gradient method for vector optimization ⋮ Completion time variance minimisation on two identical parallel processors ⋮ Pseudopolynomial algorithms for CTV minimization in single machine scheduling ⋮ Job scheduling methods for reducing waiting time variance ⋮ Convergence analysis of a projected gradient method for multiobjective optimization problems ⋮ Mimimization of agreeably weighted variance in single machine systems ⋮ Strictly feasible solutions and strict complementarity in multiple objective linear optimization ⋮ A lower bound for weighted completion time variance ⋮ \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions ⋮ Multi-machine scheduling with variance minimization ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ A branch and bound algorithm to minimize completion time variance on a single processor. ⋮ Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties ⋮ A note on lower bound for completion time variance in single machine scheduling. ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Another well-solvable case of the QAP: maximizing the job completion time variance ⋮ A branch and price algorithm for single-machine completion time variance ⋮ Minimizing weighted mean absolute deviation of job completion times from their weighted mean ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ Constructing efficient solutions structure of multiobjective linear programming ⋮ Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Minimizing total completion time and total deviation of job completion times from a restrictive due-date ⋮ Minimizing completion time variance with compressible processing times ⋮ Alternative extension of the Hager–Zhang conjugate gradient method for vector optimization ⋮ Accelerated diagonal steepest descent method for unconstrained multiobjective optimization ⋮ Nonlinear Conjugate Gradient Methods for Vector Optimization ⋮ Algorithms for minclique scheduling problems ⋮ Completion time variance minimization in single machine and multi-machine systems ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ New results on the completion time variance minimization ⋮ Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization ⋮ Scheduling about a given common due date to minimize mean squared deviation of completion times ⋮ A tight lower bound for the completion time variance problem ⋮ \(V\)-shape property for job sequences that minimize the expected completion time variance ⋮ Scheduling about a common due date with job-dependent asymmetric earlines and tardiness penalties ⋮ Sequencing heuristic for bicriteria scheduling in a single machine problem ⋮ On the convergence of the projected gradient method for vector optimization ⋮ Bounds for the position of the smallest job in completion time variance minimization ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization ⋮ Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Fast fully polynomial approximation schemes for minimizing completion time variance ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ Completion time variance minimization on a single machine is difficult ⋮ Linear convergence of a nonmonotone projected gradient method for multiobjective optimization ⋮ An exact algorithm to minimize mean squared deviation of job completion times about a common due date

This page was built for publication: On the Minimization of Completion Time Variance with a Bicriteria Extension