|
Abstract
|
Article Information:
Minimizing Earliness and Tardiness Penalties in a Single Machine Scheduling Against Common Due Date using Genetic Algorithm
Milad Yousefi and Rosnah Mohd Yusuff
Corresponding Author: Milad Yousefi
Submitted: January 14, 2012
Accepted: February 02, 2012
Published: May 01, 2012 |
Abstract:
|
Scheduling problems involving both earliness and tardiness costs became more important in recent
years. This kind of problems include both earliness and tardiness penalties and tries to reduce them. In this
study a case study from real world is investigated. Since the machine is bottle neck in the production line and
all jobs have a common restrictive due date and different earliness and tardiness penalties, the problem is NPhard.
In this study a discrete Genetic Algorithm (GA) is successfully implemented to find an optimum
scheduling for the production line. The results show the effectiveness of the proposed algorithm in finding near
optimal solution.
Key words: Earliness/tardiness, genetic algorithm, optimization, scheduling, single machine, ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Milad Yousefi and Rosnah Mohd Yusuff, . Minimizing Earliness and Tardiness Penalties in a Single Machine Scheduling Against Common Due Date using Genetic Algorithm. Research Journal of Applied Sciences, Engineering and Technology, (09): 1205-1210.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
