Minimizing completion time variance with compressible processing times

DOI10.1007/S10898-004-5703-YzbMath1090.90089OpenAlexW1988647270MaRDI QIDQ1781972

G. Richomme

Publication date: 9 June 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-5703-y

zbMATH Keywords

SchedulingCompletion time varianceCompressible processing times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A survey of scheduling with controllable processing times ⋮ Scheduling a batching machine with convex resource consumption functions ⋮ A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment

Cites Work

• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• Mimimization of agreeably weighted variance in single machine systems
• Single-machine sequencing with controllable processing times
• A tight lower bound for the completion time variance problem
• Two parallel machine sequencing problems involving controllable job processing times
• Completion time variance minimization on a single machine is difficult
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Minimising Waiting Time Variance in the Single Machine Problem
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: Minimizing completion time variance with compressible processing times