scientific article
From MaRDI portal
Publication:3959420
zbMath0495.68031MaRDI QIDQ3959420
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
general two machine problemintree problemnonpreemptive scheduling of unit-time jobspolynomial time-bounded algorithmstwo-machine problem with equal release dates
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (15)
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Nearly on line scheduling of preemptive independent tasks ⋮ Rational preemptive scheduling ⋮ Performance of Coffman-Graham schedules in the presence of unit communication delays ⋮ Is a unit-job shop not easier than identical parallel machines? ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ Preemptive scheduling of interval orders is polynomial ⋮ Scheduling with limited machine availability ⋮ Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness ⋮ Jackson's pseudo-preemptive schedule and cumulative scheduling problems ⋮ Ideal schedules in parallel machine settings ⋮ Preemptive scheduling with variable profile, precedence constraints and due dates ⋮ Makespan minimization with OR-precedence constraints ⋮ New directions in scheduling theory ⋮ Linear and quadratic algorithms for scheduling chains and opposite chains
This page was built for publication:
