Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage

DOI10.1287/MNSC.21.9.989MaRDI QIDQ4062914zbMATH OpenOpenAlexFDO

Authors Sujit K. Dutta, Andrew A. Cunningham

Publication date 1975

Published in Management Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hamilton-Jacobi theories (49L99) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited in

(11)

• An optimization-based heuristic for the robotic cell problem
• The scheduling problem where multiple machines compete for a common local buffer
• Heuristic methods and applications: A categorized survey
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• A review of TSP based approaches for flowshop scheduling
• Flowshop sequencing problems with limited buffer storage
• A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE
• Scheduling flexible flow lines with no in-process buffers
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• Simple heuristics for scheduling with limited intermediate storage
• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations

This page was built for publication: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage

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