Stability polyhedra of optimal permutation of jobs servicing

DOI10.1134/S000511791407008XzbMATH Open1325.93060OpenAlexW1995798813MaRDI QIDQ893928FDOQ893928

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

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

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)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Stability analysis of an optimal balance for an assembly line with fixed cycle time
• Mean flow time minimization with given bounds of processing times
• On the calculation of the stability radius of an optimal or an approximate schedule
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Optimal makespan scheduling with given bounds of processing times
• Minimizing total weighted flow time under uncertainty using dominance and a stability box
• Sequencing with uncertain numerical data for makespan minimisation
• 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
• Schedule execution for two-machine flow-shop with interval processing times
• Title not available (Why is that?)
• Stability of an optimal schedule
• Title not available (Why is that?)
• Measures of problem uncertainty for scheduling with interval processing times
• Uncertainty measure for the Bellman-Johnson problem with interval processing times

Cited In (1)

• Optimality region for job permutation in single-machine scheduling with uncertain processing times

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)