10 Result(s)
within
English
Convex and Discrete Geometry
Operations Research/Decision Theory
Optimization
Yiwei Jiang
Article
-
Article
Single-machine multitasking scheduling with job efficiency promotion
Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the pr...
-
Article
MapReduce machine covering problem on a small number of machines
We study machine covering problem in MapReduce system. Each job consists of two sets of tasks, namely the map tasks and reduce tasks. A job’s reduce tasks can only be processed after all its map tasks are fini...
-
Article
Total completion time minimization in online hierarchical scheduling of unit-size jobs
This paper investigates an online hierarchical scheduling problem on m parallel identical machines. Our goal is to minimize the total completion time of all jobs. Each job has a unit processing time and a hierarc...
-
Article
Single-server parallel-machine scheduling with loading and unloading times
We consider a scheduling problem in which jobs are processed on two identical parallel machines that share a common server that loads and unloads jobs on them. Each job has to be loaded by the server before be...
-
Article
Better approximation algorithms for influence maximization in online social networks
Influence maximization is a classic and hot topic in social networks. In this paper, firstly we argue that in online social networks, due to the time sensitivity of popular topics, the assumption in IC or LT m...
-
Article
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
This paper considers an online hierarchical scheduling problem on two parallel identical machines. The objective is to minimize the makspan. It is assumed that all jobs have bounded processing times in between ...
-
Article
Algorithms with limited number of preemptions for scheduling on parallel machines
In previous study on comparing the makespan of the schedule allowed to be preempted at most i times and that of the optimal schedule with unlimited number of preemptions, the worst case ratio was usually obtained...
-
Article
Online coupon consumption problem
Nowadays, it is popular that the dealer makes profits by selling a kind of discount coupons, which can be used as money to purchase commodities with total cost less than or equal to the face value of the coup...
-
Article
Online scheduling on parallel machines with two GoS levels
This paper investigates the online scheduling problem on parallel and identical machines with a new feature that service requests from various customers are entitled to many different grade of service (GoS) l...
-
Article
Preemptive Machine Covering on Parallel Machines
This paper investigates the preemptive parallel machine scheduling to maximize the minimum machine completion time. We first show the off-line version can be solved in O(mn) time for general m-uniform-machine cas...
