Permutation polyhedra and minimisation of the variance of completion times on a single machine

DOI10.1023/A:1015496114938MaRDI QIDQ1850996zbMATH OpenOpenAlexFDO

Authors Prabha Sharma

Publication date 15 December 2002

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1015496114938

zbMATH Keywords

dominancecompletion time variancepermutation polyhedradominance value

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A solvable case of the variance minimization problem
• New results on the completion time variance minimization
• Pseudopolynomial algorithms for CTV minimization in single machine scheduling
• Multi-machine scheduling with variance minimization
• A branch and bound algorithm to minimize completion time variance on a single processor.

Cited in

(4)

• An efficient local search for minimizing completion time variance in permutation flow shops
• A branch and price algorithm for single-machine completion time variance
• Stability polyhedra of optimal permutation of jobs servicing
• A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights

This page was built for publication: Permutation polyhedra and minimisation of the variance of completion times on a single machine

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