scientific article; zbMATH DE number 858989
From MaRDI portal
Publication:4872475
zbMath0860.90073MaRDI QIDQ4872475
Publication date: 21 March 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Tabu search for the job-shop scheduling problem with multi-purpose machines