Abstract
This research aims to make a step-by-step process to determine the most optimal completion time for the Flexible Job Shop Scheduling case. Flexible Job Shop Scheduling which not only aims to sequence operations on jobs but also chooses the machine to be used in processing an operation makes this scheduling more complicated than ordinary Job Shop Scheduling. This scheduling involves interval-shaped gray numbers to accommodate uncertainty in job ordering time. This further extends the complexity of scheduling. To solve this case a metaheuristic algorithm namely Tabu Search will be used. This algorithm uses mutation on the solution a number of iterations until it produces the best solution. The use of a tabu list in the Tabu Search algorithm to ensure the search is not trapped in the local minimum.
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.
