Note—Sequencing with Finite Intermediate Storage

DOI10.1287/mnsc.23.2.216zbMath0342.90028OpenAlexW2157960673MaRDI QIDQ4110795

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

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

Related Items (5)

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

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