• Complex
  • Title
  • Author
  • Keyword
  • Abstract
  • Scholars
High Impact Results & Cited Count Trend for Year Keyword Cloud and Partner Relationship

Query:

学者姓名:徐寅峰

Refining:

Source

Submit Unfold

Co-Author

Submit Unfold

Language

Submit

Clean All

Export Sort by:
Default
  • Default
  • Title
  • Year
  • WOS Cited Count
  • Impact factor
  • Ascending
  • Descending
< Page ,Total 26 >
Selfish load balancing for jobs with favorite machines EI
期刊论文 | 2019 , 47 (1) , 7-11 | Operations Research Letters
Abstract&Keyword Cite

Abstract :

This paper studies the load balancing game for the favorite machine model, where each job has a certain set of favorite machines with the shortest processing time for the job. We obtain tight bounds on the Strong Price of Anarchy (strong PoA) for the general favorite machine model and a special case of the model. Our results generalize the well-known bounds on the strong PoA for the unrelated machine and identical machine models. © 2018 Elsevier B.V.

Keyword :

Identical machines Machine modeling Price of anarchy Shortest Processing Time Tight bound Unrelated machines

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Chen, Cong , Xu, Yinfeng . Selfish load balancing for jobs with favorite machines [J]. | Operations Research Letters , 2019 , 47 (1) : 7-11 .
MLA Chen, Cong 等. "Selfish load balancing for jobs with favorite machines" . | Operations Research Letters 47 . 1 (2019) : 7-11 .
APA Chen, Cong , Xu, Yinfeng . Selfish load balancing for jobs with favorite machines . | Operations Research Letters , 2019 , 47 (1) , 7-11 .
Export to NoteExpress RIS BibTex
Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead EI SCIE Scopus
期刊论文 | 2018 , 36 (2) , 617-636 | JOURNAL OF COMBINATORIAL OPTIMIZATION
Abstract&Keyword Cite

Abstract :

This paper studies an online over-list model of the integrated allocation of berths and quay cranes (QCs) in container terminals with 1-lookahead ability. The objective is to minimize the maximum completion time of container vessels, i.e., the makespan. We focus on two different types of vessels, three berths and a small number of QCs in the hybrid berth layout, with 1-lookahead ability. We propose a -competitive algorithm for the case with four cranes, a 5/4-competitive algorithm for the case with five cranes and a 4/3-competitive algorithm for the case with six cranes, respectively. All of the algorithms are proved to be optimal.

Keyword :

Scheduling Container terminal Online algorithm Lookahead information

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Pan, Jiayin , Xu, Yinfeng , Zhang, Guiqing . Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 36 (2) : 617-636 .
MLA Pan, Jiayin 等. "Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 36 . 2 (2018) : 617-636 .
APA Pan, Jiayin , Xu, Yinfeng , Zhang, Guiqing . Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 36 (2) , 617-636 .
Export to NoteExpress RIS BibTex
Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures EI SSCI CPCI-S SCIE Scopus
会议论文 | 2018 , 67 , 658-676 | IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) held as part of IEEE World Congress on Computational Intelligence (IEEE WCCI)
WoS CC Cited Count: 1
Abstract&Keyword Cite

Abstract :

This study presents a novel minimum deviation ordinal consensus model (MDOCM) for group decision making with heterogeneous preference structures (utility values, preference orderings, multiplicative preference relations and fuzzy preference relations). In this consensus model, the individual derivation methods, associated with different preference structures, are used to obtain the individual preference orderings. Then, the median ranking model is proposed to obtain the group preference ordering, which can ensure to obtain a maximum consensus level among the decision makers when the individual preference orderings are given. Furthermore, we propose the minimum deviation consensus ranking model (MDCRM), which seeks to minimize the ordinal information deviation between the original and adjusted preference orderings in the process of reaching consensus, and study the properties of the optimal solution to MDCRM. Finally, based on the MDCRM, the feedback adjustment rules are presented to help decision makers reach consensus. (C) 2017 Elsevier B.V. All rights reserved.

Keyword :

Heterogeneous preference structures Ordinal consensus model Group decision making Minimum information deviation

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Bowen , Liang, Haiming , Zhang, Guiqing et al. Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures [C] . 2018 : 658-676 .
MLA Zhang, Bowen et al. "Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures" . (2018) : 658-676 .
APA Zhang, Bowen , Liang, Haiming , Zhang, Guiqing , Xu, Yinfeng . Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures . (2018) : 658-676 .
Export to NoteExpress RIS BibTex
A randomized competitive group testing procedure EI SCIE Scopus
期刊论文 | 2018 , 35 (3) , 667-683 | JOURNAL OF COMBINATORIAL OPTIMIZATION
Abstract&Keyword Cite

Abstract :

In many fault detection problems, we want to identify all defective items from a set of n items using the minimum number of tests. Group testing is for the scenario where each test is on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number d of defective items is often unknown in advance. In this paper, we propose a randomized group testing procedure RGT for the scenario where the number d of defectives is unknown in advance, and prove that RGT is competitive. By incorporating numerical results, we obtain improved upper bounds on the expected number of tests performed by RGT, for . In particular, for and the special case where n is a power of 2, we obtain an upper bound of with on the expected number of tests performed by RGT, which is better than the currently best upper bound in Cheng et al. (INFORMS J Comput 26(4):677-689, 2014). We conjecture that the above improved upper bounds based on numerical results from actually hold for all d >= 1.

Keyword :

Group testing Fault detection Expectation Randomized algorithms

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Guiqing , Cheng, Yongxi , Xu, Yinfeng . A randomized competitive group testing procedure [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 35 (3) : 667-683 .
MLA Zhang, Guiqing et al. "A randomized competitive group testing procedure" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 35 . 3 (2018) : 667-683 .
APA Zhang, Guiqing , Cheng, Yongxi , Xu, Yinfeng . A randomized competitive group testing procedure . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 35 (3) , 667-683 .
Export to NoteExpress RIS BibTex
Online MapReduce scheduling problem of minimizing the makespan EI SCIE Scopus
期刊论文 | 2017 , 33 (2) , 590-608 | JOURNAL OF COMBINATORIAL OPTIMIZATION | IF: 0.927
WoS CC Cited Count: 2
Abstract&Keyword Cite

Abstract :

MapReduce system is a popular big data processing framework, and the performance of it is closely related to the efficiency of the centralized scheduler. In practice, the centralized scheduler often has little information in advance, which means each job may be known only after being released. In this paper, hence, we consider the online MapReduce scheduling problem of minimizing the makespan, where jobs are released over time. Both preemptive and non-preemptive version of the problem are considered. In addition, we assume that reduce tasks cannot be parallelized because they are often complex and hard to be decomposed. For the non-preemptive version, we prove the lower bound is , higher than the basic online machine scheduling problem, where k is the root of the equation and m is the quantity of machines. Then we devise an -competitive online algorithm called MF-LPT (Map First-Longest Processing Time) based on the LPT. For the preemptive version, we present a 1-competitive algorithm for two machines.

Keyword :

Online algorithm Big data MapReduce scheduling Makespan

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Chen, Cong , Xu, Yinfeng , Zhu, Yuqing et al. Online MapReduce scheduling problem of minimizing the makespan [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2017 , 33 (2) : 590-608 .
MLA Chen, Cong et al. "Online MapReduce scheduling problem of minimizing the makespan" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 33 . 2 (2017) : 590-608 .
APA Chen, Cong , Xu, Yinfeng , Zhu, Yuqing , Sun, Chengyu . Online MapReduce scheduling problem of minimizing the makespan . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2017 , 33 (2) , 590-608 .
Export to NoteExpress RIS BibTex
Fibonacci helps to evacuate from a convex region in a grid network EI SCIE Scopus
期刊论文 | 2017 , 34 (2) , 398-413 | JOURNAL OF COMBINATORIAL OPTIMIZATION | IF: 0.927
WoS CC Cited Count: 1 SCOPUS Cited Count: 1
Abstract&Keyword Cite

Abstract :

This study considers an evacuation problem where the evacuees try to escape to the boundary of an affected area, which is convex, and a grid network is embedded in the area. The boundary is unknown to the evacuees and we propose an online evacuation strategy based on the Fibonacci sequence. This strategy is proved to have a competitive ratio of 19.5, which is better than the best previously reported result of 21.

Keyword :

Fibonacci sequence Competitive analysis Grid network Evacuation strategy

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Qin, Lan , Xu, Yinfeng . Fibonacci helps to evacuate from a convex region in a grid network [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2017 , 34 (2) : 398-413 .
MLA Qin, Lan et al. "Fibonacci helps to evacuate from a convex region in a grid network" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 34 . 2 (2017) : 398-413 .
APA Qin, Lan , Xu, Yinfeng . Fibonacci helps to evacuate from a convex region in a grid network . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2017 , 34 (2) , 398-413 .
Export to NoteExpress RIS BibTex
Online integrated production-distribution scheduling problems without preemption EI SCIE Scopus
期刊论文 | 2016 , 31 (4) , 1569-1585 | JOURNAL OF COMBINATORIAL OPTIMIZATION | IF: 1.235
WoS CC Cited Count: 1
Abstract&Keyword Cite

Abstract :

We study an integrated production-distribution scheduling problem where jobs are released by customers to a manufacturer over time. The jobs are released online, that is, at any time the information of the number, release and processing times of future jobs is unknown, and the processing time of a job becomes known when the job is released. The manufacturer processes the jobs on a single machine. During the processing of jobs preemption is not allowed. Completed jobs are delivered in batches to customers via sufficient capacitated vehicles. For the objective of minimizing the sum of the total delivery time and the total distribution cost, we present a 3-competitive algorithm for the single-customer case and then extend the result to the multi-customer case. A lower bound of two on the competitive ratio of the problem is also given.

Keyword :

Integrated production-distribution problems Supply chain scheduling Online algorithm Competitive analysis

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Feng, Xin , Cheng, Yongxi , Zheng, Feifeng et al. Online integrated production-distribution scheduling problems without preemption [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2016 , 31 (4) : 1569-1585 .
MLA Feng, Xin et al. "Online integrated production-distribution scheduling problems without preemption" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 31 . 4 (2016) : 1569-1585 .
APA Feng, Xin , Cheng, Yongxi , Zheng, Feifeng , Xu, Yinfeng . Online integrated production-distribution scheduling problems without preemption . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2016 , 31 (4) , 1569-1585 .
Export to NoteExpress RIS BibTex
The Steiner traveling salesman problem with online advanced edge blockages EI SCIE Scopus
期刊论文 | 2016 , 70 , 26-38 | COMPUTERS & OPERATIONS RESEARCH | IF: 2.6
WoS CC Cited Count: 4
Abstract&Keyword Cite

Abstract :

The package delivery in an urban road network is formulated as an online Steiner traveling salesman problem, where the driver (i.e. the salesman) receives road (i.e. edge) blockage messages when he is at a certain distance to the respective blocked edges. Such road blockages are referred to as advanced information. With these online advanced road blockages, the driver wishes to deliver all the packages to their respective customers and returns back to the service depot through a shortest route. During the entire delivery process, there will be at most k road blockages, and they are non-recoverable. When the driver knows about road blockages at a distance alpha OPT, where alpha is an element of [0, 1] is referred to as the forecasting ratio and OPT denotes the length of the offline shortest route, we first prove that max{(1-2 alpha)k+1, 1} is a lower bound on the competitive ratio. We then present a polynomial time online algorithm with a competitive ratio very close to this lower bound. Computational results show that our algorithm is efficient and produces near optimal solutions. Similar results for a variation, in which the driver does not need to return to the service depot, are also achieved. (C) 2015 Elsevier Ltd. All rights reserved.

Keyword :

Advanced edge blockage Online algorithm Steiner TSP Competitive ratio Traveling salesman problem

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Huili , Tong, Weitian , Xu, Yinfeng et al. The Steiner traveling salesman problem with online advanced edge blockages [J]. | COMPUTERS & OPERATIONS RESEARCH , 2016 , 70 : 26-38 .
MLA Zhang, Huili et al. "The Steiner traveling salesman problem with online advanced edge blockages" . | COMPUTERS & OPERATIONS RESEARCH 70 (2016) : 26-38 .
APA Zhang, Huili , Tong, Weitian , Xu, Yinfeng , Lin, Guohui . The Steiner traveling salesman problem with online advanced edge blockages . | COMPUTERS & OPERATIONS RESEARCH , 2016 , 70 , 26-38 .
Export to NoteExpress RIS BibTex
Minimax regret vertex 2-sink location problem in dynamic path networks SCIE
期刊论文 | 2016 , 31 (1) , 79-94 | JOURNAL OF COMBINATORIAL OPTIMIZATION | IF: 1.235
WoS CC Cited Count: 2
Abstract&Keyword Cite

Abstract :

This paper considers the minimax regret vertex 2-sink location problem in a dynamic path network with positive edge lengths and uniform edge capacity. Let be an undirected path graph of vertices, and the weight (initial supply) of every vertex is known as an interval. The problem is to find two vertices and as two sinks on the path such that all the weights can evacuate to and with minimum regret of evacuation time in case of an emergency for any possible weight distribution. We present an time algorithm.

Keyword :

Path network Minimax regret Sink location Algorithm

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Li, Hongmei , Xu, Yinfeng , Ni, Guanqun . Minimax regret vertex 2-sink location problem in dynamic path networks [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2016 , 31 (1) : 79-94 .
MLA Li, Hongmei et al. "Minimax regret vertex 2-sink location problem in dynamic path networks" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 31 . 1 (2016) : 79-94 .
APA Li, Hongmei , Xu, Yinfeng , Ni, Guanqun . Minimax regret vertex 2-sink location problem in dynamic path networks . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2016 , 31 (1) , 79-94 .
Export to NoteExpress RIS BibTex
Optimal algorithm for semi-online scheduling on two machines under GoS levels SCIE
期刊论文 | 2016 , 10 (1) , 207-213 | OPTIMIZATION LETTERS | IF: 1.31
WoS CC Cited Count: 3
Abstract&Keyword Cite

Abstract :

Recently, Liu et al. (J Combin Optim 21:138-149, 2011) studied the semi-online scheduling problem on two machines under a grade of service provision. As the sum of jobs' processing times is known in advance and the processing times are bounded by an interval where , they presented an algorithm which is -competitive when . In this paper, we give a modified algorithm which is shown to be optimal for arbitrary and .

Keyword :

Online scheduling Grade of service Bounded processing times Algorithms Total processing time

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Luo, Taibo , Xu, Yinfeng . Optimal algorithm for semi-online scheduling on two machines under GoS levels [J]. | OPTIMIZATION LETTERS , 2016 , 10 (1) : 207-213 .
MLA Luo, Taibo et al. "Optimal algorithm for semi-online scheduling on two machines under GoS levels" . | OPTIMIZATION LETTERS 10 . 1 (2016) : 207-213 .
APA Luo, Taibo , Xu, Yinfeng . Optimal algorithm for semi-online scheduling on two machines under GoS levels . | OPTIMIZATION LETTERS , 2016 , 10 (1) , 207-213 .
Export to NoteExpress RIS BibTex
10| 20| 50 per page
< Page ,Total 26 >

Export

Results:

Selected

to

Format:
FAQ| About| Online/Total:3276/50777787
Address:XI'AN JIAOTONG UNIVERSITY LIBRARY(No.28, Xianning West Road, Xi'an, Shaanxi Post Code:710049) Contact Us:029-82667865
Copyright:XI'AN JIAOTONG UNIVERSITY LIBRARY Technical Support:Beijing Aegean Software Co., Ltd.