Sep 26, 2018 · In the paper, we study the semi-online version of hierarchical scheduling problem on two parallel machines with the objective of maximizing the ...

Given m hierarchical machines and n jobs, each job can only be processed on a subset of the machines and each job can only be processed on a machines.

In this paper, we consider two semi-online models of online early work maximization problem on two hierarchical machines. When a buffer size of K is available, ...

It is proved that no algorithm can have a competitive ratio less than \(2^{k}\) and an optimal semi-online algorithm with competitive ratio is presented.

This paper investigates the semi-online machine covering problem on two hierarchical machines where the jobs are correspondingly classified into two ...

This paper investigates two different semi-online versions of the machine covering, which is the problem of assigning a set of jobs to a system of m(m ≥ 3) ...

Feb 2, 2024 · Semi-online early work maximization problem on two hierarchical machines with partial information of processing time, in W. Wu and H. Du.

Online Early Work Maximization Problem on Two Hierarchical Machines with Buffer or Rearrangements · A Modified List Scheduling Algorithm for the Online ...

Oct 22, 2024 · This paper investigates the semi-online machine covering problem on two hierarchical machines where the jobs are correspondingly classified ...

Jun 25, 2024 · In this study, we investigate several online and semi-online scheduling problems related to two hierarchical machines with a common due date ...