scientific article; zbMATH DE number 3941255

MaRDI QIDQ3713852zbMATH OpenFDO

Authors Vadim G. Timkovsky

Publication date 1985

zbMATH Keywords

complexitycyclic systemminimuml-length scheduletwo-machine arbitrary systemwithout interrupting the operations

Mathematics Subject Classification ID

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

Recommendations

• The complexity of cyclic shop scheduling problems
• On The Complexity Of The Process Shop
• Some complexity results in cyclic scheduling
• The complexity of scheduling jobs in repetitive manufacturing systems
• scientific article; zbMATH DE number 22879

Cited in

(6)

• An ordered independence system and its applications to scheduling problems
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• 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
• Job-shop scheduling with blocking and no-wait constraints
• Steady states in the scheduling of discrete-time systems

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