The ASALB Problem with Processing Alternatives Involving Different Tasks: Definition, Formalization and Resolution
From MaRDI portal
Publication:3600132
DOI10.1007/11751595_59zbMath1172.90376OpenAlexW1515078400MaRDI QIDQ3600132
Rafael Pastor, Liliana Capacho
Publication date: 10 February 2009
Published in: Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/6059
Related Items (5)
A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs ⋮ Second order conic approximation for disassembly line design with joint probabilistic constraints ⋮ Production scheduling with alternative process plans ⋮ Optimally solving the alternative subgraphs assembly line balancing problem ⋮ An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem
This page was built for publication: The ASALB Problem with Processing Alternatives Involving Different Tasks: Definition, Formalization and Resolution
