A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

DOI10.1057/PALGRAVE.JORS.2602094MaRDI QIDQ3433485zbMATH OpenOpenAlexFDO

Authors

Publication date 30 April 2007

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.2602094

zbMATH Keywords

heuristicsenvironmental studiesproduction and scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

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

Cited in

(15)

• Heuristics for solving disassemble-to-order problems with stochastic yields
• A two-stage heuristic for disassembly scheduling with assembly product structure
• A branch and bound algorithm for disassembly scheduling with assembly product structure
• KI 2005: Advances in Artificial Intelligence
• Capacitated disassembly scheduling under stochastic yield and demand
• Planning disassembly for remanufacturing under a rolling schedule environment
• An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
• Towards circular economy in production planning: challenges and opportunities
• A disassemble-to-order heuristic for use with constrained disassembly capacities
• An optimization model and an algorithm for solving lot-sizing disassembly with multi-resource constraints
• Disassembly scheduling: literature review and future research directions
• Capacitated disassembly scheduling with random demand
• Stochastic program for disassembly lot-sizing under uncertain component refurbishing lead times
• Deterministic Search Algorithm for Sequencing and Scheduling
• Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes

This page was built for publication: A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

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