In 2008, we published a survey paper on machine scheduling with processing set
restrictions [Leung, JY-T., Li, C.-L., 2008. Scheduling with processing set restrictions: a …

Heterogeneous multi-cores and parallel architectures have recently gained much attention
owing to utilizing the strength of different architectures for offering higher performance. In this …

In this paper we provide a survey of online scheduling in parallel machine environments
with machine eligibility constraints and the makespan as objective function. We first give a …

Heterogenerous multi-cores utilize the strength of different architectures for executing
particular types of workload, and usually offer higher performance and energy efficiency. In …

We study various two-agent scheduling problems on a single machine with equal job
processing times. The equal processing time assumption enables us to design new …

We consider online hierarchical scheduling on m identical machines in shared
manufacturing to minimize the total completion time. Each job has a unit-size processing …

We study a robotic three-machine flow-shop scheduling problem, in which n identical jobs
are to be processed and the objective is to minimize the makespan. After the job's …

We study various single machine scheduling problems with two competing agents, unit
processing times and arbitrary integer release dates. The problems differ by the scheduling …

We consider an online multitype bin-packing problem with two item types. This setting can
be motivated by transport applications in which some items may be shipped either in dry …

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 …