Abstract
This paper deals with the open shop scheduling problem (OSP) with makespan minimization. An exact dynamic programming algorithm is proposed for solving the OSP to optimality. This approach is applied to the OSP for the first time. Computational results show that the proposed algorithm is able to solve moderate benchmark instances.
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
