scientific article; zbMATH DE number 1175392
From MaRDI portal
Publication:4398247
Recommendations
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
Cited in
(7)- Project network models with discounted cash flows a guided tour through recent developments
- PSPLIB -- a project scheduling problem library
- Resource-constrained project scheduling: A survey of recent developments.
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A competitive branch-and-bound algorithm for the simple assembly line balancing problem
- Large neighborhood search for an aeronautical assembly line time-constrained scheduling problem with multiple modes and a resource leveling objective
- The sequence-dependent assembly line balancing problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398247)