Local Search in Complex Scheduling Problems

DOI10.1007/978-3-540-74446-7_18MaRDI QIDQ5429301zbMATH OpenOpenAlexFDO

Authors Thijs Urlings, Rubén Ruiz

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Improving local search heuristics for some scheduling problems. II
• scientific article; zbMATH DE number 805284
• A comparison of local search methods for flow shop scheduling
• Local search algorithms for the multiprocessor flow shop scheduling problem
• scientific article; zbMATH DE number 4091174

Cited in

(14)

• Location, scheduling, design and integer programming
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Improving local search heuristics for some scheduling problems. I
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
• Locally optimal algorithms for designing schedules based on Hopfield networks
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
• The third comprehensive survey on scheduling problems with setup times/costs
• Coupling Stochastic and Deterministic Local Search in Examination Timetabling
• scientific article; zbMATH DE number 4091174 (Why is no real title available?)
• scientific article; zbMATH DE number 1054928 (Why is no real title available?)
• scientific article; zbMATH DE number 1054933 (Why is no real title available?)
• Improving local search heuristics for some scheduling problems. II
• Local search approaches for the test laboratory scheduling problem with variable task grouping
• Shifting representation search for hybrid flexible flowline problems

This page was built for publication: Local Search in Complex Scheduling Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429301)