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

DOI10.1016/0305-0548(94)00056-EzbMath0827.90118OpenAlexW2058390426MaRDI QIDQ1892667

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)

Related Items (1)

Improving the performance of enumerative search methods. II: Computational experiments

Cites Work

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

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