scientific article; zbMATH DE number 3825547

MaRDI QIDQ3670910zbMATH OpenFDO

Authors Vyacheslav Tanaev, V. S. Gordon

Publication date 1983

zbMATH Keywords

algorithmcompletion timecomputational complexityminimax problemsn-job one-machine maximum cost schedulingprecedence constraintspreemptions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(6)

• A note on optimal assignment of slack due-dates in single-machine scheduling
• Optimal assignment of due-dates for preemptive single-machine scheduling
• Single machine scheduling with precedence constraints and positionally dependent processing times
• Vyacheslav Tanaev: contributions to scheduling and related areas
• Scheduling with due date assignment under special conditions on job processing
• Scheduling problems with partially ordered jobs

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 Q3670910)