Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Yinfeng Xu
Information about the author Yinfeng Xu will soon be added to the site.
Found
23 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Fibonacci helps to evacuate from a convex region in a grid network
2017
This study considers an evacuation problem where the evacuees try to escape to the...
Machine scheduling with a maintenance interval and job delivery coordination
2016
We investigate a scheduling problem with job delivery coordination in which the...
Online inventory replenishment scheduling of temporary orders
2013
This paper studies the online inventory replenishment scheduling problem, in which...
Online scheduling with immediate and reliable lead-time quotation
2014
This paper studies an online scheduling problem with immediate and reliable lead-time...
Competitive analysis for make‐to‐order scheduling with reliable lead time quotation
2014
This paper makes extended studies on the discrete problem of online scheduling and...
The k‐Canadian Travelers Problem with communication
2013
This paper studies a variation of the online k ‐Canadian Traveler Problem ( k...
Online traveling salesman problem with deadline and advanced information
2012
We consider the online version of the traveling salesman problem, where instances are...
Numerical scales generated individually for analytic hierarchy process
2013
Because individual interpretations of the analytic hierarchy process (AHP) linguistic...
Online interval scheduling on a single machine with finite lookahead
2013
We study an online weighted interval scheduling problem on a single machine, where all...
Online algorithms for the multiple time series search problem
2012
This work investigates the online multiple time series search problem. Given a storage...
Optimal algorithms for online time series search and one‐way trading with interrelated prices
2012
The basic models of online time series search and one-way trading are introduced by...
An optimal online algorithm for single machine scheduling to minimize total general completion time
2012
We study the online problem of single machine scheduling to minimize total general...
Online deadline scheduling with preemption penalties
2011
This paper presents a study of the problem of online deadline scheduling under the...
Semi‐online scheduling on 2 machines under a grade of service provision with bounded processing times
2011
We study the problem of semi‐online scheduling on 2 machines under a grade of...
An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
2010
This paper deals with a two-machine open shop scheduling problem. The objective is to...
The canadian traveller problem and its competitive analysis
2009
From the online point of view, we study the Canadian Traveller Problem (CTP), in which...
How much can lookahead help in online single machine scheduling?
2008
This paper studies online single machine scheduling where jobs have unit length and...
On convergence of expert group thought
2006
Group decision making is one of the most effective methods to resolve complex decision...
The most vital edge of the shortest path with incomplete information in traffic networks
2006
There are always many road blockages caused by unexpected events such as accident or...
Online Canadian traveler problem with stochastic blockage recovery time
2005
The online Canadian Traveler Problem is considered for the case when the traveler...
Mixed strategy research on the online recoverable Canadian traveler problem on one road
2005
The online recoverable Canadian traveler problem on one road is considered for the...
Online recoverable Canadian traveler problem on a continuous network
2004
The online Recoverable Canadian Traveler Problem is considered for the case when the...
Models and algorithms for dissimilar path routing problem
2001
The dissimilar path routing problem is to find spatially dissimilar paths between two...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers