The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
From MaRDI portal
(Redirected from Publication:1592285)
Recommendations
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A comparison of local search methods for flow shop scheduling
- Unrelated parallel machine scheduling using local search
- scientific article; zbMATH DE number 1215040
- scientific article; zbMATH DE number 1264429
Cites work
Cited in
(5)- Development of a co-operative distributed process mining system for quality assurance
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
- AFSCN scheduling: how the problem and solution have evolved
- A survey on metaheuristics for stochastic combinatorial optimization
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
This page was built for publication: The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592285)