A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
From MaRDI portal
Publication:5583569
DOI10.1287/opre.15.1.71zbMath0189.19801OpenAlexW2035553821MaRDI QIDQ5583569
Publication date: 1967
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.15.1.71
Related Items
A new integer programming formulation for the permutation flowshop problem, Flowshop sequencing with mean flowtime objective, Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines, Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung, Fuzzy job sequencing for a flow shop, Elimination conditions and lower bounds for the permutation flow-shop sequencing problem, Flowshop scheduling research after five decades, Flowshop/no-idle scheduling to minimize total elapsed time
