Analysis of Scheduling Problem on Two Machines with Partial Precedence Order on the Set of Jobs
Abstract
In this paper, we consider an NP-hard problem of scheduling a set of jobs of equal processing time on two machines, given a partial precedence order on the set of jobs, with an objective to minimize the makespan. An approximation algorithm is proposed for this problem with a tight approximation bound. Polynomial solvability of the problem is proved in the case when each job on the first machine is in precedence relation with two jobs on the second machine.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.