|
Algorithm for Solving Parallel Machines Scheduling Problemto Minimize Earliness and Tardiness Costs |
|---|---|
| รหัสดีโอไอ | |
| Creator | Pensiri Sompong |
| Title | Algorithm for Solving Parallel Machines Scheduling Problemto Minimize Earliness and Tardiness Costs |
| Publisher | King Mongkut's Institute of Technology Ladkrabang |
| Publication Year | 2563 |
| Journal Title | Current Applied Science and Technology |
| Journal Vol. | 20 |
| Journal No. | 2 |
| Page no. | 186-197 |
| Keyword | population-based incremental learning algorithm, scheduling, parallel machines, earliness, tardiness |
| URL Website | https://www.tci-thaijo.org/index.php/cast |
| Website title | https://www.tci-thaijo.org/index.php |
| ISSN | 2586-9396 |
| Abstract | Algorithm for parallel machines scheduling problem to minimize the earliness and tardiness costs is proposed in this study. The problem is associated with the assignment of jobs to machines and determination of staring time for each job in a given sequence. Population-based incremental learning (PBIL) algorithm is used to allocate the jobs to machines. The optimal timing algorithm based on the minimum block cost function calculation is then employed to decide the starting time of jobs on each machine. To illustrate the performance of proposed algorithm, numerical examples generated randomly are tested. The numerical results obtained from PBIL combined with optimal timing algorithm called PBILOTA are compared to EDDPM (Earliest Due Date for Parallel Machines) to indicate the decrease in penalty cost. From the experimental results, it is shown that PBILOTA is an efficient algorithm for solving parallel machines scheduling problem with earliness-tardiness costs minimization. |
