Multi-objective optimal job shop scheduling under machine breakdowns

Abstract

This paper describes the job shop scheduling of a wood factory under machine breakdowns. In this research, the multiple objective optimization was applied to Job shop Scheduling under machine breakdowns problem. Traditionally, there were some objectives including Minimize Makespan, Minimize Mean Flowtime, Minimize total tardiness, Minimize number of Tardy Jobs. These objectives, however, are not enough for facing with the real problems when the manager wants more than one goal. The problem was formulated as a Linear Programming Problem (LPP ). A Compromise Programming (CP) approach was used to solve the multi-objectives problem, to have the best compromise scheduling among the mentioned objectives. The program would help the company increase the performance of the work shop, then increase profits. Keywords: Multiple Objective Optimization, Job shop Scheduling Problem, Linear Programming Problem, Compromise Programming.