Abstract
This study considers the machine scheduling problem with limited waiting time constraints. We examine the machine environment of the open-shop, job-shop, flow-shop, and permutation flow-shop, and uses makespan as a measure performance. Eight mixed binary integer programming models are developed to optimally solve these problems.
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.
