Stability polyhedra of optimal permutation of jobs servicing

DOI10.1134/S000511791407008XMaRDI QIDQ893928zbMATH OpenOpenAlexFDO

Authors Yuri N. Sotskov, Natalja G. Egorova

Publication date 23 November 2015

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s000511791407008x

zbMATH Keywords

algorithm of complexity \(O(n)\)servicing of \(n\) customers by a single server

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Optimal stochastic control (93E20) Stochastic scheduling theory in operations research (90B36) Control/observation systems involving computers (process control, etc.) (93C83)

Recommendations

• Optimality region for job permutation in single-machine scheduling with uncertain processing times
• Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a single machine
• Stability of an optimal schedule
• Permutation polyhedra and minimisation of the variance of completion times on a single machine
• scientific article; zbMATH DE number 4125190

Cites work

• scientific article; zbMATH DE number 1301840 (Why is no real title available?)
• scientific article; zbMATH DE number 2073567 (Why is no real title available?)
• Mean flow time minimization with given bounds of processing times
• Measures of problem uncertainty for scheduling with interval processing times
• Minimizing total weighted completion time with uncertain data: a stability approach
• Minimizing total weighted flow time of a set of jobs with interval processing times
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• On the calculation of the stability radius of an optimal or an approximate schedule
• Optimal makespan scheduling with given bounds of processing times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Schedule execution for two-machine flow-shop with interval processing times
• Sequencing with uncertain numerical data for makespan minimisation
• Stability analysis of an optimal balance for an assembly line with fixed cycle time
• Stability of an optimal schedule
• Uncertainty measure for the Bellman-Johnson problem with interval processing times

Cited in

(2)

• Optimality region for job permutation in single-machine scheduling with uncertain processing times
• Relaxations for the polyhedron of optimal schedules for the problem of interrupt-oriented service of jobs with a single machine

This page was built for publication: Stability polyhedra of optimal permutation of jobs servicing

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