Scheduling Tasks to Minimize Active Time on a Processor with Unlimited Capacity

Fong, Ken C.K.; Li, Minming; Li, Yungao; Poon, Sheung-Hung; Wu, Weiwei; Zhao, Yingchao

doi:10.1007/978-3-319-55911-7_18

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

2024

Publication Types

Select...

Article1

Book1

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More closely related to our problem is the version with unlimited capacity, i.e. B = ∞, studied, e.g., by Fong et al [11]. They presented a polynomial-time algorithm for agreeable deadlines, i.e., instances where any job's deadline is prior to every other job's deadline that has a later release time.…”

Section: Related Workmentioning

confidence: 99%

Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability

Gottschau

Leichter

2022

Algorithmica

View full text Add to dashboard Cite

The minimum hitting set of bundles problem (Mhsb) is a natural generalization of the minimum hitting set problem, where instead of hitting single elements, bundles of elements are hit. More specifically, we are given a ground set of elements and a family of sets. Every set in this family contains bundles of elements, which are subsets of the ground set. The task is to find a collection of elements of minimum size such that at least one bundle of every set in the family is hit. Motivated by several applications, we consider Mhsb restricted to interval and 2-dimensional interval bundles. We study the computational complexity and give polynomial-time algorithms for several classes of instances with these special structured bundles.

show abstract

Section: Related Workmentioning

confidence: 99%