A Remark on Search and Sequencing Problems

DOI10.1287/MOOR.7.1.154MaRDI QIDQ3968748zbMATH OpenOpenAlexFDO

Authors Frank Kelly

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

zbMATH Keywords

common algorithmsearch modelsequential optimizationsingle machine sequencing problemtwo-machine maximum completion time flow-shop problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Cited in

(11)

• Optimal search for one of many objects hidden in two boxes
• Continuous and discrete search for one of many objects
• Star search -- a different show
• 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
• A decomposition theory based on a dominance relation and composite jobs
• Time-critical testing and search problems
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• A note on the optimality of index priority rules for search and sequencing problems
• Theory and methodology of time-dependent scheduling: past, present and future
• Sequential testing in sparse precedence networks

This page was built for publication: A Remark on Search and Sequencing Problems

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