Minimizing Single-Machine Completion Time Variance

DOI10.1287/mnsc.41.9.1448zbMath0861.90078OpenAlexW2141561565MaRDI QIDQ4717390

Michael X. Weng, José A. Ventura

Publication date: 12 May 1997

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.41.9.1448

zbMATH Keywords

Lagrangian relaxationlower boundheuristic algorithm\(n\)-job, single-machine scheduling

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ A branch and bound algorithm to minimize completion time variance on a single processor. ⋮ The single machine weighted mean squared deviation problem ⋮ A breakpoint search approach for convex resource allocation problems with bounded variables ⋮ A branch and price algorithm for single-machine completion time variance ⋮ An efficient local search for minimizing completion time variance in permutation flow shops ⋮ Hierarchical minimization of completion time variance and makespan in jobshops ⋮ Scheduling about a given common due date to minimize mean squared deviation of completion times ⋮ Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection

This page was built for publication: Minimizing Single-Machine Completion Time Variance