Reoptimization in machine scheduling
From MaRDI portal
Publication:2453159
DOI10.1016/j.tcs.2014.04.004zbMath1350.90017OpenAlexW1988087521MaRDI QIDQ2453159
Nicolas Boria, Frederico Della Croce
Publication date: 6 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.004
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
MP or not MP: that is the question ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Robust reoptimization of Steiner trees ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ Unnamed Item ⋮ A note on the traveling salesman reoptimization problem under vertex insertion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reoptimization of Steiner trees: changing the terminal set
- Fast reoptimization for the minimum spanning tree problem
- Reoptimization of the metric deadline TSP
- New Reoptimization Techniques applied to Steiner Tree Problem
- Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion
- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
- A survey on combinatorial optimization in dynamic environments
- New Advances in Reoptimizing the Minimum Steiner Tree Problem
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
- On the Hardness of Reoptimization with Multiple Given Solutions
- Reoptimization of Steiner Trees
- The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
- Reoptimization of Weighted Graph and Covering Problems
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
- Reoptimizing the traveling salesman problem
- On the Hardness of Reoptimization
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Tight Bounds for Permutation Flow Shop Scheduling
- Scheduling with forbidden sets
- Reoptimization of NP-Hard Problems
This page was built for publication: Reoptimization in machine scheduling
