scientific article
From MaRDI portal
Publication:3313598
zbMath0531.90047MaRDI QIDQ3313598
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardnessworst case behaviorno wait in processsolvable special casesthree machine minimum makespan permutation flowshoptwo surrogate machine heuristics
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
Scheduling algorithms for flexible flowshops: Worst and average case performance, Performance of scheduling algorithms for no-wait flowshops with parallel machines
