The following pages link to Naval Research Logistics (NRL) (Q2781051):
Displaying 50 items.
- Bayesian inference based on partial monitoring of components with applications to preventive system maintenance (Q2781052) (← links)
- An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria (Q2781054) (← links)
- An integer programming model for the weekly tour scheduling problem (Q2781056) (← links)
- Reliability of a 2-dimensional<i>k</i>-within-consecutive-<i>r</i>×<i>s</i>-out-of-<i>m</i>×<i>n</i>:F system (Q2781057) (← links)
- Timing of information acquisition in a competitive environment (Q2808488) (← links)
- The solution to an open problem for a caching game (Q2808489) (← links)
- A characterization of optimal base-stock levels for a multistage serial supply chain (Q2808490) (← links)
- Expansion planning for waste-to-energy systems using waste forecast prediction sets (Q2808492) (← links)
- Evergreening and operational risk under price competition (Q2808493) (← links)
- The quay crane scheduling problem with time windows (Q2892125) (← links)
- Efficient sequential decision-making algorithms for container inspection operations (Q2892126) (← links)
- Concavity and monotonicity properties in a groundwater management model (Q2892128) (← links)
- Batch scheduling on a two-machine jobshop with machine-dependent setup times (Q2892129) (← links)
- Approximation methods for the analysis of a multicomponent, multiproduct assemble-to-order system (Q2892130) (← links)
- A note on equity across groups in facility location (Q2892131) (← links)
- An exact analysis of a joint production-inventory problem in two-echelon inventory systems (Q2892132) (← links)
- Allocating capacity in parallel queues to improve their resilience to deliberate attack (Q2892133) (← links)
- Monitoring the market or the salesperson? The value of information in a multilayer supply chain (Q2892134) (← links)
- Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time (Q2892135) (← links)
- Benders' cuts guided large neighborhood search for the traveling umpire problem (Q2892136) (← links)
- Performance analysis of queue length monitoring of M/G/1 systems (Q2892137) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles (Q2892139) (← links)
- Cyclic scheduling in robotic flowshops with bounded work-in-process levels (Q2994797) (← links)
- Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
- Call center arrival modeling: A Bayesian state-space approach (Q2994799) (← links)
- Optimal control of a capacitated inventory system with multiple demand classes (Q2994800) (← links)
- Inventory control in divergent supply chains with time-based dispatching and shipment consolidation (Q2994801) (← links)
- A stochastic approximation algorithm to compute bid prices for joint capacity allocation and overbooking over an airline network (Q3005832) (← links)
- Signature based analysis of <i>m</i> -Consecutive-<i>k</i> -out-of-<i>n</i> : <i>F</i> systems with exchangeable components (Q3005833) (← links)
- Inventory management with advance capacity information (Q3005834) (← links)
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production (Q3005835) (← links)
- The reset disambiguation policy for navigating stochastic obstacle fields (Q3005837) (← links)
- Periodic review inventory management with contingent use of two freight modes with fixed costs (Q3005839) (← links)
- Rectilinear <i>m</i> -Center problem (Q3035110) (← links)
- Split delivery routing (Q3035116) (← links)
- Nonperiodic preventive maintenance for repairable systems (Q3065624) (← links)
- Some elementary ideas concerning the complexity of system structure (Q3065625) (← links)
- An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations (Q3065626) (← links)
- The one-warehouse multiretailer problem with an order-up-to level inventory policy (Q3065627) (← links)
- Analytic solution for the nucleolus of a three-player cooperative game (Q3065628) (← links)
- Supply chain coordination with shelf-space and retail price dependent demand and heterogeneous retailers (Q3065630) (← links)
- Potential impact of recharging plug-in hybrid electric vehicles on locational marginal prices (Q3065631) (← links)
- Route optimization for multiple searchers (Q3065632) (← links)
- Decomposing inventory routing problems with approximate value functions (Q3065633) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- On the optimality of the sequential approach for network design problems of service operations (Q3120077) (← links)
- Utility-based shortfall risk: Efficient computations via Monte Carlo (Q3120078) (← links)
- Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents (Q3120079) (← links)
- A new computation method for signature: Markov process method (Q3120080) (← links)
