scientific article
From MaRDI portal
Publication:3942735
zbMath0483.90052MaRDI QIDQ3942735
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitylinear time algorithmminimization of maximum latenessmakespan problemtwo-machine, unit-time job-shop scheduling
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem ⋮ A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem ⋮ Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem ⋮ Total completion time minimization in two-machine job shops with unit-time operations
