Moving policies in cyclic assembly line scheduling
From MaRDI portal
(Redirected from Publication:820155)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1956210 (Why is no real title available?)
- Faster exact algorithms for hard problems: A parameterized point of view
- Production planning problems in printed circuit board assembly
Cited in
(7)- Parameterized and Exact Computation
- Assembly line balancing: what happened in the last fifteen years?
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- Combining matheuristics and MILP to solve the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints
- A new MILP model for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
This page was built for publication: Moving policies in cyclic assembly line scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820155)