Abstract
A time-partitioning scheme with constant job-mix divisions (“stages”) is presented. The scheme is the basis for using a combination of linear programming and heuristic to solve the dynamic optimisation problem of job allocation through an algorithm which also incorporates the set-up times. The algorithm uses a pull logistic towards the due dates. The results of a case study of a single operation job-shop, indicate increased utilisation of machine tools, reduced work-in-process inventory and additional free capacity owing to reduced makespan of jobs. Application of the algorithm can be extended to multiple-operation job shops, which are common in industrial practice.
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 callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
