The following pages link to Lixin Tang (Q203128):
Displaying 50 items.
- Superconvergence of the stable \(P_1\)-\(P_1\) finite element pair for Stokes problem (Q260133) (← links)
- Solution method for the location planning problem of logistics park with variable capacity (Q339598) (← links)
- Open shop scheduling problem to minimize makespan with release dates (Q346082) (← links)
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration (Q632667) (← links)
- A weak finite element method for elliptic problems in one space dimension (Q671124) (← links)
- Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem (Q732906) (← links)
- A hybrid two-stage transportation and batch scheduling problem (Q838180) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling (Q875408) (← links)
- Scheduling a hybrid flowshop with batch production at the last stage (Q875417) (← links)
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
- A mathematical programming model and solution for scheduling production orders in Shanghai Baoshan Iron and Steel Complex (Q884075) (← links)
- Improving the efficiency of iron and steel purchasing using supply chain coordination (Q885680) (← links)
- A branch-and-cut algorithm for factory crane scheduling problem (Q897052) (← links)
- A stabilized finite volume method for Stokes equations using the lowest order \(P_1-P_0\) element pair (Q897464) (← links)
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers (Q955624) (← links)
- The coordination of transportation and batching scheduling (Q965544) (← links)
- A new heuristic for open shop total completion time problem (Q967860) (← links)
- An efficient optimal solution to the coil sequencing problem in electro-galvanizing line (Q976044) (← links)
- A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005) (← links)
- Scheduling of a single crane in batch annealing process (Q1017463) (← links)
- Simultaneously scheduling multiple turns for steel color-coating production (Q1042046) (← links)
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times (Q1046715) (← links)
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763) (← links)
- A Benders decomposition-based framework for solving quay crane scheduling problems (Q1622801) (← links)
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem (Q1652147) (← links)
- Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse (Q1683060) (← links)
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine (Q1694914) (← links)
- A stochastic production planning problem with nonlinear cost (Q1761117) (← links)
- A mathematical programming model for scheduling steelmaking-continuous casting production (Q1969846) (← links)
- An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability (Q2029972) (← links)
- A reinforcement learning approach for dynamic multi-objective optimization (Q2055564) (← links)
- A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times (Q2270448) (← links)
- Multiple crane scheduling in a batch annealing process with no-delay constraints for machine unloading (Q2293995) (← links)
- Minimizing makespan in a two-machine flowshop scheduling with batching and release time (Q2390059) (← links)
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions (Q2442081) (← links)
- A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time (Q2499163) (← links)
- Modeling and solution of the joint quay crane and truck scheduling problem (Q2514750) (← links)
- MOEA/D with a self-adaptive weight vector adjustment strategy based on chain segmentation (Q2663461) (← links)
- (Q2704501) (← links)
- (Q2725092) (← links)
- Finite volume method for the variational inequalities of first and second kinds (Q2795404) (← links)
- Integrated Charge Batching and Casting Width Selection at Baosteel (Q2931698) (← links)
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production (Q3005835) (← links)
- (Q3052478) (← links)
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates (Q3102810) (← links)
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan (Q3102811) (← links)
- Models and algorithms for shuffling problems in steel plants (Q3120577) (← links)
- (Q3193570) (← links)
- (Q3414243) (← links)
