scientific article
From MaRDI portal
Publication:3713852
zbMath0586.90055MaRDI QIDQ3713852
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycyclic systemminimuml-length scheduletwo-machine arbitrary systemwithout interrupting the operations
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
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
This page was built for publication: