An architecture for solving sequencing and resource allocation problems using approximation methods

DOI10.1057/PALGRAVE.JORS.2600479MaRDI QIDQ3157641zbMATH OpenOpenAlexFDO

Authors

Publication date 19 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600479

zbMATH Keywords

heuristicsoptimisationartificial intelligenceknowledge-based systems

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
• scientific article; zbMATH DE number 1054933
• A general meta-heuristic based solver for combinatorial optimisation problems
• scientific article; zbMATH DE number 4149886
• scientific article; zbMATH DE number 1054925

Cited in

(1)

• A distributed exact algorithm for the multiple resource constrained sequencing problem

This page was built for publication: An architecture for solving sequencing and resource allocation problems using approximation methods

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