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

DOI10.1002/(SICI)1099-1425(199903/04)2:2%3C79::AID-JOS19%3E3.0.CO;2-HzbMATH Open0973.90036OpenAlexW2032015314MaRDI QIDQ1592285FDOQ1592285

Authors: 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%3C79::aid-jos19%3E3.0.co;2-h

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

zbMATH Keywords

heuristicslocal searchgenetic algorithmsapproximate evaluationwarehouse scheduling

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A fast tabu search algorithm for the permutation flow-shop problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Evolution based learning in a job shop scheduling environment

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)