Multi-objective Job Shop Scheduling Using Pre-emptive Constraint Procedure

In this paper, a multi-objective job shop scheduling through the pre-emptive constraint procedure has been formulated to optimize makespan, total earliness and total tardiness. The effectiveness of the model is studied through eighteen 3J*3M and three 10J*10M problems. The model is solved using Mosel language with Xpress software