Exact lexicographic scheduling and approximate rescheduling
From MaRDI portal
Publication:2029366
DOI10.1016/j.ejor.2020.08.032zbMath1487.90303arXiv1805.03437OpenAlexW3080772958MaRDI QIDQ2029366
Miten Mistry, Dimitrios Letsios, Ruth Misener
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.03437
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Robustness in mathematical programming (90C17)
Related Items
A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness, Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms, Approximate and robust bounded job start scheduling for Royal Mail delivery offices, Target-based distributionally robust optimization for single machine scheduling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex hull characterizations of lexicographic orderings
- On the recoverable robust traveling salesman problem
- A hard integer program made easy by lexicography
- Reallocation problems in scheduling
- Computing leximin-optimal solutions in constraint networks
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- A new dominance procedure for combinatorial optimization problems
- Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Lexicographic bottleneck problems
- On the lexicographic minimax approach to location problems
- Robust discrete optimization and network flows
- Adjustable robust solutions of uncertain linear programs
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Binary decision rules for multistage adaptive mixed-integer optimization
- A theory and algorithms for combinatorial reoptimization
- Ideal representations of lexicographic orderings and base-2 expansions of integer variables
- Integer programming for minimal perturbation problems in university course timetabling
- Robust scheduling with budgeted uncertainty
- Theory and Applications of Robust Optimization
- Online Scheduling with Bounded Migration
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures
- Lexicographically Minimum and Maximum Load Linear Programming Problems
- K-Adaptability in Two-Stage Robust Binary Programming
- The Price of Robustness
- The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
- Candidate to Job Allocation Problem with a Lexicographic Objective
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- Generalized Lexicographic MultiObjective Combinatorial Optimization. Application to Cryptography
- Finite Adaptability in Multistage Linear Optimization
- On the Robust Knapsack Problem
- Bounds on Multiprocessing Timing Anomalies
- The Nucleolus of a Characteristic Function Game
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Benchmarking optimization software with performance profiles.
