Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
From MaRDI portal
Publication:4062914
DOI10.1287/mnsc.21.9.989zbMath0306.90034OpenAlexW2153182330MaRDI QIDQ4062914
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
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Hamilton-Jacobi theories (49L99)
Related Items
Simple heuristics for scheduling with limited intermediate storage ⋮ The scheduling problem where multiple machines compete for a common local buffer ⋮ Flowshop sequencing problems with limited buffer storage ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ Scheduling flexible flow lines with no in-process buffers ⋮ A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE ⋮ Heuristic methods and applications: A categorized survey ⋮ An optimization-based heuristic for the robotic cell problem ⋮ A review of TSP based approaches for flowshop scheduling ⋮ A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
