The problem addressed in this paper is the impression allocation planning of Guaranteed Targeted Display Advertising (GTDA) problem in online display advertising market. In this problem, a publisher desires (1) an even spread of impressions, i.e., ad exposures, across various audience segments,...

We study an online scheduling problem on a single machine with delivery times. The problem is online in the sense that all jobs arrive over time. Each job's characteristics, such as processing time and delivery time, become known at its arrival time. Preemption is not allowed and once the...

Battery electric buses (BEBs) are rapidly being embraced by public transit agencies due to their sustainable and economic benefits. At this stage, the insufficient number of charging piles and the unreasonable allocation of charging resources are highlighted，which seriously affect the safety...

Battery electric buses (BEBs) are rapidly being embraced by public transit agencies due to their sustainable and economic benefits. At present, due to the insufficient number of charging piles and the unreasonable allocation of charging resources, such phenomena as BEBs charging congestion and...

This work studies a variant of the online generalized assignment problem, where there are m⩾2 heterogeneous servers to process n requests which arrive one by one over time. Each request must either be assigned to one of the servers or be rejected upon its arrival, before knowing any...

Batch processing machine scheduling in uncertain environment attracts more and more attention in the last decade. This paper deals with semi-online scheduling on two parallel batch processing machines with non-decreasing processing time of job. Jobs arrive over time in the online paradigm, and...