Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan
This paper discusses the multiple jobs scheduling problem with simultaneous resources. The problem involves one or more jobs with each job consist of a set of operations. Each operation is performed by more than one resource simultaneously. Number of units of each resource used for performing an ope...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Petra Christian University
2015-12-01
|
| Series: | Jurnal Teknik Industri |
| Online Access: | http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/19408 |
| _version_ | 1798045173818589184 |
|---|---|
| author | Suprayogi Suprayogi Valentine Valentine |
| author_facet | Suprayogi Suprayogi Valentine Valentine |
| author_sort | Suprayogi Suprayogi |
| collection | DOAJ |
| description | This paper discusses the multiple jobs scheduling problem with simultaneous resources. The problem involves one or more jobs with each job consist of a set of operations. Each operation is performed by more than one resource simultaneously. Number of units of each resource used for performing an operation is one or more units. The problem deals with determining a schedule of operations minimizing total weighted tardiness. In this paper, solution techniques based on Lagrangian relaxation are proposed. In general, the Lagrangian relaxation technique consists of three parts run iteratively, i.e., (1) solving individual job problems, (2) obtaining a feasible solution, and (3) solving a Lagrangian dual problem. For solving the individual job problems, two approaches are applied, i.e., enumeration and dynamic program¬ming. In this paper, the Lagrangian relaxation technique using the enumeration and dynamic programming approaches are called RL1 and RL2, respectively. The solution techniques proposed are examined using a set of hypothetical instances. Numerical experiments are carried out to compare the performance of RL1, RL2, and two others solution techniques (optimal and genetic algorithm techniques). Numerical experiments show that RL2 is more efficient than RL1. In terms of the solution quality, it is shown that RL2 gives same results compared to the optimal technique and genetic algorithm. However, both RL2 and genetic algorithm can handle larger problems efficiently. |
| first_indexed | 2024-04-11T23:17:33Z |
| format | Article |
| id | doaj.art-401b20f412c8488d87b29512cec1cac9 |
| institution | Directory Open Access Journal |
| issn | 1411-2485 2087-7439 |
| language | English |
| last_indexed | 2024-04-11T23:17:33Z |
| publishDate | 2015-12-01 |
| publisher | Petra Christian University |
| record_format | Article |
| series | Jurnal Teknik Industri |
| spelling | doaj.art-401b20f412c8488d87b29512cec1cac92022-12-22T03:57:35ZengPetra Christian UniversityJurnal Teknik Industri1411-24852087-74392015-12-011727180Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya SimultanSuprayogi Suprayogi0Valentine Valentine1 Kelompok Keahlian Sistem Industri dan Tekno Eko-nomi, Fakultas Teknologi Industri, Institut Teknologi Ban¬dung, Bandung Program Studi Sarjana Teknik Industri, Fakultas Teknologi Industri, Institut Teknologi Bandung, Bandung This paper discusses the multiple jobs scheduling problem with simultaneous resources. The problem involves one or more jobs with each job consist of a set of operations. Each operation is performed by more than one resource simultaneously. Number of units of each resource used for performing an operation is one or more units. The problem deals with determining a schedule of operations minimizing total weighted tardiness. In this paper, solution techniques based on Lagrangian relaxation are proposed. In general, the Lagrangian relaxation technique consists of three parts run iteratively, i.e., (1) solving individual job problems, (2) obtaining a feasible solution, and (3) solving a Lagrangian dual problem. For solving the individual job problems, two approaches are applied, i.e., enumeration and dynamic program¬ming. In this paper, the Lagrangian relaxation technique using the enumeration and dynamic programming approaches are called RL1 and RL2, respectively. The solution techniques proposed are examined using a set of hypothetical instances. Numerical experiments are carried out to compare the performance of RL1, RL2, and two others solution techniques (optimal and genetic algorithm techniques). Numerical experiments show that RL2 is more efficient than RL1. In terms of the solution quality, it is shown that RL2 gives same results compared to the optimal technique and genetic algorithm. However, both RL2 and genetic algorithm can handle larger problems efficiently.http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/19408 |
| spellingShingle | Suprayogi Suprayogi Valentine Valentine Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan Jurnal Teknik Industri |
| title | Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan |
| title_full | Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan |
| title_fullStr | Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan |
| title_full_unstemmed | Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan |
| title_short | Teknik Relaksasi Lagrange untuk Penjadwalan Pekerjaan Majemuk dengan Penggunaan Sumberdaya Simultan |
| title_sort | teknik relaksasi lagrange untuk penjadwalan pekerjaan majemuk dengan penggunaan sumberdaya simultan |
| url | http://puslit2.petra.ac.id/ejournal/index.php/ind/article/view/19408 |
| work_keys_str_mv | AT suprayogisuprayogi teknikrelaksasilagrangeuntukpenjadwalanpekerjaanmajemukdenganpenggunaansumberdayasimultan AT valentinevalentine teknikrelaksasilagrangeuntukpenjadwalanpekerjaanmajemukdenganpenggunaansumberdayasimultan |