scientific article
From MaRDI portal
Publication:3737196
zbMath0601.90082MaRDI QIDQ3737196
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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, Efficient algorithms for flexible job shop scheduling with parallel machines, Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem, Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
