The following pages link to Nengmin Wang (Q319208):
Displaying 20 items.
- Analysis of the bullwhip effect in two parallel supply chains with interacting price-sensitive demands (Q319212) (← links)
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
- Shipper collaboration in forward and reverse logistics (Q781076) (← links)
- Simulated annealing and tabu search for multi-mode project payment scheduling (Q1042041) (← links)
- Variable neighbourhood search and tabu search for a discrete time/cost trade-off problem to minimize the maximal cash flow gap (Q1652132) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- Integrated inventory routing problem with quality time windows and loading cost for deteriorating items under discrete time (Q1718618) (← links)
- A location-inventory-routing problem in forward and reverse logistics network design (Q1727487) (← links)
- Line-of-credit payment scheme and its impact on the retailer's ordering policy with inventory-level-dependent demand (Q1793113) (← links)
- Reverse revenue sharing contract versus two-part tariff contract under a closed-loop supply chain system (Q1793306) (← links)
- Design of a multiobjective reverse logistics network considering the cost and service level (Q1955359) (← links)
- Multimode time-cost-robustness trade-off project scheduling problem under uncertainty (Q2156293) (← links)
- Tabu search and simulated annealing for resource-constrained multi-project scheduling to minimize maximal cash flow gap (Q2666666) (← links)
- (Q3538318) (← links)
- (Q4996288) (← links)
- Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain (Q6070502) (← links)
- A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services (Q6106599) (← links)
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382) (← links)
- Tabu search for proactive project scheduling problem with flexible resources (Q6164385) (← links)
- A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective (Q6568412) (← links)
