Abstract
We investigate the potential of the parallelised Lagrangean approximation procedure (PLAP) for certain combinatorial optimisation problems in manufacturing systems. The framework of a PLAP is proposed for some combinatorial manufacturing problems which are decomposable into well-structured subproblems. The synchronous PLAP for the multistage dynamic lot-sizing problem is implemented on a parallel computer (Alliant FX/4) and its computational experience is reported as a promising application of vector-concurrent computing.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
