|
A memetic algorithm to minimize the total sumof earliness tardiness and sequence dependent setup costsfor flow shop scheduling problems with job distinct due windows |
|---|---|
| รหัสดีโอไอ | |
| Creator | 1. Anot Chaimanee 2. Wisut Supithak |
| Title | A memetic algorithm to minimize the total sumof earliness tardiness and sequence dependent setup costsfor flow shop scheduling problems with job distinct due windows |
| Publisher | Research and Development Office, Prince of Songkla University |
| Publication Year | 2561 |
| Journal Title | Songklanakarin Journal of Science and Technology |
| Journal Vol. | 40 |
| Journal No. | 5 |
| Page no. | 1203-1218 |
| Keyword | flow shop scheduling, earliness tardiness, due window, optimal timing algorithm, Memetic Algorithm |
| URL Website | http://rdo.psu.ac.th/sjstweb/index.php |
| ISSN | 0125-3395 |
| Abstract | The research considers the flow shop scheduling problem under the Just-In-Time (JIT) philosophy. There are n jobswaiting to be processed through m operations of a flow shop production system. The objective is to determine the job schedulesuch that the total cost consisting of setup, earliness, and tardiness costs, is minimized. To represent the problem, the IntegerLinear Programming (ILP) mathematical model is created. A Memetic Algorithm (MA) is developed to determine the propersolution. The evolutionary procedure, worked as the global search, is applied to seek for the good job sequences. In order toconduct the local search, an optimal timing algorithm is developed and inserted in the procedure to determine the best schedule ofeach job sequence. From the numerical experiment of 360 problems, the proposed MA can provide optimal solutions for 355problems. It is obvious that the MA can provide the good solution in a reasonable amount of time. |
