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 …

A physical internet-based manufacturing system (π-MS) converts traditionally “dumb” jobs
and machines into interconnected and initiative individuals, undoubtedly enhancing …

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 …

Currently, integrated scheduling algorithms schedule processes using fixed rules, making it
difficult to balance serial and parallel processes in product craftsmanship trees while …

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 …

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 …

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 …

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 …