Stability polyhedra of optimal permutation of jobs servicing
DOI10.1134/S000511791407008XzbMath1325.93060OpenAlexW1995798813MaRDI QIDQ893928
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Control/observation systems involving computers (process control, etc.) (93C83) Stochastic scheduling theory in operations research (90B36) Optimal stochastic control (93E20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Stability of an optimal schedule
- On the calculation of the stability radius of an optimal or an approximate schedule
- Optimal makespan scheduling with given bounds of processing times
- Minimizing total weighted flow time under uncertainty using dominance and a stability box
- Mean flow time minimization with given bounds of processing times
- Schedule execution for two-machine flow-shop with interval processing times
- Measures of problem uncertainty for scheduling with interval processing times
- Uncertainty measure for the Bellman-Johnson problem with interval processing times
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- Sequencing with uncertain numerical data for makespan minimisation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
This page was built for publication: Stability polyhedra of optimal permutation of jobs servicing
