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.71zbMATH Open0189.19801OpenAlexW2035553821MaRDI QIDQ5583569FDOQ5583569
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
Cited In (8)
- Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung
- A new integer programming formulation for the permutation flowshop problem
- Elimination conditions and lower bounds for the permutation flow-shop sequencing problem
- Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
- Flowshop/no-idle scheduling to minimize total elapsed time
- Flowshop sequencing with mean flowtime objective
- Flowshop scheduling research after five decades
- Fuzzy job sequencing for a flow shop
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)
