The Job Shop Scheduling Problem (JSSP) is a method which assigns multiple jobs to various machines. The large dimension of JSSP and the dynamic manufacturing environment have always been a difficult problem to optimize due to its size and complexity. In this study, three objective functions are selected namely, minimizing makespan, minimizing total cost and maximizing machine utilization. Genetic Algorithm (GA) is used to solve this scheduling problem. Lot size optimization technique is investigated for the potential of optimizing the makespan, total cost, and machine utilization objectives. Global Criterion (GC) Technique is implemented which can optimize multiple objectives all at once and obtain the best schedule. Finally, a case study is presented.

This content is only available via PDF.
You do not currently have access to this content.