Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems

DOI10.1145/321906.321917zbMath0329.68056OpenAlexW2100172689MaRDI QIDQ4095888

Herbert D. Schwetman, V. Yun-Shen Shen, K. L. Krause

Publication date: 1975

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321906.321917

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35) Algorithms in computer science (68W99)

Related Items (35)

Models for video-on-demand scheduling with costs ⋮ Algorithms for on-line bin-packing problems with cardinality constraints ⋮ Bounds for online bin packing with cardinality constraints ⋮ The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints ⋮ Polynomial time approximation schemes for class-constrained packing problems ⋮ New trends in machine scheduling ⋮ Probabilistic analysis of a bin covering algorithm ⋮ On-line bin packing ? A restricted survey ⋮ Selfish bin packing with cardinality constraints ⋮ Online bin packing with cardinality constraints resolved ⋮ EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ Scheduling unit-time tasks in renewable resource constrained flowshops ⋮ Approximate strong separation with application in fractional graph coloring and preemptive scheduling. ⋮ Approximation schemes for packing splittable items with cardinality constraints ⋮ Bin packing with general cost structures ⋮ Improved results for a memory allocation problem ⋮ Colored bin packing: online algorithms and lower bounds ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ Bin covering with cardinality constraints ⋮ Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules ⋮ Online interval coloring with packing constraints ⋮ Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ An approximation algorithm for the general max-min resource sharing problem ⋮ Class constrained bin packing revisited ⋮ Lower bounds for several online variants of bin packing ⋮ Approximation Schemes for Packing Splittable Items with Cardinality Constraints ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Unnamed Item ⋮ Approximation scheduling algorithms: a survey ⋮ A linear time algorithm for restricted bin packing and scheduling problems ⋮ A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Improved lower bounds for the online bin packing problem with cardinality constraints ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

This page was built for publication: Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems