The following pages link to W. Matthew Carlyle (Q880494):
Displaying 18 items.
- Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems (Q880496) (← links)
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
- Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations (Q2496079) (← links)
- Allocating capacity in parallel queues to improve their resilience to deliberate attack (Q2892133) (← links)
- Interdicting a Nuclear-Weapons Project (Q3100392) (← links)
- Solving the Nearly Symmetric All-Pairs Shortest-Path Problem (Q3386762) (← links)
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems (Q3548726) (← links)
- Optimizing the US Navy's combat logistics force (Q3612303) (← links)
- Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility (Q4497252) (← links)
- (Q4546398) (← links)
- Constructing nearly orthogonal latin hypercubes for any nonsaturated run-variable combination (Q4635200) (← links)
- Solving a multistage partial inspection problem using genetic algorithms (Q4656119) (← links)
- Bin covering algorithms in the second stage of the lot to order matching problem (Q4658513) (← links)
- Heuristics for minimizing total weighted tardiness in complex job shops (Q4681151) (← links)
- (Q4789914) (← links)
- Near-shortest and K-shortest simple paths (Q5318272) (← links)
- A Two-Sided Optimization for Theater Ballistic Missile Defense (Q5322135) (← links)
