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

DOI10.1023/A:1015496114938zbMath1014.90042OpenAlexW1516027090MaRDI QIDQ1850996

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)

Related Items (3)

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

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