Improving the performance of enumerative search methods. I: Exploiting structure and intelligence

DOI10.1016/0305-0548(94)00056-EMaRDI QIDQ1892667zbMATH OpenOpenAlexFDO

Authors Adam Fadlalla, James R. Evans

Publication date 19 June 1995

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(94)00056-e

zbMATH Keywords

branch-and-bound algorithmsenumerative searchmean tardiness job sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Improving the performance of enumerative search methods. II: Computational experiments
• Branch and bound methods for a search problem
• Resolution search
• Revisiting branch and bound search strategies for machine scheduling problems
• scientific article; zbMATH DE number 43711

Cites work

• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• A decomposition algorithm for the single machine total tardiness problem
• A dual algorithm for the one-machine scheduling problem
• A greedy heuristic for the mean tardiness sequencing problem
• Future paths for integer programming and links to artificial intelligence
• Minimizing Total Costs in One-Machine Scheduling
• Modeling and integer programming techniques applied to propositional calculus
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Structural analysis of local search heuristics in combinatorial optimization
• Tabu Search—Part I
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling

Cited in

(7)

• Embedding branch and bound within evolutionary algorithms
• Improving the performance of enumerative search methods. II: Computational experiments
• \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
• Revisiting branch and bound search strategies for machine scheduling problems
• scientific article; zbMATH DE number 43711 (Why is no real title available?)
• Resolution search
• Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems.

This page was built for publication: Improving the performance of enumerative search methods. I: Exploiting structure and intelligence

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