Abstract

Minimization of maximum production time (Makespan) in Flexible Manufacturing Systems (FMS) scheduling problems is an important objective and may result in good system performances. To realize a makespan close to the global minimum production time is a suitable goal for scheduling But answering the question how close this goal can be approached is a very complicated problem. In this paper bottleneck scheduling and Lot Streaming (LS) are used for a Job shop Scheduling Problem (JSP). The new contribution of the paper is applying a Brute Force Method (BFM) to LS. The effect of setup times is considered and numerical example is given.

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

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.