A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop

DOI10.1287/OPRE.15.1.71MaRDI QIDQ5583569zbMATH OpenOpenAlexFDO

Authors Richard D. Smith, R. Dudek

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

zbMATH Keywords

operations research

Cited in

(8)

• Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung
• Flowshop scheduling research after five decades
• Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
• Flowshop/no-idle scheduling to minimize total elapsed time
• Flowshop sequencing with mean flowtime objective
• A new integer programming formulation for the permutation flowshop problem
• Fuzzy job sequencing for a flow shop
• Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines

This page was built for publication: A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583569)