A branch and bound algorithm for disassembly scheduling with assembly product structure

DOI10.1057/PALGRAVE.JORS.2602568MaRDI QIDQ3617337zbMATH OpenOpenAlexFDO

Authors

Publication date 23 March 2009

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2602568

zbMATH Keywords

environmental studiesoptimal algorithmproduction and scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• KI 2005: Advances in Artificial Intelligence
• A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
• A two-stage heuristic for disassembly scheduling with assembly product structure
• Capacitated disassembly scheduling with random demand
• Scheduling disassembly

Cited in

(17)

• A branch and bound algorithm for the two-stage assembly scheduling problem
• A branch and bound algorithm for a production scheduling problem in an assembly system under due date constraints
• Capacitated disassembly scheduling under stochastic yield and demand
• Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times
• A novel decomposition-based method for solving general-product structure assemble-to-order systems
• Towards circular economy in production planning: challenges and opportunities
• On the cooperation of recycling operations
• Capacitated disassembly scheduling with random demand
• Job-shop production scheduling with reverse flows
• An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
• A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints
• Machine Scheduling for Multi-product Disassembly
• A two-stage heuristic for disassembly scheduling with assembly product structure
• Disassembly scheduling: literature review and future research directions
• KI 2005: Advances in Artificial Intelligence
• Integrated disassembly and reprocessing lot-sizing for multi-level structured products in remanufacturing systems
• Disassembly line optimization with reinforcement learning

This page was built for publication: A branch and bound algorithm for disassembly scheduling with assembly product structure

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