The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(199903/04)2:2<79::AID-JOS19>3.0.CO;2-H" /><79::AID-JOS19>3.0.CO;2-H 10.1002/(SICI)1099-1425(199903/04)2:2<79::AID-JOS19>3.0.CO;2-HzbMath0973.90036OpenAlexW2032015314MaRDI QIDQ1592285

R. Smith

Publication date: 5 December 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(199903/04)2:2<79::aid-jos19>3.0.co;2-h

zbMATH Keywords

heuristicsgenetic algorithmslocal searchapproximate evaluationwarehouse scheduling

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty ⋮ 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

Cites Work

• Unnamed Item
• A fast tabu search algorithm for the permutation flow-shop problem
• Evolution based learning in a job shop scheduling environment
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling