Operations Research, Systems Engineering and Industrial Engineering Commons^™

Heuristic And Exact Algorithms For The Two-Machine Just In Time Job Shop Scheduling Problem, Mohammed Al Salem, Leonardo Bedoya-Valencia, Ghaith Rabadi

Engineering Management & Systems Engineering Faculty Publications

The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal 1 (unweighted problem). This objective became very significant after the introduction of the Just in Time manufacturing approach. A procedure to determine whether the CDD is restricted or unrestricted is developed and a semirestricted CDD is defined. Algorithms are introduced to find the optimal solution when the CDD is unrestricted and semirestricted. When the CDD is restricted, which is a much …