Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
From MaRDI portal
Publication:5469668
DOI10.1057/palgrave.jors.2602033zbMath1089.90029OpenAlexW2055936243MaRDI QIDQ5469668
Publication date: 26 May 2006
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602033
Lagrangian relaxationsubgradient methodsurrogate subgradient methodfinite immediate bufferreal-time hybrid flowshop schedulingspeed-up dynamic programming
Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Practical solutions for a dock assignment problem with trailer transportation ⋮ A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs ⋮ A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production ⋮ A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers ⋮ A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations ⋮ The hybrid flow shop scheduling problem ⋮ Optimal solutions for a dock assignment problem with trailer transportation
