Abstract
Scheduling is one of the most important problems in production planning systems. It is a decision-making process that plays a crucial role in many Industries. Different scheduling environments were addressed in the literature. Among them Flexible job-shop problem (FJSP) is an important one and it is an extension of the classical JSP that allows one operation which can be processed on one machine out of a set of alternative machines. It is closer to the real manufacturing situation. Because of the additional needs to determine the assignment of operations on the machines, FJSP is more complex than JSP, and incorporates all the difficulties and complexities of JSP. This chapter addresses a hybrid genetic scatter search algorithm for solving multi-objective FJSP. Makespan and flow time are the objective functions considered in this chapter. The computational results prove the effectiveness of the proposed algorithm for solving flexible job-shop scheduling problem.
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.
