64 results on '"Xu, Yinfeng"'
Search Results
2. The price of anarchy for a berth allocation game
3. Online car-sharing problem with variable booking times
4. Single machine scheduling with uncertain processing times and carbon emission constraint in the shared manufacturing environment
5. Online k-color spanning disk problems
6. Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
7. Competitive algorithm for scheduling of sharing machines with rental discount
8. Heuristics for cross-docking scheduling of truck arrivals, truck departures and shop-floor operations
9. Online scheduling of car-sharing request pairs between two locations
10. Online machine minimization with lookahead
11. Estimating seasonal habitat suitability for migratory species in the Bohai Sea and Yellow Sea: A case study of Tanaka’s snailfish (Liparis tanakae)
12. Spatial differentiation and influence mechanism of the connection-distribution performance of urban high-speed railway hub in the Yangtze River Economic Belt
13. Multiple sink location problem in path networks with a combinational objective
14. Bi-objective optimization for a two-depot automated storage/retrieval system
15. Coordination mechanisms for scheduling selfish jobs with favorite machines
16. Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles
17. Efficient algorithms for computing one or two discrete centers hitting a set of line segments
18. The mixed center location problem
19. Online leasing problem with price fluctuations under the consumer price index
20. Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
21. Creating an acceptable consensus ranking for group decision making
22. Identification of a novel phospholipase D gene and effects of carbon sources on its expression in Bacillus cereus ZY12
23. A randomized competitive group testing procedure
24. Online covering salesman problem
25. The longest commonly positioned increasing subsequences problem
26. Online MapReduce processing on two identical parallel machines
27. Fibonacci helps to evacuate from a convex region in a grid network
28. Online MapReduce scheduling problem of minimizing the makespan
29. Online makespan minimization in MapReduce-like systems with complex reduce tasks
30. Machine scheduling with a maintenance interval and job delivery coordination
31. Online integrated production–distribution scheduling problems without preemption
32. Minimax regret vertex 2-sink location problem in dynamic path networks
33. Optimal algorithm for semi-online scheduling on two machines under GoS levels
34. How much the grid network and rescuers’ communication can improve the rescue efficiency in worst-case analysis
35. An incremental version of the k-center problem on boundary of a convex polygon
36. Online traveling salesman problem with deadlines and service flexibility
37. Consistency issues of interval pairwise comparison matrices
38. The online k -server problem with max-distance objective
39. Optimal shortest path set problem in undirected graphs
40. Consensus-Based Group Decision Making Under Multi-granular Unbalanced 2-Tuple Linguistic Preference Relations
41. Online scheduling with immediate and reliable lead-time quotation
42. An approximation algorithm for k-center problem on a convex polygon
43. An efficient FPRAS type group testing procedure to approximate the number of defectives
44. Competitive analysis for make-to-order scheduling with reliable lead time quotation
45. Measuring consistency of linguistic preference relations: a 2-tuple linguistic approach
46. The k-Canadian Travelers Problem with communication
47. Optimal algorithms for online time series search and one-way trading with interrelated prices
48. An optimal online algorithm for single machine scheduling to minimize total general completion time
49. Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
50. An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.