Note—Sequencing with Finite Intermediate Storage

DOI10.1287/MNSC.23.2.216zbMATH Open0342.90028OpenAlexW2157960673MaRDI QIDQ4110795FDOQ4110795

Authors: Seenu S. Reddi 

Publication date: 1976

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.2.216

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited In (5)

• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• Flowshop sequencing problems with limited buffer storage
• Simple heuristics for scheduling with limited intermediate storage
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE

This page was built for publication: Note—Sequencing with Finite Intermediate Storage

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