Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Feifeng Zheng
Information about the author Feifeng Zheng will soon be added to the site.
Found
13 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A new randomized algorithm for group testing with unknown number of defective items
2015
In many fault detection problems, we want to identify defective items from a set of n...
A new strongly competitive group testing algorithm with small sequentiality
2015
In many fault detection problems, we want to identify all defective items from a...
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...
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...
An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
2012
This paper consider m uniform (parallel) machine scheduling with linear deterioration...
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...
Online deadline scheduling with preemption penalties
2011
This paper presents a study of the problem of online deadline scheduling under the...
Hybrid evolutionary algorithms in a SVR traffic flow forecasting model
2011
Accurate urban traffic flow forecasting is critical to intelligent transportation...
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...
How much can lookahead help in online single machine scheduling?
2008
This paper studies online single machine scheduling where jobs have unit length and...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers