Scheduling unit-time tasks with integer release times and deadlines
From MaRDI portal
Publication:1838035
DOI10.1016/0020-0190(83)90117-5zbMath0508.68023OpenAlexW2010177685MaRDI QIDQ1838035
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90117-5
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Efficient algorithms for robustness in resource allocation and scheduling problems, Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, Minimizing variation of production rates in just-in-time systems: A survey, An efficient algorithm for a job shop problem, Open shop problem with zero-one time operations and integer release date/deadline intervals, A linear time algorithm for maximum matchings in convex, bipartite graphs, Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity, Probabilistic single processor scheduling, A model for minimizing active processor time, Some results concerning the complexity of restricted colorings of graphs, A note on ``Scheduling unit-time tasks with integer release times and deadlines, Stochastic scheduling to minimize expected maximum lateness, Feasibility analysis under fixed priority scheduling with limited preemptions, Jackson's semi-preemptive scheduling on a single machine, About one algorithm for solving scheduling problem, Interval vertex-coloring of a graph with forbidden colors, A linear-time algorithm for a special case of disjoint set union, Decision Incorporation in Meta-heuristics to Cope with Decision Scheduling Problems
Cites Work
