A Remark on Search and Sequencing Problems
From MaRDI portal
Publication:3968748
DOI10.1287/moor.7.1.154zbMath0502.90049OpenAlexW2000364179MaRDI QIDQ3968748
Publication date: 1982
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.7.1.154
sequential optimizationsearch modeltwo-machine maximum completion time flow-shop problemsingle machine sequencing problemcommon algorithm
Related Items (9)
Optimal search for one of many objects hidden in two boxes ⋮ Continuous and discrete search for one of many objects ⋮ A note on the optimality of index priority rules for search and sequencing problems ⋮ Time-critical testing and search problems ⋮ Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods ⋮ Minimum-cost diagnostic strategies for \(k\)-out-of-\(n\) systems with imperfect tests ⋮ Star search -- a different show ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ A decomposition theory based on a dominance relation and composite jobs
This page was built for publication: A Remark on Search and Sequencing Problems
