A Genetic Algorithm with Random Keys Approach for the Job Shop Scheduling Problem with Earliness and Tardiness

Leonardo Bedoya-Valencia, Elkin Rodriguez-Velásquez, Ghaith Rabadi Old Dominion University, Universidad Nacional de Colombia, Old Dominion University

Abstract:

The problem addressed in this paper is the Job Shop Scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date for a set of jobs. This objective became very significant after the introduction of the Just-in-time manufacturing approach. The paper presents some preliminary properties of the problem, which are used in addition to a Genetic Algorithm with Random Keys to solve this difficult problem. Finally preliminary results of the approach are reported and some concluding remarks are presented

Key words:

Job Shop Scheduling, Earliness and Tardiness, Common Due Date, Genetics Algorithm, Random Keys.

745