Scheduling with processing set restrictions: A literature update

JYT Leung, CL Li - International Journal of Production Economics, 2016 - Elsevier
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 …

Real-time scheduling and analysis of parallel tasks on heterogeneous multi-cores

S Chang, X Zhao, Z Liu, Q Deng - Journal of Systems Architecture, 2020 - Elsevier
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 …

Makespan minimization in online scheduling with machine eligibility

K Lee, JYT Leung, ML Pinedo - 4OR, 2010 - Springer
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 …

Response time bounds for typed DAG parallel tasks on heterogeneous multi-cores

M Han, N Guan, J Sun, Q He, Q Deng… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Heterogenerous multi-cores utilize the strength of different architectures for executing
particular types of workload, and usually offer higher performance and energy efficiency. In …

Single machine scheduling with two competing agents and equal job processing times

D Oron, D Shabtay, G Steiner - European Journal of Operational Research, 2015 - Elsevier
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 …

Online hierarchical parallel-machine scheduling in shared manufacturing to minimize the total completion time

Q Wei, Y Wu, TCE Cheng, F Sun… - Journal of the Operational …, 2023 - Taylor & Francis
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 …

[HTML][HTML] Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times

D Shabtay, K Arviv - Applied Mathematical Modelling, 2016 - Elsevier
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 …

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times

O Dover, D Shabtay - Annals of Operations Research, 2016 - Springer
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 …

Online packing of arbitrary sized items into designated and multipurpose bins

N Goldberg, S Karhi - European Journal of Operational Research, 2019 - Elsevier
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 …

Total completion time minimization in online hierarchical scheduling of unit-size jobs

J Hu, Y Jiang, P Zhou, A Zhang, Q Zhang - Journal of Combinatorial …, 2017 - Springer
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 …