| Autor: |
Nordin, S. Z., Saipol, H. F. S., Johar, F. |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2024, Vol. 2895 Issue 1, p1-9, 9p |
| Abstrakt: |
Scheduling is the assignment of different resources with the intention of organising and managing to discover an optimisation in the work process. The emergence of job shop scheduling problems has a significant impact on many industries, particularly manufacturing because these problems have an impact on the sector's productivity and profitability. It is crucial to improve the approach taken to solve the job shop scheduling problem in order to maximise manufacturing productivity and reduce costs. The tabu search algorithm, one of the metaheuristic techniques, has been chosen to improve the disjunctive programming strategy used to solve the job shop scheduling problem. Disjunctive programming is solved using the Lingo software provides the initial solution. Then, by swapping the jobs on critical paths, the neighborhood structure's makespan value is improved. The makespan value has been improved by 24% over the initial solution. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
