Abstract
PurposeThe purpose of this paper is to optimise the job shop scheduling problem using simulation and genetic algorithm.Design/methodology/approachThe paper presents a simulation‐based genetic algorithm approach for the job shop scheduling problem. In total, three cases have been considered to access the performance of the job shop, with an objective to minimise mean tardiness and makespan. A restart scheme is embedded into regular genetic algorithm in order to avoid premature convergence.FindingsSimulation‐based genetic algorithm can be used for job shop scheduling problems. Moreover, a restart scheme embedded into a regular genetic algorithm results in improvement in the fitness value. Single process plans selected on the basis of minimum production time criterion results in improved shop performance, as compared to single process plans selected randomly. Moreover, availability of multiple process plans during scheduling improves system performance measures.Originality/valueThe paper presents a simulation‐based genetic algorithm approach for job shop scheduling problem, with and without restart scheme. In this paper the effect of multiple process plans over single process plans, as well as criterion for selection of single process plans, are studied. The findings should be taken into account while designing scheduling systems for job shop environments.
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.
