Minimizing completion time variance with compressible processing times

DOI10.1007/S10898-004-5703-YMaRDI QIDQ1781972zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 764420
• Minimizing Single-Machine Completion Time Variance
• A solvable case of the variance minimization problem
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Minimising variance of job completion times in a single machine

Cites work

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

Cited in

(5)

• 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
• A survey of scheduling with controllable processing times
• Scheduling a batching machine with convex resource consumption functions
• scientific article; zbMATH DE number 764420 (Why is no real title available?)

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

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