Population based search heuristics for scheduling job shops associated with multiple routings

Abstract

This thesis addresses two different models of job shop scheduling newlineapplications that are associated with multiple routings The first application is newlinethe well known scheduling model generally addressed in the literature as newlineFlexible job shop scheduling problem FJSP which belongs to the category newlineof toughest NPhard problems The second scheduling model addressed in newlinethis thesis is based on the production environment of a capital goods industry newlinein which the components of different products are processed and assembled in newlinean assembly job shop type environment The processing operations on all newlinecomponents in the model also consider alternative routing option This newlineproblem is therefore addressed as assembly job shop scheduling associated newlinewith multiple routings AJSP which is much more complex than FJSP newline newline