The following pages link to Xiangtong Qi (Q333101):
Displaying 37 items.
- A two-stage supply chain with demand sensitive to price, delivery time, and reliability of delivery (Q333102) (← links)
- An order-centric treatment of the Bayesian supermodular game (Q378757) (← links)
- Dynamic lot sizing for multiple products with a new joint replenishment model (Q418100) (← links)
- Inventory control with Markovian capacity and the option of order rejection (Q858401) (← links)
- Order splitting with multiple capacitated suppliers (Q859919) (← links)
- A note on worst-case performance of heuristics for maintenance scheduling problems (Q868400) (← links)
- An acquisition policy for a multi-supplier system with a finite-time horizon (Q875424) (← links)
- Parallel machine scheduling with multiple unloading servers (Q983625) (← links)
- Strategic wholesale pricing in a supply chain with a potential entrant (Q1039788) (← links)
- Vehicle scheduling with combinable delivery and pickup operations (Q1043247) (← links)
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method (Q1291768) (← links)
- Single machine scheduling to minimize weighted earliness subject to maximum tardiness (Q1373894) (← links)
- Single machine scheduling with assignable due dates (Q1613425) (← links)
- On scheduling with non-increasing time slot cost to minimize total weighted completion time (Q1702736) (← links)
- Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
- Earliness and tardiness scheduling problems on a batch processor (Q1961238) (← links)
- On sales effort and pricing decisions under alternative risk criteria (Q2030303) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- Storage space allocation models for inbound containers in an automatic container terminal (Q2253538) (← links)
- On the cooperation of recycling operations (Q2256148) (← links)
- Machine scheduling with soft precedence constraints (Q2282538) (← links)
- Production scheduling with subcontracting: the subcontractor's pricing game (Q2434307) (← links)
- The nonatomic supermodular game (Q2437842) (← links)
- Generating labor requirements and rosters for mail handlers using simulation and optimization (Q2489309) (← links)
- Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
- (Q3169982) (← links)
- Class Scheduling for Pilot Training (Q3637416) (← links)
- A nonatomic‐game model for timing clearance sales under competition (Q4632845) (← links)
- Scheduling parallel machines with inclusive processing set restrictions and job rejection (Q4632951) (← links)
- Evasion policies for a vessel being chased by pirate skiffs (Q4632985) (← links)
- (Q4660472) (← links)
- A logistics scheduling model: Inventory cost reduction by batching (Q4680426) (← links)
- Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)
- Scheduling with variable time slot costs (Q5189246) (← links)
- Disruption management in production planning (Q5318284) (← links)
- A Production-Inventory System with Markovian Capacity and Outsourcing Option (Q5322092) (← links)
- Stabilizing grand cooperation via cost adjustment: an inverse optimization approach (Q6580547) (← links)
