Local Search in Complex Scheduling Problems
From MaRDI portal
Publication:5429301
DOI10.1007/978-3-540-74446-7_18zbMath1134.90395OpenAlexW1488184025MaRDI QIDQ5429301
Publication date: 29 November 2007
Published in: Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74446-7_18
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems ⋮ Shifting representation search for hybrid flexible flowline problems
This page was built for publication: Local Search in Complex Scheduling Problems
