A note on the optimality of index priority rules for search and sequencing problems
From MaRDI portal
Publication:5392799
DOI10.1002/nav.20442zbMath1209.90177OpenAlexW2169371815MaRDI QIDQ5392799
Kyparisis, George J., Christos P. Koulamas
Publication date: 14 April 2011
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20442
Related Items
Cites Work
- Optimal strategies for a class of constrained sequential problems
- Minimizing the total weighted completion time of deteriorating jobs
- Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
- Scheduling Deteriorating Jobs on a Single Processor
- Sequencing with Series-Parallel Precedence Constraints
- A Remark on Search and Sequencing Problems
- A Characterization of the Rau Class of Sequential Problems
- Dynamic Recomputation Cannot Extend the Optimality-Range of Priority Indices
- Technical Note—Minimizing a Function of Permutations of n Integers