Solution of the Akers-Friedman Scheduling Problem
From MaRDI portal
Publication:3281502
DOI10.1287/opre.8.6.782zbMath0100.15102OpenAlexW2066740230MaRDI QIDQ3281502
Publication date: 1960
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.8.6.782
Related Items
On some sequencing problems ⋮ NP-hardness of shop-scheduling problems with three jobs ⋮ An efficient algorithm for the job-shop problem with two jobs ⋮ Parallel dedicated machines scheduling with chain precedence constraints ⋮ Parameterized mixed graph coloring ⋮ The complexity of two-job shop problems with multi-purpose unrelated machines. ⋮ Job-shop scheduling with multi-purpose machines ⋮ Complexity of mixed shop scheduling problems: A survey ⋮ The complexity of shop-scheduling problems with two or three jobs ⋮ Complexity of shop-scheduling problems with fixed number of jobs: a survey ⋮ A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems ⋮ Lower bounds for the job-shop scheduling problem on multi-purpose machines ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function ⋮ Scheduling two jobs with fixed and nonfixed routes
