Hesam Saiedy - Young Researchers Club (YRC), Islamic Azad University, Central Tehran Branch, Tehran, Iran
Sarem Deilami Moezi - Young Researchers Club (YRC), Islamic Azad University, Central Tehran Branch, Tehran, Iran
Masoumeh Mollashakouri - Department of Ind. Engineering, Eyvanekey Ins. of higher Education
Saeid Ghasemi - Department of Industrial Management,Islamic Azad University, Saveh, Iran

Analysis of single machine scheduling problems,taking earliness and tardiness penalties into consideration, is one of the most applicable problems in the field of scheduling. In just in time (JIT) productionsystems, the objective is to sequence and schedule all thejobs so that the total earliness and tardiness be minimized. Scheduling based on the due date is an important and competitive task in the production plants.This paper addresses the one-machine schedulingproblem with earliness and tardiness penalties. We propose integer nonlinear programming model (INLP) that can solve instances with up to 30 jobs and genetic algorithm that can solve instances more than 50 jobs.

Genetic Algorithm, Integer Nonlinear Program, Earliness and Tardiness, Single Machine Scheduling, Setup Cost