scientific article; zbMATH DE number 4033467

MaRDI QIDQ3773680zbMATH OpenFDO

Authors F. J. Radermacher

Publication date 1987

zbMATH Keywords

minimal posetsminimal schedule lengthpartially ordered unit time jobspolynomial time algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4057269
• scientific article; zbMATH DE number 4189460
• The poset scheduling problem
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

Cited in

(1)

• scientific article; zbMATH DE number 4057269 (Why is no real title available?)

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