scientific article
From MaRDI portal
Publication:3309440
zbMath0528.90048MaRDI QIDQ3309440
Publication date: 1982
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 very fast tabu search algorithm for the permutation flow shop problem with makespan criterion ⋮ Adjustment of heads and tails for the job-shop problem ⋮ On the combinatorial structure of the permutation flow shop problem ⋮ Heuristic procedures for minimizing makespan and the number of required pallets ⋮ Insertion techniques for the heuristic solution of the job shop problem ⋮ Heuristics for permutation flow shop scheduling with batch setup times
