Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems

DOI10.1007/978-3-319-59861-1_12zbMath1384.90127OpenAlexW2703939895MaRDI QIDQ4609785

Elad Iwanir, Tami Tamir

Publication date: 26 March 2018

Published in: Recent Advances in Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59861-1_12

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

On Lagrangian relaxation for constrained maximization and reoptimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal cost reconfiguration of data placement in a storage area network
• Reoptimization of minimum and maximum traveling salesman's tours
• A theory and algorithms for combinatorial reoptimization
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling independent tasks to reduce mean finishing time
• Reoptimization of the Minimum Total Flow-Time Scheduling Problem
• Separator based sparsification for dynamic planar graph algorithms
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• Introduction to evolutionary computing
• Theory of genetic algorithms
• Load rebalancing games in dynamic systems with migration costs

This page was built for publication: Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems