scientific article

zbMATH Open0495.68031MaRDI QIDQ3959420FDOQ3959420

Eugene L. Lawler

Publication date: 1982

Title of this publication is not available (Why is that?)

zbMATH Keywords

general two machine problemintree problemnonpreemptive scheduling of unit-time jobspolynomial time-bounded algorithmstwo-machine problem with equal release dates

Mathematics Subject Classification ID

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)

Cited In (15)

• Rational preemptive scheduling
• Linear and quadratic algorithms for scheduling chains and opposite chains
• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
• Performance of Coffman-Graham schedules in the presence of unit communication delays
• Nearly on line scheduling of preemptive independent tasks
• Is a unit-job shop not easier than identical parallel machines?
• Ideal schedules in parallel machine settings
• Scheduling with limited machine availability
• Jackson's pseudo-preemptive schedule and cumulative scheduling problems
• Makespan minimization with OR-precedence constraints
• Preemptive scheduling of interval orders is polynomial
• New directions in scheduling theory
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Algorithms for scheduling with integer preemptions on parallel machines to minimize the maximum lateness
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3959420)