Abstract
In this paper, a heuristic algorithm for solving job scheduling/parts routing problems in an FMS with time-varying demands is presented. The algorithm is suitable for scheduling a small manufacturing system which processes contracted parts for outside companies or for department which processes for other departments in the organization. Numerical examples are presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
