Abstract
We address the problem of releasing jobs to the factory floor while meeting delivery dates and minimizing the work-in-process inventory. Heuristic algorithms were developed that used an efficient, detailed shop-floor scheduling model to determine the release times of new jobs. The process starts with the current shop floor conditions and determines the sequencing of both in-process and new jobs on machines in order to minimize the maximum lateness (L max ). The approach is tractable for industrial-sized problems and provides solutions close to a calculated lower bound for WIP. Computational experience is given.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
