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 …
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 …
owing to utilizing the strength of different architectures for offering higher performance. In this …
Makespan minimization in online scheduling with machine eligibility
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 …
with machine eligibility constraints and the makespan as objective function. We first give a …
Research on initiative scheduling mode for a physical internet-based manufacturing system
J Wang, G Fan, F Yan, Y Zhang, S Sun - The International Journal of …, 2016 - Springer
A physical internet-based manufacturing system (π-MS) converts traditionally “dumb” jobs
and machines into interconnected and initiative individuals, undoubtedly enhancing …
and machines into interconnected and initiative individuals, undoubtedly enhancing …
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
Z Xu, D Xu - Journal of Scheduling, 2018 - Springer
We consider a single-machine tool change scheduling problem where tool change
durations are workload-dependent. The processing times of all the jobs are the same. The …
durations are workload-dependent. The processing times of all the jobs are the same. The …
Time‐selective integrated scheduling algorithm with backtracking adaptation strategy
X Zhang, Z Xie, Y Xin, J Yang - Expert Systems, 2019 - Wiley Online Library
Currently, integrated scheduling algorithms schedule processes using fixed rules, making it
difficult to balance serial and parallel processes in product craftsmanship trees while …
difficult to balance serial and parallel processes in product craftsmanship trees while …
Dynamic scheduling with uncertain job types
Uncertain job types can arise as a result of predictive or diagnostic inaccuracy in healthcare
or repair service systems and unknown preferences in matching service systems. In this …
or repair service systems and unknown preferences in matching service systems. In this …
Online scheduling of two job types on a set of multipurpose machines
We study an online-list scheduling problem on a set of m multipurpose machines for which
the objective is to minimize the makespan. It is assumed that there are two different job …
the objective is to minimize the makespan. It is assumed that there are two different job …
Online scheduling of jobs with favorite machines
A long distance link may cause high data latency in cloud computing systems, and thus a
computing task may be processed faster by nearby servers than distant servers. To address …
computing task may be processed faster by nearby servers than distant servers. To address …
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
The focus of this paper is to increase our understanding of the Longest Processing Time
First (LPT) heuristic. LPT is a classical heuristic for the fundamental problem of uniform …
First (LPT) heuristic. LPT is a classical heuristic for the fundamental problem of uniform …