In real-life applications, neither all the inputs of an algorithm are available at the outset, as in
an offline framework, nor do they occur one by one in order, as in an online setup. Semi …

This research was sponsored by Natural Science Foundation of China (NSFC Grant no.
71401075). We thank Professor Xiuli Wang and Ding Zhang for their valuable discussions …

In this paper, we study the online scheduling of linear deteriorating jobs on a single machine
to minimize the total weighted completion time. In the problem, a set of n independent linear …

In this paper, we focus on a semi-online scheduling problem with rejection on identical
parallel machines, where “semi-online” means that the ratio of the longest processing time …

The identical parallel machine scheduling problem with the objective of minimizing total
weighted completion time is considered in the online setting where jobs arrive over time. An …

We consider the online scheduling on a single machine, in which jobs are released over
time and each job can be either accepted and scheduled on the machine or rejected under …

We consider the classical online scheduling problem over single and parallel machines with
the objective of minimizing total weighted flow time. We employ an intuitive and systematic …

Online scheduling on identical machines is investigated in the setting where jobs arrive over
time. The goal is to minimize the total completion time. A waiting strategy based online …

Polling systems have been widely studied, however most of these studies focus on polling
systems with renewal processes for arrivals and random variables for service times. There is …

In this paper, a single-machine semi-online scheduling problem with rejection is addressed.
In this model,“semi-online” implies that p max p min≤ γ, where p max and p min are the …